Theorems · Theorem · combinatorics

Finset.map_disjiUnion

∀ {α : Type u_1} {β : Type u_2} {γ : Type u_3} {f : α ↪ β} {s : Finset α} {t : β → Finset γ}
  {h : (↑(Finset.map f s)).PairwiseDisjoint t}, (Finset.map f s).disjiUnion t h = s.disjiUnion (fun a => t (f a)) ⋯

Defined in

Mathlib.Data.Finset.Union

Cited by

0 results in Mathlib

Foundations

Depth 62 from the axioms · uses propext, Classical.choice, Quot.sound