Theorems · Theorem · logic and foundations

Primrec.cond

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

Defined in

Mathlib.Computability.Primrec.Basic

Cited by

7 results in Mathlib

Foundations

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

Assumes

PrimcodablePrimcodable