I wish to prove that for every real number, $x$, there is a subset of the rationals, $S$, such that $x$ is the least upper bound of $S$.
At first glance this appeared axiomatic to me, however upon further inspection I supposed it was a trivial fact, once I started working on a proof I found it quite difficult. I may be approaching this in the wrong manner but here is my work so far:
If $x$ is rational, this is the case because $x$ is the least upper bound of $\{x\}$.
If $x$ is irrational things get a little murkier, and much hand wavier.
Let us have some set $A$ and its least upper bound $a$. If we take some element of $A$, lets call it $b$ and some set $B$ that has a least upper bound of $b$ we can create a new set $\left(A \setminus \{b\}\right) \cup B$ that is also has a least upper bound of $a$. (I haven't proven this is true but it makes intuitive sense)
Via this process we know that if there is no subset of the rationals with a least upper bound of $x$ every set with a least upper bound of $x$ must also contain at least one element with this property otherwise we would be able to expand our set into a set with a least upper bound of $x$.
And that's all I have. The final conclusion seems impossible but I can't seem to prove that it is not the case.
In addition this pre-supposes that every real number is the least upper bound of a set that does not contain itself, a fact I cannot myself prove.
I would appreciate any tips or suggestions on finishing this proof.