 Well-order

A well-order is a total order in which every nonempty subset has a least element.

A well-order is a type of ordering on a set, with specific properties that make it particularly useful in various areas of mathematics, particularly in set theory and number theory.