Theorems · Theorem · logic and foundations

PrimrecRel.comp

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

Defined in

Mathlib.Computability.Primrec.Basic

Cited by

17 results in Mathlib

Foundations

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

Assumes

PrimcodablePrimcodablePrimcodable