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

Theorem
Let $\left({S, \preceq}\right)$ be a totally ordered set.

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