There is always a smallest one
You cannot descend forever through the counting numbers. Pick any non-empty set of them — the primes, the numbers with some weird property, anything — and one of them is the smallest. It sounds obvious, but it is a genuine axiom about the natural numbers, and it powers a classic proof move: 'take the smallest counterexample... and derive a contradiction.'
A crowd where everyone has a different whole-number height in centimeters: someone must be the shortest. Compare with fractions, where there is NO smallest positive fraction — you can always halve it. Whole numbers are special.
Proof that every n > 1 has a prime divisor uses it: look at all divisors of n that are greater than 1; the smallest one must be prime, because any factor of it would be an even smaller such divisor.
It legitimizes 'minimal counterexample' arguments, one of the most used proof techniques in mathematics and computer science (e.g. proving algorithms terminate).
Level 1 The precise statement
Every nonempty set of natural numbers has a least element.
Level 3 What it stands on (0 direct)
Nothing — this is foundational. It is one of the roots of the graph.
Level 4 The verified record
This page is generated from a machine-checked node. The kernel confirms its dependencies resolve, nothing is circular, and it grounds in axioms (foundation: peano). The content hash below makes tampering evident.
7 downstream results would collapse with it. See the blast radius on the graph →