Transfinite Induction
Usual induction is over N; transfinite induction is induction over well-orders.
Let (A,≤) be a well-ordering and let ϕ be a formula.
Assume that for every a∈A if ϕ(b) holds on every b⪇a, then ϕ(a) holds
Then ϕ(a) holds for every a∈A.
Assume the preconditions. Let B={b∈A:ϕ(b)} and assume for contradiction that B=A. Then B⊊A; ie, A∖B is nonempty. Since (A,≤) is well-ordered, then A∖B has a least element; call it b0. Since b0 is least, we know for each a<b0 that ϕ(a) holds. But by assumption that means that ϕ(b0) holds. Contradiction. Hence B=A, so ϕ holds on all a∈A.