Consider a function f that takes all the supraunitary digits of the real number and assign them on the odd positions of the natural number and all the subunitary digits in reverse order and assign them on the even positions of the natural number. This mapping is unique.
How would Cantor's diagonal argument work on this mapping? Surely for any real number r, constructed using this argument, f would construct a unique natural number, which is part of the mapping, contradicting that r isn't mapped.
A more formal definition for the proposed function and its inverse:
Let $f\colon\mathbb{R}\to\mathbb{N}$ such as for any real number with the decimal representation $a_n ... a_2 a_1. b_1 b_2 ... b_m$ with $a_n \neq 0$ and $b_m \neq 0$: \begin{equation} f(a_n ... a_2 a_1. b_1 b_2 ... b_m)= \begin{cases} b_m 0 \dots b_2 a_2 b_1 a_1& \text{if}\ n<m\\ b_n a_n \dots b_2 a_2 b_1 a_1& \text{if}\ n=m\\ a_n 0 \dots b_2 a_2 b_1 a_1& \text{if}\ n>m\\ \end{cases}\label{fdef} \end{equation}
Let $f^{-1}\colon\mathbb{N}\to\mathbb{R}$ such as for any natural number with the decimal representation $\dots x_6 x_5 x_4 x_3 x_2 x_1$: \begin{equation} f^{-1}(\dots x_6 x_5 x_4 x_3 x_2 x_1)= \dots x_5 x_3 x_1. x_2 x_4 x_6 \dots\label{finvdef} \end{equation}