Order-Extension Principle/Strict/Finite Set

Theorem
Let $T$ be a finite set.

Let $\prec$ be a strict ordering on $T$.

Then there exists a strict total ordering $<$ on $T$ such that:
 * $\forall a, b \in T: \paren {a \prec b \implies a < b}$