Finset.biUnion

{α : Type u_1} → {β : Type u_2} → [DecidableEq β] → Finset α → (α → Finset β) → Finset β

Finset.biUnion s t is the union of t a over a ∈ s. (This was formerly bind due to the monad structure on types with DecidableEq.)

Defined in: Mathlib.Data.Finset.Union
Cited by: 217 results in Mathlib
Foundations: Depth 73 from the axioms, rests on 1,402 definitions · uses propext, Classical.choice, Quot.sound
Assumes: DecidableEq

Around this declaration

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

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

Results whose statement or proof uses this declaration.

Showing the 200 most cited of 228.