Theorems · Theorem · logic and foundations
IsSemilinearSet.sUnion
∀ {M : Type u_1} [inst : AddCommMonoid M] {S : Set (Set M)},
S.Finite → (∀ s ∈ S, IsSemilinearSet s) → IsSemilinearSet (⋃₀ S)- Cited by
- 2 results in Mathlib
- Foundations
- Depth 68 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- AddCommMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- AddCommMonoidstatement and proof · cited by 12,281
- Set.Finitestatement and proof · cited by 1,814
- Set.sUnionstatement and proof · cited by 392
- IsSemilinearSetstatement and proof · cited by 44
- Set.Finite.induction_onproof · cited by 39
- Set.sUnion_emptyproof · cited by 17
- Set.sUnion_insertproof · cited by 11
- IsSemilinearSet.unionproof · cited by 3
Cited by2
Results whose statement or proof uses this declaration.
- IsSemilinearSet.biUnionproof · cited by 5
- IsSemilinearSet.iUnionproof · cited by 1