Any proposed enumeration of infinite binary sequences misses the sequence obtained by flipping the diagonal. The point is to make the formal expression readable enough to audit line by line.
Notation
Cardinality compares sets through bijections rather than geometry. The notation \(|A|\le|B|\) means an injection \(A\hookrightarrow B\) exists, while equality requires a bijection.
A reliable calculation names domain and codomain. The notation \(\mathsf{data}\mapsto\mathsf{claim}\) is harmless only after both \(\operatorname{dom}\) and \(\operatorname{cod}\) have been fixed.
Stress the formula
Now evaluate one representative case. The result should agree with the structural law above, but it is obtained without assuming the conclusion.
Interpretation
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.
Limit of the argument
Infinite cardinal arithmetic does not follow finite intuition. Removing one element or doubling a countably infinite set does not change its cardinality.
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.