Theorems · Theorem · logic and foundations
Partrec.map
∀ {α : Type u_1} {β : Type u_2} {σ : Type u_3} [inst : Primcodable α] [inst_1 : Primcodable β] [inst_2 : Primcodable σ]
{f : α →. β} {g : α → β → σ}, Partrec f → Computable₂ g → Partrec fun a => Part.map (g a) (f a)- Defined in
- Mathlib.Computability.Partrec
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 78 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
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.mapstatement · cited by 65
- Partrecstatement and proof · cited by 48
- Computable₂statement and proof · cited by 32
- Partrec.bindproof · cited by 10
- Part.bind_some_eq_mapproof · cited by 6
Cited by8
Results whose statement or proof uses this declaration.
- Partrec.rfindproof · cited by 4
- Partrec.option_some_iffproof · cited by 2
- Computable.bind_decode_iffproof · cited by 1
- Nat.Partrec.rfind'proof · cited by 1
- ComputablePred.computable_iff_re_compl_reproof · cited by 1
- Partrec.bind_decode₂_iffproof · cited by 1
- Partrec.dom_reproof · cited by 1
- Partrec.fixproof · cited by 0