Well-ordering Principle

For any nonempty set of positive integers, there is a Least Element.

If S is a set of integers, then there is a Least Element x \in S, such that for every element y \in S, x \leq y.