Theorems · Theorem · combinatorics
Finset.filter_union_filter_of_codisjoint
∀ {α : Type u_1} (p q : α → Prop) [inst : DecidablePred p] [inst_1 : DecidablePred q] [inst_2 : DecidableEq α]
(s : Finset α), Codisjoint p q → Finset.filter p s ∪ Finset.filter q s = s- Defined in
- Mathlib.Data.Finset.Basic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 59 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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
- Codisjointstatement and proof · cited by 197
- Finset.filter_true_of_memproof · cited by 24
- Finset.filter_orproof · cited by 10
- Codisjoint.top_leproof · cited by 9
Cited by1
Results whose statement or proof uses this declaration.
- Finset.filter_union_filter_not_eqproof · cited by 16