English
If the family is pairwise disjoint, then filtering each member by a predicate preserves pairwise disjointness.
Русский
ЕслиFamily пару по элементам дисjoint, фильтрация по каждому элементу сохраняет попарную непересекаемость.
LaTeX
$$$\\text{pairwiseDisjoint}_{} (\\uparrow s) f \\Rightarrow \\forall p,\\ (\\uparrow s) (f\\,a).filter p$$$
Lean4
theorem pairwiseDisjoint_filter {f : α → Finset β} (h : Set.PairwiseDisjoint (↑s) f) (p : β → Prop) [DecidablePred p] :
Set.PairwiseDisjoint ↑s fun a ↦ (f a).filter p := fun _ h₁ _ h₂ hne ↦ Finset.disjoint_filter_filter (h h₁ h₂ hne)