Let $(q_n) = q_1, q_2, \ldots$ be an enumeration of the rational numbers.
Consider some real number $a$. We can recursively define a strictly increasing function
$\tag 1 \alpha: \Bbb N \to \Bbb N$
as follows:
$\quad \alpha(1) = \text{the smallest natural number } k \text{ such that } \big [ q_k \lt a \big ] \land \big [ a - q_k \lt 1 \big ]$
Assume $\alpha$ is defined on $\{1,2,\dots,n\}$. Define
$\quad \alpha(n+1) = \text{the smallest natural number } k \text{ such that }$
$\quad \quad \big [k \gt \alpha(n) \big ] \land \big [q_k \gt q_{\alpha(n)} \big ] \land \big [q_k \lt a \big ]\land \big [a - q_k \lt \frac{1}{n+1}\big ]$
It is easy to see that the subsequence ${\big ( q_{\alpha(n)}\big )}_{ n \in \Bbb N}$ is strictly increasing and converges to $a$.