Theorems · Theorem · number theory
Nat.find_add
∀ {n : ℕ} {p : ℕ → Prop} [inst : DecidablePred p] {hₘ : ∃ m, p (m + n)} {hₙ : ∃ n, p n},
n ≤ Nat.find hₙ → Nat.find hₘ + n = Nat.find hₙ- Defined in
- Mathlib.Data.Nat.Find
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 24 from the axioms · uses propext, Quot.sound
- Assumes
- DecidablePred
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- le_antisymmproof · cited by 2,068
- le_transproof · cited by 985
- Nat.findstatement and proof · cited by 139
- Nat.find_leproof · cited by 9
- Nat.le_find_iffproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Nat.sInf_addproof · cited by 1