Finite Non-Empty Subset of Totally Ordered Set has Smallest and Greatest Elements

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

Then every finite $T$ such that $\O \subset T \subseteq S$ has both a smallest and a greatest element.