Well-Ordering Principle

The claim that every nonempty set of positive integers (or more generally every set that is well-orderable) has a least element with respect to the usual ordering; in practice often stated for the natural numbers as 'every nonempty subset of N has a least element.'