Theorems · Theorem · combinatorics
Finset.biUnion_mono
∀ {α : Type u_1} {β : Type u_2} {s : Finset α} {t₁ t₂ : α → Finset β} [inst : DecidableEq β],
(∀ a ∈ s, t₁ a ⊆ t₂ a) → s.biUnion t₁ ⊆ s.biUnion t₂- Defined in
- Mathlib.Data.Finset.Union
- Cited by
- 3 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.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Finset.biUnionstatement · cited by 217
Cited by3
Results whose statement or proof uses this declaration.
- Finsupp.mapDomain_supportproof · cited by 10
- MvPolynomial.vars_bind₁proof · cited by 1
- Finset.card_biUnion_le_of_intersectingproof · cited by 0