Theorems · Theorem · order theory
Nat.case_strong_induction_on
∀ {p : ℕ → Prop} (a : ℕ), p 0 → (∀ (n : ℕ), (∀ m ≤ n, p m) → p (n + 1)) → p a- Defined in
- Mathlib.Data.Nat.Init
- Cited by
- 10 results in Mathlib
- Foundations
- Depth 16 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by10
Results whose statement or proof uses this declaration.
- BinaryTree.treesOfNumNodesEq_card_eq_catalanproof · cited by 1
- PowerBasis.repr_pow_isIntegralproof · cited by 1
- ProbabilityTheory.Kernel.le_lmarginalPartialTraj_succproof · cited by 1
- ProbabilityTheory.Kernel.trajContent_tendsto_zeroproof · cited by 1
- mem_adjoin_of_smul_prime_smul_of_minpoly_isEisensteinAtproof · cited by 1
- Topology.RelCWComplex.cellFrontier_subset_finite_openCellproof · cited by 1
- norm_iteratedFDerivWithin_comp_le_auxproof · cited by 1
- Nat.nth_comp_of_strictMonoproof · cited by 1
- hoferproof · cited by 0