Theorems · Definition · logic and foundations
Primcodable.subtype
{α : Type u_1} → [inst : Primcodable α] → {p : α → Prop} → [DecidablePred p] → PrimrecPred p → Primcodable (Subtype p)A subtype of a primitive recursive predicate is Primcodable.
- Defined in
- Mathlib.Computability.Primrec.Basic
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 85 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- PrimcodableDecidablePred
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Primcodablestatement and proof · cited by 325
- PrimrecPredstatement and proof · cited by 23
Cited by5
Results whose statement or proof uses this declaration.
- Primrec.subtype_valstatement and proof · cited by 3
- Primrec.subtype_val_iffstatement and proof · cited by 3
- Primrec.fin_val_iffproof · cited by 2
- Primrec.subtype_mkstatement · cited by 1
- Computable.subtype_mkstatement · cited by 0