No function from a set onto its power set can be surjective. I will separate the object being defined from the consequence being claimed.
Start locally
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.
Compute before generalising
The computation below is not a second theorem. It is a checksum for the definitions and a place to inspect the difficult LaTeX at full size.
The global view
The aligned summary deliberately puts the datum and conclusion on different rows. Mathematically, this is the distinction between specifying an object and proving a property of it.
Edge conditions
Infinite cardinal arithmetic does not follow finite intuition. Removing one element or doubling a countably infinite set does not change its cardinality.
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.