Theorems · Theorem · logic and foundations

Primrec.bind_decode_iff

∀ {α : Type u_1} {β : Type u_2} {σ : Type u_3} [inst : Primcodable α] [inst_1 : Primcodable β] [inst_2 : Primcodable σ]
  {f : α → β → Option σ}, (Primrec₂ fun a n => (Encodable.decode n).bind (f a)) ↔ Primrec₂ f

Defined in

Mathlib.Computability.Primrec.Basic

Cited by

1 results in Mathlib

Foundations

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

Assumes

PrimcodablePrimcodablePrimcodable