Mathlib Map

Theorems · Theorem · logic and foundations

Partrec.dom_re

∀ {α : Type u_1} {β : Type u_2} [inst : Primcodable α] [inst_1 : Primcodable β] {f : α →. β},
  Partrec f → REPred fun a => (f a).Dom
Defined in
Mathlib.Computability.RE
Cited by
1 results in Mathlib
Foundations
Depth 90 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
PrimcodablePrimcodable
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

ComputablePred.halting_problem_re · cited by 1ComputablePred.halting_pr…Primcodable · cited by 325PrimcodablePFun · cited by 207PFunPart.Dom · cited by 145Part.DomPartrec · cited by 48PartrecPart.ext · cited by 24Part.extPartrec.of_eq · cited by 19Partrec.of_eqComputable.to₂ · cited by 17Computable.to₂Computable.const · cited by 16Computable.constPartrec.map · cited by 8Partrec.mapREPred · cited by 7REPredPartrec.dom_reCITED BYCITES

Cites10

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.