Cantor's Non-Equinumerosity Theorems, Inductively

We apply an inductive argument to three theorems of Cantor on (1) the uncountability of infinite binary sequences, (2) the uncountability of real numbers, and (3) the non-equinumerosity of sets with their powersets. This technique proves the powerset theorem by assuming the Axiom of Choice.