Caution: Axiom of Completeness is not assumed here.
Before reading my attempt, I want you to think up a proof of your own.
Here is my attempt:
Let $D$ be the set of all upper bounds of $A$ as well as $B$. Since $\sup A$ exists, $\sup A \le d$ for all $d \in D$. It also means $D$ is bounded below. Now I have to show that $\inf D$ exists and is equal to $\sup A$. (This is the part that I have no idea how to approach.) Then since $\inf D$ exists, $\sup B$ exists and is equal to $\inf D$. Therefore, $\sup A = \sup B$.
This concludes my proof. Two questions:
- How do I show the part in my proof where I was stuck?
- Is there any other way to prove it? Preferably much simpler. I want to see some other ways.
Let $U(A)$ be the set of upper bounds for $A.$ The definition of $\sup A$ is $\min U(A),$ which exists iff $U(A)$ has a least member.
Suppose $U(A)=U(B)$ and that $\sup A$ exists. Then $\min U(A)$ exists. So $\min U(B)=\min U(A)$ exists because $U(A)$ and $U(B)$ are the same thing.
Hence $\sup A=\min U(A)=\min U(B)=\sup B.$