English
Filtering the biUnion is the biUnion of the filtered components: filter p (s.biUnion f) = s.biUnion (λ a, (f a).filter p).
Русский
Фильтрация BiUnion эквивалентна BiUnion отфильтрованных компонент: фильтр p (s.biUnion f) = s.biUnion (λ a, (f a).filter p).
LaTeX
$$$\\mathrm{filter}\\;p\\bigl(s\\biUnion f\\bigr) = s\\biUnion \\lambda a. (f\\,a).\\mathrm{filter}\\,p$$$
Lean4
theorem filter_biUnion (s : Finset α) (f : α → Finset β) (p : β → Prop) [DecidablePred p] :
(s.biUnion f).filter p = s.biUnion fun a ↦ (f a).filter p := by grind