Knowing that there is no surjection from $\Bbb{N}$ to $\Bbb{R}$, I also know that there is no injection going the other way.
I know how to prove that there is no injection from the power set of $S$ to $S$, but how can I prove that there is no injection from $\Bbb{R}$ to $\Bbb{N}$?
(I would, of course, be happy with showing no injection from $(0,1)$, or any other interval to $\Bbb{N}$.)
[EDIT] I usually prove that cardinality of $\mathcal{P}(S)$ is greater than that of $S$ by showing that any function $f: S \to \mathcal{P}(S)$ fails to be surjective. This is done by showing that there is no $s \in S$ for which $f(s) = {\{ s\in S | s \notin f(s) \}}$.
It is possible instead to show that any function $f:\mathcal{P}(S) \to S$ fails to be injective by showing that the image of $T = \{s \in S| \exists U \left( f(U)=s \land s \notin U \right) \}$ must be the image of two elements of $\mathcal{P}(S)$.
I would like to replace the usual diagonal proof that any function $\Bbb{N} \to (0,1)$ fail to be surjective with a proof that any function $f:(0,1) \to \Bbb{N}$ fails to be injective. (Or that any function $f:\Bbb{R} \to \Bbb{N}$ fails to be injective.)