Theorems · Theorem · logic and foundations
Nat.rfindOpt_mono
∀ {α : Type u_1} {f : ℕ → Option α},
(∀ {a : α} {m n : ℕ}, m ≤ n → a ∈ f m → a ∈ f n) → ∀ {a : α}, a ∈ Nat.rfindOpt f ↔ ∃ n, a ∈ f n- Defined in
- Mathlib.Computability.Partrec
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 27 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Partstatement · cited by 325
- le_max_leftproof · cited by 215
- le_max_rightproof · cited by 205
- Part.Domproof · cited by 145
- Part.getproof · cited by 77
- Nat.rfindOptstatement and proof · cited by 9
- Nat.rfindOpt_specproof · cited by 3
- Nat.rfindOpt_domproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Nat.Partrec.Code.eval_eq_rfindOptproof · cited by 2