Theorems · Theorem · logic and foundations
PrimrecPred.listFilter_listRange
∀ {R : ℕ → ℕ → Prop} (s : ℕ) [inst : DecidableRel R],
PrimrecRel R → Primrec fun n => List.filter (fun y => decide (R y n)) (List.range s)A helper lemma for proofs about bounded quantifiers on decidable relations.
- Defined in
- Mathlib.Computability.Primrec.List
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 96 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableRel
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Primrecstatement and proof · cited by 141
- Primrec.sndproof · cited by 66
- Primrec.fstproof · cited by 58
- Primrec.constproof · cited by 57
- Primrec₂.compproof · cited by 55
- PrimrecRelstatement and proof · cited by 22
- PrimrecRel.compproof · cited by 17
- Primrec.eqproof · cited by 12
- Primrec.option_some_iffproof · cited by 11
- Primrec.iteproof · cited by 9
- PrimrecRel.decideproof · cited by 6
- Primrec.listFilterMapproof · cited by 4
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.