I'm using Schröder-Bernstein to prove that $\mathbb{R}$ is equinumerous to $P(\mathbb{N})$, the power set of the naturals. Part of my proof requires that I find an injection from $[0,1]$ (which is equinumerous with $\mathbb{R}$) to $P(\mathbb{N})$. I already found the reverse injection by encoding membership of $n$ as the $n$th bit in a binary sequence following the decimal point.
Hints appreciated!
Edit: Thanks for all the suggestions. For those interested, I concluded that the following would be the most accessible and elegant way for me to prove $[0,1]$ is equinumerous with $P(\mathbb{N})$.
Let $f: [0,1] \rightarrow P(\mathbb{N})$ be defined as follows. Each $c \in [0,1]$ can be written in binary uniquely as $a_1.a_2a_3...$ by choosing the canonical representation of nonterminating $0$s rather than nonterminating $1$s when there is a choice. Then $f(c) = \{k: a_k = 1\}$ gives an injection.
Let $g : P(\mathbb{N})\rightarrow [0,1]$ work as follows. For any $A \in P(\mathbb{N})$, $g(A)$ is the decimal, rather than binary, representation $0.a_1a_2\ldots$, where for each $k \in \mathbb{N}$, $a_k = 1$ if $k \in A$ and $0$ otherwise. Note that we ensure injectivity because, in decimal, a number of the form $0.a_1a_2\ldots$ will only have multiple representations if one of them has a nonterminating tail of $9s$.
By Schröder-Bernstein, we have $\mathbb{R}$ is equinumerous to $P(\mathbb{N})$.