Theorems · Theorem · combinatorics
Finset.coe_biUnion
∀ {α : Type u_1} {β : Type u_2} {s : Finset α} {t : α → Finset β} [inst : DecidableEq β],
↑(s.biUnion t) = ⋃ x ∈ ↑s, ↑(t x)- Defined in
- Mathlib.Data.Finset.Union
- Cited by
- 25 results in Mathlib
- Foundations
- Depth 76 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.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Finsetstatement and proof · cited by 13,712
- SetLike.coestatement and proof · cited by 8,199
- Set.iUnionstatement · cited by 2,483
- Finset.biUnionstatement · cited by 217
Cited by25
Results whose statement or proof uses this declaration.
- Finset.biUnion_image_leftproof · cited by 5
- Finset.biUnion_image_rightproof · cited by 5
- SimpleGraph.coe_finsetWalkLength_eqproof · cited by 2
- Module.Finite.of_isLocalized_maximalproof · cited by 2
- MeasureTheory.IsSetSemiring.mem_supClosure_iffproof · cited by 2
- Algebra.FiniteType.of_span_eq_top_targetproof · cited by 2
- Submodule.span_attach_biUnionproof · cited by 2
- SimpleGraph.union_eq_univ_of_forall_ncard_leproof · cited by 2
- Polynomial.rootSet_prodproof · cited by 1
- Algebra.adjoin_attach_biUnionproof · cited by 1
- finprod_mem_iUnionproof · cited by 1
- SimpleGraph.coe_finsetWalkLengthLT_eqproof · cited by 1