Quotienting by the commutator subgroup removes exactly the obstruction to commutativity. The example is deliberately concrete; it is a test of the statement, not a substitute for it.
Set-up
A homomorphism \(\varphi:G\to H\) packages a comparison of operations. Its kernel \(\ker\varphi\) measures collapse, while its image \(\operatorname{im}\varphi\) records the part of \(H\) actually reached.
The typography mirrors the proof: first declare \(\mathsf D\), then state \(\mathsf C\). The symbol \(\Longrightarrow\) below is a logical dependency, not extra mathematical structure.
The calculation
The following line is the smallest calculation that still exercises the mechanism. It keeps nested delimiters and the order of operations explicit.
What survives abstraction
The compact alignment is a local map of the argument: assumptions on the first row, consequence on the second. Any generalisation must preserve that dependency.
The boundary
The quotient notation \(G/N\) is legal only for \(N\trianglelefteq G\). A set of cosets may exist without inheriting a well-defined group multiplication.
I would use the boxed line as a reference later, while returning to the full display whenever a hypothesis becomes uncertain. That division keeps compression from becoming ambiguity.