Exercise 1.9 Suppose $z = a + bi, w = c + di$. Define $z<w$ if $a<c$, and also if $a = c$ but $b<d$. Prove that this turns the set of all complex numbers into an ordered set. (This type of order relationis called a dictionary order, or lexicographic order, for obvious reasons.) Does this ordered set have the least upper bound property?
The solution of this question is the procedure this set has an ordered property such as "$x<y$ or $x=y$ or $x>y$", "$x<y$ and $y<z$ then $x<z$". enter image description here
But I think that this question already gives us that this set is ordered, so we don't need prove it. In addition, all of ordered sets have a least-upper-bound property, so we also need not prove they have a least-upper-bound property. I think this book asks us a wrong question. Is it right? ps. Why this solution doesn't prove there is a least upper bound?