Mathlib Map

Theorems · Theorem · combinatorics

Finset.disjiUnion_eq_biUnion

∀ {α : Type u_1} {β : Type u_2} [inst : DecidableEq β] (s : Finset α) (f : α → Finset β) (hf : (↑s).PairwiseDisjoint f),
  s.disjiUnion f hf = s.biUnion f
Defined in
Mathlib.Data.Finset.Union
Cited by
11 results in Mathlib
Foundations
Depth 74 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
DecidableEq

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites8

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by11

Results whose statement or proof uses this declaration.