Theorems · Theorem · logic and foundations

Computable.cond

∀ {α : Type u_1} {σ : Type u_4} [inst : Primcodable α] [inst_1 : Primcodable σ] {c : α → Bool} {f g : α → σ},
  Computable c → Computable f → Computable g → Computable fun a => bif c a then f a else g a

Defined in

Mathlib.Computability.Partrec

Cited by

4 results in Mathlib

Foundations

Depth 91 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

PrimcodablePrimcodable