Theorems · Theorem · logic and foundations

Primrec.nat_rec

∀ {α : Type u_1} {β : Type u_2} [inst : Primcodable α] [inst_1 : Primcodable β] {f : α → β} {g : α → ℕ × β → β},
  Primrec f → Primrec₂ g → Primrec₂ fun a n => Nat.rec (f a) (fun n IH => g a (n, IH)) n

Defined in

Mathlib.Computability.Primrec.Basic

Cited by

3 results in Mathlib

Foundations

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

Assumes

PrimcodablePrimcodable