Theorems · Theorem · group theory
AddSubmonoid.isAddCommutative_closure
∀ (M : Type u_1) [inst : AddMonoid M] {s : Set M},
(∀ a ∈ s, ∀ b ∈ s, a + b = b + a) → IsAddCommutative ↥(AddSubmonoid.closure s)If all the elements of a set s commute, then closure s forms an additive
commutative monoid.
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 65 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- AddMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
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
- SetLike.coeproof · cited by 8,199
- AddMonoidstatement and proof · cited by 2,864
- AddSubmonoidstatement · cited by 1,178
- AddSubmonoid.closurestatement and proof · cited by 224
- IsAddCommutativestatement · cited by 40
- AddSubmonoid.centralizerproof · cited by 11
- IsAddCommutative.of_setLike_add_commproof · cited by 7
- Set.addCentralizer_addCentralizer_comm_of_commproof · cited by 3
- AddSubmonoid.closure_le_centralizer_centralizerproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.