Theorems · Theorem · group theory
AddMonoidHom.isOfFinAddOrder
∀ {G : Type u_1} {H : Type u_2} [inst : AddMonoid G] [inst_1 : AddMonoid H] (f : G →+ H) {x : G},
IsOfFinAddOrder x → IsOfFinAddOrder (f x)The image of an element of finite additive order has finite additive order.
- Defined in
- Mathlib.GroupTheory.OrderOfElement
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 16 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- AddMonoidHomstatement and proof · cited by 3,230
- AddMonoidstatement and proof · cited by 2,864
- IsOfFinAddOrderstatement and proof · cited by 105
- AddMonoidHom.map_zeroproof · cited by 47
- isOfFinAddOrder_iff_nsmul_eq_zeroproof · cited by 27
- AddMonoidHom.map_nsmulproof · cited by 18
- IsOfFinAddOrder.exists_nsmul_eq_zeroproof · cited by 6
Cited by2
Results whose statement or proof uses this declaration.
- IsAddTorsion.of_surjectiveproof · cited by 2
- AddCommGroup.le_comap_torsionproof · cited by 2