Theorems · Theorem · logic and foundations
Partrec.rfind
∀ {α : Type u_1} [inst : Primcodable α] {p : α → ℕ →. Bool}, Partrec₂ p → Partrec fun a => Nat.rfind (p a)- Defined in
- Mathlib.Computability.Partrec
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 90 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Primcodable
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites28
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Primcodablestatement and proof · cited by 325
- PFunstatement and proof · cited by 207
- Part.someproof · cited by 111
- Primrec.compproof · cited by 80
- Encodable.decodeproof · cited by 77
- Part.bindproof · cited by 70
- Primrec.sndproof · cited by 66
- Part.mapproof · cited by 65
- Nat.pairproof · cited by 62
- Part.bind_someproof · cited by 49
- Partrecstatement · cited by 48
- Primrec.to₂proof · cited by 37
Cited by4
Results whose statement or proof uses this declaration.
- Nat.Partrec'.to_partproof · cited by 2
- Partrec.rfindOptproof · cited by 2
- Computable.findproof · cited by 0
- Partrec.fixproof · cited by 0