Real Numbers are Uncountably Infinite/Proof 2 using Ternary Notation

Proof
Define a mapping $f: \powerset {\N_{>0} } \to \R$ thus:


 * $\map f S = 0.d_1 d_2 \ldots$, interpreted as a ternary expansion where $\sequence {d_n}$ is the characteristic function of $S$.

That is:
 * $\displaystyle \map f S = \sum_{i \mathop \in S} 3^{-i}$

By the lemma, $f$ is an injection.

that $\R$ is countable.

Then there is an injection $g: \R \to \N$.

By Composite of Injections is Injection, $g \circ f: \powerset \N \to \N$ is an injection.

But this contradicts No Injection from Power Set to Set.

Hence, by Proof by Contradiction, $\R$ is not countable.