Theorems · Theorem · logic and foundations
PrimrecPred.comp
∀ {α : Type u_1} {β : Type u_2} [inst : Primcodable α] [inst_1 : Primcodable β] {p : β → Prop} {f : α → β},
PrimrecPred p → Primrec f → PrimrecPred fun a => p (f a)- Defined in
- Mathlib.Computability.Primrec.Basic
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 74 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- PrimcodablePrimcodable
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Primcodablestatement and proof · cited by 325
- Primrecstatement and proof · cited by 141
- Primrec.compproof · cited by 80
- PrimrecPredstatement and proof · cited by 23
- Primrec.primrecPredproof · cited by 8
Cited by4
Results whose statement or proof uses this declaration.
- PrimrecRel.compproof · cited by 17
- Primrec.listFilterproof · cited by 2
- PrimrecPred.forall_ltproof · cited by 0
- PrimrecPred.exists_ltproof · cited by 0