Theorems · Theorem · logic and foundations
Partrec.rfindOpt
∀ {α : Type u_1} {σ : Type u_2} [inst : Primcodable α] [inst_1 : Primcodable σ] {f : α → ℕ → Option σ},
Computable₂ f → Partrec fun a => Nat.rfindOpt (f a)- Defined in
- Mathlib.Computability.Partrec
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 91 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- PrimcodablePrimcodable
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Primcodablestatement and proof · cited by 325
- Partrecstatement · cited by 48
- Primrec.to_compproof · cited by 40
- Computable₂statement and proof · cited by 32
- Computable.compproof · cited by 31
- Partrec.bindproof · cited by 10
- Partrec.to₂proof · cited by 9
- Nat.rfindOptstatement · cited by 9
- Computable.ofOptionproof · cited by 7
- Computable.partrecproof · cited by 5
- Partrec.rfindproof · cited by 4
- Primrec.option_isSomeproof · cited by 1
Cited by2
Results whose statement or proof uses this declaration.
- Nat.Partrec.Code.eval_partproof · cited by 5
- Nat.Partrec.merge'proof · cited by 1