Theorems · Definition · logic and foundations
Nat.rfind
(ℕ →. Bool) → Part ℕ
Find the smallest n satisfying p n, where all p k for k < n are defined as false.
Returns a Part.
- Defined in
- Mathlib.Computability.Partrec
- Cited by
- 17 results in Mathlib
- Foundations
- Depth 23 from the axioms · uses no axioms
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.
- Partstatement · cited by 325
- PFunstatement and proof · cited by 207
- Part.Domproof · cited by 145
- Nat.rfindXproof · cited by 2
Cited by27
Results whose statement or proof uses this declaration.
- Nat.rfindOptproof · cited by 9
- Nat.Partrec.Code.exists_codeproof · cited by 5
- Partrec.rfindstatement and proof · cited by 4
- Nat.Partrec.ppredproof · cited by 4
- Nat.rfind_specstatement and proof · cited by 3
- Nat.rfindOpt_specproof · cited by 3
- Nat.rfindOpt_domproof · cited by 2
- Nat.rfind_domstatement · cited by 2
- Nat.rfind_minstatement and proof · cited by 2
- Nat.Partrec.noneproof · cited by 2
- Nat.rfind_dom'statement · cited by 1
- Nat.rfind_zero_nonestatement and proof · cited by 1