The order of a unit modulo n divides the group exponent and any positive exponent returning it to one. A small computation will anchor the general statement before the abstraction takes over.
Statement
Congruences turn divisibility into arithmetic in \(\mathbf Z/n\mathbf Z\). The unit group \((\mathbf Z/n\mathbf Z)^\times\) controls which residues can be cancelled, inverted, or assigned a multiplicative order.
The definition determines which expressions are legal; only then does the identity become meaningful. An equality in \(\mathcal A\) may change ambient meaning, so I keep \(\mathsf D\) separate from \(\mathsf C\).
Worked algebra
Here is a concrete symbolic test. Reading it from left to right reveals which transformation is reversible and which is only an implication.
Conceptual compression
The invariant statement is the one that does not depend on a convenient choice of coordinates, representatives, basis, or enumeration.
Caveat
Cancellation modulo \(n\) requires a unit. Dividing both sides by a zero divisor is one of the fastest ways to manufacture a false congruence.
The final box is a summary, not a new assumption; the proof still lives in the definitions and the intervening calculation. The source keeps each scope delimiter visible for later inspection.