Alternative proof and hints for: "rationals are dense in the reals" from Rudin's real analysis book I was trying to show on my own that for every two reals $x,y$ (such that $x<y$) then there is a rational number $p$ in between them. i.e.:
$$\forall x \in R, \forall y \in R, \exists q \in Q : x<q<y $$
I was following Rudin's analysis book so technically I only know so far the Archimedean property of R and there exists an ordered field with the least upper bound property and the greatest lower bound property (more precisely I only know up to theorem 1.20). 
I attempted to prove the theorem without looking at the answer (even when I looked at it it didn't provide much help really). I feel I have given it an honest attempt and it feels like I am really close to the answer (or at least applied some the facts I know non-trivially) so I was hoping I could get some hints on my current approach (if it has any chance of success) or what I am missing. I am fine if someone gives me the answer but I'd prefer it that part of the answer is hidden or if I mostly receive hints/ideas. So this is what I have tried:
We want $x < p < y$. Since $p$ is a rational we can have integers such that $x < \frac{n}{d} < y \iff dx < n <dy$. At this point is where I realized that maybe the Archimedean property might be useful. Lets focus on the RHS of the inequality first: $n <dy$. Recall the Archimedean property from Rudin's:
$$ \forall x \in R, \forall y \in R, x > 0, \exists n \in N : nx > y $$
i.e. there always exists a natural number to make a real number bigger than any other real number (or equivalently when x=1 there is always a natural number that bounds a real number). Now that we've recalled it we notice $n <dy$ is exactly of the form of the Archimedean property in the sense that for any real $n$ (and also any natural number $n$) and any real $y$, there exists a natural number $d$ that makes $n <dy$. The important thing to notice is that some $d$ exists and that this holds for our specific $y$ we are interested in. Notice we have not chosen $n$, just asserted the existence of such a $d$.
Then at this point I thought that maybe I needed to use the Archimedean property on the LHS. The LHS of what we want is $dx < n$. Unfortunately this seemed backwards from what I needed so I negated it and got $-d' x > n \iff d' (-x) > -n = \hat n$. This holds for some $d'$ (maybe different from the first $d$ I mentioned) and for all $-x \in R, -x > 0$ and any $-n \in N$ (in particular any natural number). I tried combining this with the first statement I got by requesting $\hat n = n$ (which is true since we the two statements held for any $\hat n$ and $n$) but that yielded $ d(-x) > n < dy $ which didn't seem useful.
Anyhow, I didn't give up and so I tried something else with the LHS $dx < n$. I noticed that when $d=1$ then $x < n$ is in fact the Archimedean property. In other words there is some real number $n$ that makes $x < n$. Since the RHS $n <dy$ holds for any $n$ I choose $n$ that made $x < n$ true. Thus I finally got something that connected $x$ and $y$ with only (seemingly) true statements:
$$ x < n < d y$$
then I divided by $d$ to get:
$$ \frac{x}{d} < \frac{n}{d} < y$$
Unfortunately, I can't call it a day since $\frac{n}{d}$ might be smaller than $x$. 
At this point I noticed I could define the set $A$ as follow:
$$ A = \{ q \in Q: q < y \}$$
Notice $\frac{n}{d}$ is constructed from specific $n$ and $d$ that makes $x<n$ true and $n < dy$. Thus $\frac{n}{d}$ exists and its in $A$ (i.e. $\frac{n}{d} \in A$). Thus $A \not = \emptyset $.
At this point it was obvious that since $A \subset R$ (non empty) and $R$ has the least upper bound (LUB) and greatest lower bound (GLB) property, then it was clear that $A$ had a supremum. Let that supremum be $\alpha = sup A = LUB(A)$. At this point I noticed that if $y \in Q \implies y \in A$ and can take the average of $\frac{n}{d}$ and $y$ to construct the $q$ in between $x < q < y$ that we wanted. Not a very rigorous ending to this case but at least I had an idea that it could be done. 
However, when $y \not \in Q$ seems to be the challenging case. Thus, I noticed that to complete the proof I just had to show that I can always construct a smaller fraction that is larger than $\frac{n}{d}$ but smaller than $y$ and eventually get it large enough that its larger than $x$. It seems thats the piece of the proof that I might be missing. What hints can people provide to show that indeed we con construct such a $q \in Q$? Or maybe this direction for the proof is not correct and I should go back? My intuition tells me right now that the Archimedean property has to be important because it the only statement that I know that generates relations between natural numbers and real numbers, so it feels I have to apply that property at least twice (to the RHS and LHS) to then generate two natural numbers that I can divide to generate the fraction I am looking for. Anyone has any ideas/hints alongs these lines?

As a side thought I remember that example 1.1 (in Rudin) had me show nearly an identical thing, that $A = \{ q \in Q_+ : p^2 < 2 \}$ and show there was no largest number in $A$. Unfortunately, that proof seemed to strongly rely on the fact of squares and square roots as shown here. Furthermore, it feels that I could just recycle that proof (and maybe with some additional logic show it is eventually is larger than $x$ but less than $y$) to compete this proof, however, it feels like cheating because I don't actually know right now that every real number has a square root (a fact introduced next page that seems to use the fact I am trying to prove right now). 
So I've thought about it a bit right now but I seem a bit stuck. Ideally I want hints but the actual answer is fine too, though, it would be nice to hid that part or at least warn me its the answer. Ideally I'd like to think for myself as much as I can but right now I feel a bit disoriented.
 A: The key thing you're missing is that you need to somehow take into account how much greater $y$ is than $x$.  To provide a bit of intuition, imagine you were in a non-Archimedean world and $y$ was "infinitesimally" greater than $x$.  For instance, maybe $x=0$ and $y$ is some positive but infinitesimal number (that is, $y<1/n$ for every positive integer $n$).  Then you wouldn't be able to find any rational number between $x$ and $y$, since there are no (nonzero) infinitesimal rational numbers.
So this suggests that you should apply the Archimedean property not to $x$ or $y$ themselves, but to the difference $y-x$.  That is, you want to choose $d\in\mathbb{N}$ such that $d(y-x)$ is large.  Just thinking intuitively, how large would you need $d(y-x)=dy-dx$ to be to ensure there is an integer $n$ between $dx$ and $dy$?  Choosing $d$ such that $d(y-x)$ is that large, you can now try to prove that such an $n$ really exists.
The details of one way to carry this out are hidden below.

 Intuitively, if $dy-dx>1$, then there should be an integer between $dx$ and $dy$.  So choose $d$ such that $d(y-x)>1$, by the Archimedean property.  Now by the Archimedean property, there exist integers $a$ and $b$ such that $a<dx<b$.  The set $S=\{c\in\mathbb{Z}:c>dx\}$ is thus nonempty and bounded below.  Any nonempty bounded-below set of integers contains a least element; let $n$ be the least element of $S$.  Then $n>dx$.  If $n\geq dy$, then $n-1\geq dy-1>dx$ so $n-1\in S$, which contradicts minimality of $n$.  Thus $n<dy$ and so $\frac{n}{d}$ is between $x$ and $y$.

