Theorems · Theorem · group theory
AddCommute.isOfFinAddOrder_add
∀ {G : Type u_1} [inst : AddMonoid G] {x y : G},
AddCommute x y → IsOfFinAddOrder x → IsOfFinAddOrder y → IsOfFinAddOrder (x + y)Commuting elements of finite additive order are closed under addition.
- Defined in
- Mathlib.GroupTheory.OrderOfElement
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 39 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.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- AddMonoidstatement and proof · cited by 2,864
- mul_posproof · cited by 374
- AddCommutestatement and proof · cited by 185
- IsOfFinAddOrderstatement and proof · cited by 105
- IsOfFinAddOrder.addOrderOf_posproof · cited by 16
- addOrderOf_pos_iffproof · cited by 10
- AddCommute.addOrderOf_add_dvd_mul_addOrderOfproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- IsOfFinAddOrder.addproof · cited by 0