Theorems · Theorem · combinatorics
Finset.filter_or
∀ {α : Type u_1} (p q : α → Prop) [inst : DecidablePred p] [inst_1 : DecidablePred q] [inst_2 : DecidableEq α]
(s : Finset α), {a ∈ s | p a ∨ q a} = Finset.filter p s ∪ Finset.filter q s- Defined in
- Mathlib.Data.Finset.Basic
- Cited by
- 10 results in Mathlib
- Foundations
- Depth 56 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- Finsetstatement and proof · cited by 13,712
- Finset.filterstatement · cited by 949
Cited by10
Results whose statement or proof uses this declaration.
- NumberField.InfinitePlace.card_filter_mk_eqproof · cited by 3
- Finpartition.card_parts_equitabiliseproof · cited by 3
- linearIndependent_sumproof · cited by 3
- hammingDist_triangleproof · cited by 2
- Affine.Simplex.sum_reflectionCircumcenterWeightsWithCircumcenterproof · cited by 1
- Finpartition.card_filter_equitabilise_smallproof · cited by 1
- Finset.filter_union_filter_of_codisjointproof · cited by 1
- MultilinearMap.map_add_eq_map_add_linearDeriv_addproof · cited by 1
- Finset.sum_filter_xorproof · cited by 0
- Finset.prod_filter_xorproof · cited by 0