A map from a presented group is determined by images of generators that satisfy every defining relation. The example is deliberately concrete; it is a test of the statement, not a substitute for it.
Statement
A semidirect product combines groups \(N\) and \(H\) after choosing an action \(\alpha:H\to\operatorname{Aut}(N)\). A presentation records generators and relations but may conceal the size of the group.
The first display fixes the mathematical data. I label it \(\mathsf{data}\) mentally, while the next is the \(\mathsf{claim}\); the bridge between them is the displayed \(\Longrightarrow\), not an automatic implication.
Worked algebra
The following line is the smallest calculation that still exercises the mechanism. It keeps nested delimiters and the order of operations explicit.
Conceptual compression
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.
Caveat
Changing the action \(\alpha\) can change the group even when \(N\) and \(H\) remain fixed. The direct product is only the special case where the action is trivial.
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.