>>774
つづき

（参考）
https://en.wikipedia.org/wiki/Mathematical_induction
Mathematical induction （数学的帰納法）
(抜粋)
8 Equivalence with the well-ordering principle
Equivalence with the well-ordering principle
The principle of mathematical induction is usually stated as an axiom of the natural numbers; see Peano axioms. However, it can be proved from the well-ordering principle.
It can also be proved that induction, given the other axioms, implies the well-ordering principle.（整列原理）

https://en.wikipedia.org/wiki/Well-ordering_principle
Well-ordering principle （整列原理）
(抜粋)
In mathematics, the well-ordering principle states that every non-empty set of positive integers contains a least element.[1]
In other words, the set of positive integers is well-ordered by its "natural" or "magnitude" order in which x precedes y if and only if y is either x or the sum of x and some positive integer (other orderings include the ordering 2, 4, 6, ..., 1, 3, 5, ...).

https://ja.wikipedia.org/wiki/%E6%95%B4%E5%88%97%E9%9B%86%E5%90%88
整列集合
(抜粋)
自然数全体の成す集合 N が通常の大小関係 "<" に関して整列集合となるという事実は、一般に整列原理と呼ばれる。
(引用終り)

つづく