Theorems · Definition · logic and foundations
Nat.rfindOpt
{α : Type u_1} → (ℕ → Option α) → Part αFind the smallest n satisfying f n, where all f k for k < n are defined as false.
Returns a Part.
- Defined in
- Mathlib.Computability.Partrec
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 24 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
- Part.bindproof · cited by 70
- Part.ofOptionproof · cited by 33
- Nat.rfindproof · cited by 17
Cited by9
Results whose statement or proof uses this declaration.
- Nat.Partrec.Code.eval_partproof · cited by 5
- Nat.rfindOpt_specstatement and proof · cited by 3
- Nat.rfindOpt_domstatement and proof · cited by 2
- Partrec.rfindOptstatement · cited by 2
- Nat.Partrec'.of_partproof · cited by 2
- Nat.Partrec.Code.eval_eq_rfindOptstatement · cited by 2
- Nat.rfindOpt_monostatement and proof · cited by 1
- Nat.Partrec'.rfindOptstatement · cited by 1
- Nat.Partrec.merge'proof · cited by 1