Theorems · Theorem · number theory
Nat.find_comp_succ
∀ {p : ℕ → Prop} [inst : DecidablePred p] (h₁ : ∃ n, p n) (h₂ : ∃ n, p (n + 1)), ¬p 0 → Nat.find h₁ = Nat.find h₂ + 1- Defined in
- Mathlib.Data.Nat.Find
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 67 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidablePred
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Nat.findstatement and proof · cited by 139
- Nat.find_specproof · cited by 74
- Nat.find_minproof · cited by 30
- Nat.find_eq_iffproof · cited by 6
Cited by2
Results whose statement or proof uses this declaration.
- CompactExhaustion.find_shiftrproof · cited by 2
- Stream'.Seq.length_consproof · cited by 1