Proposition: Let X be a linearly ordered set with order <. Then X has the least upper bound property iff (if and only if) X has the greatest lower bound property.
I know that if I Let X be a linearly ordered set with order <. We say that X has the least upper bound property iff every nonempty subset A $\subset$ X that is bounded above has a least upper bound. Similarly, we say that X has the greatest lower bound property iff every nonempty subset A $\subset$ X that is bounded below has a greatest lower bound. However, I dont know how to show or relate both the things.
I need to show that if X has LUB property, then X has GLB property and the other way. Can someone help me with a complete proof of this? Let me know if you have questions!!
Appreciate your patience and time.
Assume GLB.
Let A be a not empty, bounded above subset.
Let B be the set of all upper bounds of A.
Show sup A = inf B. (LUB A = GLB B)
LUB implies GLB is simply the order dual of above.