# Category:Well-Orderings

The ordering $\preceq$ is a well-ordering on $S$ if and only if every non-empty subset of $S$ has a smallest element under $\preceq$:
$\forall T \subseteq S: \exists a \in T: \forall x \in T: a \preceq x$