Cancellation Laws

Theorem
Let $$G$$ be a group.

Let $$a, b, c \in G$$.

Then:
 * $$b a = c a \implies b = c$$;
 * $$a b = a c \implies b = c$$.

These are respectively called the right and left cancellation laws.

Proof
Let $$a, b, c \in G$$ and let $$a^{-1}$$ be the inverse of $$a$$.

Suppose $$b a = c a$$.

Then:

$$ $$ $$ $$

Thus, the right cancellation law holds. The proof of the left cancellation law is analogous.

Alternatively, the fact that All Group Elements are Cancellable follows from the behaviour of invertible elements of a monoid.