Mathlib Map

Theorems · Theorem · logic and foundations

ComputablePred.computable_of_manyOneReducible

∀ {α : Type u_1} {β : Type u_2} [inst : Primcodable α] [inst_1 : Primcodable β] {p : α → Prop} {q : β → Prop},
  p ≤₀ q → ComputablePred q → ComputablePred p
Defined in
Mathlib.Computability.Reduce
Cited by
1 results in Mathlib
Foundations
Depth 75 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.computable_of_oneOneReducible · cited by 0ComputablePred.computable…Set.ext · cited by 2266Set.extPrimcodable · cited by 325PrimcodableComputable · cited by 80ComputableComputable.comp · cited by 31Computable.compComputablePred · cited by 17ComputablePredManyOneReducible · cited by 17ManyOneReducibleComputablePred.computable_iff · cited by 2ComputablePred.computable…ComputablePred.computable_of_…CITED BYCITES

Cites7

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.