This is different to the linked question as the answers to that question do not address the actual process of finding m1 and m2.
The theorem states:
(a) If x ∈ R, y ∈ R and x >0, then there exist a positive integer n such that nx >y.
(b) If x ∈ R, y ∈ R, and x < y, then there exists a p ∈ Q such that x < p < y.
I understand part (a) of the theorem. Proof of part (b) opens as follows:
Since x < y , we have y - x > 0 and (a) furnishes a positive integer n such that n(y - x) > 1.
This part I understand. But I'm unsure how this next part is done:
Apply (a) again, to obtain positive integers m1 and m2 such that m1 > nx, m2 > -nx. Then -m2 < nx < m1
How are the integers m1 and m2 obtained? I know that it involves the same process used in part a, I just can't figure out the steps.