Theorems · Theorem · logic and foundations

Computable.subtype_mk

∀ {α : Type u_1} {β : Type u_2} [inst : Primcodable α] [inst_1 : Primcodable β] {f : α → β} {p : β → Prop}
  [inst_2 : DecidablePred p] {h : ∀ (a : α), p (f a)} (hp : PrimrecPred p), Computable f → Computable fun a => ⟨f a, ⋯⟩

Defined in

Mathlib.Computability.Partrec

Cited by

0 results in Mathlib

Foundations

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

Assumes

PrimcodablePrimcodableDecidablePred