Greatest Element is Unique

Theorem
Let $\struct {S, \preceq}$ be a ordered set.

If $S$ has a greatest element, then it can have only one.

That is, if $a$ and $b$ are both greatest elements of $S$, then $a = b$.

Proof
Let $a$ and $b$ both be greatest elements of $S$.

Then by definition:
 * $\forall y \in S: y \preceq a$
 * $\forall y \in S: y \preceq b$

Thus it follows that:
 * $b \preceq a$
 * $a \preceq b$

But as $\preceq$ is an ordering, it is antisymmetric.

Hence, by definition of antisymmetric relation, $a = b$.

Also see

 * Smallest Element is Unique