I had a question in one of my group theory exercises, it goes as follows.
Suppose that in the definition of a group $G$, the condition that $\exists$ an element $e$ with the property
$$ae = ea = a \,\,\,\forall\, a \in G$$
is replaced by $ae = a \,\,\,\forall\, a \in G$. Then show that $ea = a \,\,\,\forall\, a \in G.$
The solution that was provided for this problem used cancellation property $$ab = ac \implies b= c$$
Solution:
We're given that $$ae = a$$
Pre-multiplying $a^{-1}$ on both sides we get, $$ a^{-1}(ae) = a^{-1}a$$ $$ (a^{-1}a)e = a^{-1}a$$ Post multiplying both sides by a $$ (a^{-1}a)ea = a^{-1}aa$$ $$ \therefore eea = ea$$ By the cancellation property we get $$ ea = a$$
But this cancellation property is proved using the very condition i.e. $ea = a \,\,\,\forall\, a \in G$ that we're trying to prove here.
So am I correct in assuming that the cancellation property as stated above cannot be used? Also is there an alternate approach to solve this question?