Theorem 4.17

Statement:

In a group $G$ with binary operation $*$, there is only one element $e$ in $G$ such that

(1)
$$e * x = x * e = x$$

for all $x \in G$. Likewise for each $a \in G$, there is only one element $a'$ in $G$ such that

(2)
$$a' * a = a * a' = e$$

In summary, the identity element and inverse of each element are unique in a group.

Proof:

Theorem 3.13 shows that an identity element for any binary structure is unique. No use of the group axioms was required to show this.
Turning to the uniqueness of an inverse, suppose that $a \in G$ has inverses $a'$ and $a''$ so that $a' * a = a * a' = e$ and $a'' * a = a * a'' = e$. Then

(3)
$$a * a'' = a * a' = e$$

and by Theorem 4.15,

(4)
$$a'' = a',$$

so the inverse of a group is unique.

Note that in a group $G$, we have

(5)
$$(a * b) * (b' * a') = a * (b * b') * a' = (a * e) * a' = a * a' = e.$$

This equation and Theorem 4.17 show that $b' * a'$ is the unique inverse of $a * b$.

That is, $(a * b)' = b' * a'$. We state this as a corollary(see Corollary 4.18).