Theorems · Theorem · logic and foundations

Primrec.comp

∀ {α : Type u_1} {β : Type u_2} {σ : Type u_3} [inst : Primcodable α] [inst_1 : Primcodable β] [inst_2 : Primcodable σ]
  {f : β → σ} {g : α → β}, Primrec f → Primrec g → Primrec fun a => f (g a)

Defined in

Mathlib.Computability.Primrec.Basic

Cited by

80 results in Mathlib

Foundations

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

Assumes

PrimcodablePrimcodablePrimcodable