Def. A group $G$ is a set not empty in which is definited a binary operation $G\times G\to G$ denoted with $(a,b)\mapsto ab$ such that $$(i)\quad(ab)c=a(bc)\;\text{for all}\; a,b\in G;$$ $$(ii)\quad\text{exist}\; u\in G\;\text{such that}\; ua=a=au\;\text{for all}\;a\in G;$$ $$(iii)\quad a\in G, \exists x\in G\;\text{such that}\; ax=u=xa.$$
Quotient axiom Let $G$ a not empty set with a binary operation. Let $a,b\in G$ then exist $x,y\in G$ such that $ax=b$ and $ya=b$.
Exercise Suppose true $(i)$ and the quotient axiom, we must prove that $(ii)$ is true.
My attempt. Let $a,b\in G$, then for hypothesis exists $x,y\in G$ such that $ax=b$ and $ya=b$, then we have $$bx=(ya)x=y(ax)=yb$$
Question How can I continue at this point to obtain the thesis?
Thanks!
Let $a\in G$ (which exists because $G$ is not empty). We know there exists $u\in G$ such that $au=a$. I claim that for all $b\in G$, $bu=b$.
Indeed, let $b\in G$. Then there exists $y$ such that $b=ya$. Then $bu=(ya)u$.
Can you take it from here?
Then, to show $u$ works on both sides, note that there exists $v\in G$ such that $va = a$. Show (along similar lines) that $vb=b$ for all $b\in G$. Then look at $vu$.