Bottom is Unique

From ProofWiki
Jump to navigation Jump to search

Theorem

Let $\left({S, \vee, \wedge, \preceq}\right)$ be a lattice.


Then $S$ has at most one bottom.


Proof

By definition, a bottom for $S$ is a smallest element.

The result follows from Smallest Element is Unique.

$\blacksquare$