Theorems · Theorem · logic and foundations
Computable.option_map
∀ {α : Type u_1} {β : Type u_2} {σ : Type u_4} [inst : Primcodable α] [inst_1 : Primcodable β] [inst_2 : Primcodable σ]
{f : α → Option β} {g : α → β → σ}, Computable f → Computable₂ g → Computable fun a => Option.map (g a) (f a)- Defined in
- Mathlib.Computability.Partrec
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 95 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Primcodablestatement and proof · cited by 325
- Computablestatement and proof · cited by 80
- Computable₂statement and proof · cited by 32
- Computable.option_someproof · cited by 4
- Computable.option_bindproof · cited by 3
- Computable.comp₂proof · cited by 1
Cited by3
Results whose statement or proof uses this declaration.
- Computable.sumCasesOnproof · cited by 5
- Computable.nat_strong_recproof · cited by 1
- Nat.Partrec.Code.computable_recOnproof · cited by 0