Sketch: uniqueness of inverses by the usual v = v(uw) = (vu)w = w computation, closure of units under products and inverses by direct computation, and the group axioms for the units by restriction.
Throughout, is associative with neutral element (Monoids (i), Semigroups (i), Associative and Commutative Binary Operations, and Neutral Elements (i), Associative and Commutative Binary Operations, and Neutral Elements (iii)), so brackets in products are dropped, and units and inverses are as in Units of a Monoid (i).
We begin with (i). Let and be inverses of a unit , so that and . Then
so has only one inverse.
For (ii), the equation says that is a unit and that is an inverse of itself. Since inverses are unique by (i), .
For (iii), let and be units. Then
and in the same way . Thus is an inverse of , so is a unit, and by (i).
For (iv), let be a unit. The equations , read the other way round, say that is an inverse of . Hence is a unit, and by (i).
Finally, for (v), let be the restriction of to , where is the set of units of (Units of a Monoid (ii)); it is a function with domain and for (Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction (ix)). By (iii) a product of two units is a unit, so takes its values in and is a binary operation on (Binary Operations on a Set (i)). It is associative because is, so is a semigroup (Semigroups (i)). By (ii), lies in , and it is neutral for because it is neutral for . Hence is a monoid (Monoids (i)), and its identity is , since a binary operation has at most one neutral element (A Binary Operation Has at Most One Neutral Element (i)). Now let . By (iv), lies in , and
so is a unit of the monoid (Units of a Monoid (i)). Every element of is therefore a unit of , which is thus a group (Groups and Abelian Groups (i)).
Loadingβ¦