Theorem. Let G be a nonempty set with a binary operation and satisfy the following.
(a) Associative rule. i.e. a(bc)=(ab)c for all a, b, c in G.
(b) Existence of left identity. i.e. There exists e in G s.t. ea = a for all a in G.
(c) Existence of left inverse element. i.e. For all a in G there exists a' in G s.t. a' a = e.
Then G is a group.
Proof. Denote a' for the left inverse element of a in G.
First, we see as a lemma that c2 = c implies c = e, for
Corollary. Let G be a nonempty set with a binary operation and satisfy the following.
(a) Associative rule. i.e. a(bc)=(ab)c for all a, b, c in G.
(b) Existence of right identity. i.e. There exists e in G s.t. ae = a for all a in G.
(c) Existence of right inverse element. i.e. For all a in G there exists a' in G s.t. aa' = e.
Then G is a group.
Geschrieben von Sooji Shin