Theorems · Theorem · logic and foundations

Partrec.cond

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

Defined in

Mathlib.Computability.RE

Cited by

3 results in Mathlib

Foundations

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

Assumes

PrimcodablePrimcodable