Mathlib Map

Theorems · Theorem · order theory

Nat.leRecOn_self

∀ {C : ℕ → Sort u_1} {n : ℕ} {next : {k : ℕ} → C k → C (k + 1)} (x : C n), Nat.leRecOn ⋯ (fun {k} => next) x = x
Defined in
Mathlib.Data.Nat.Init
Cited by
5 results in Mathlib
Foundations
Depth 19 from the axioms · uses propext
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Metric.toInductiveLimit_isometry · cited by 1Metric.toInductiveLimit_i…Metric.toInductiveLimit_commute · cited by 0Metric.toInductiveLimit_c…Nat.leRecOn_injective · cited by 0Nat.leRecOn_injectiveFirstOrder.Language.DirectedSystem.coe_natLERec · cited by 0DirectedSystem.coe_natLER…Nat.leRecOn_surjective · cited by 0Nat.leRecOn_surjectiveNat.leRecOn · cited by 13Nat.leRecOnNat.leRec_self · cited by 7Nat.leRec_selfNat.leRecOn_selfCITED BYCITES

Cites2

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by5

Results whose statement or proof uses this declaration.