Any proof of this depends upon the set of definitions and axioms with the sequence of theorems you have.

Here is a general approach. If prove thatifthen there is at most one such .

Let . You want to show that and is bounded above.

If you can show those then use the completeness property.

Hint: let . Is it true that

What can you do with that?