Theorems · Theorem · group theory
addOrderOf_eq_of_nsmul_and_div_prime_nsmul
∀ {G : Type u_1} [inst : AddMonoid G] {x : G} {n : ℕ},
0 < n → n • x = 0 → (∀ (p : ℕ), Nat.Prime p → p ∣ n → (n / p) • x ≠ 0) → addOrderOf x = nIf n * x = 0, but n/p * x ≠ 0 for
all prime factors p of n, then x has order n in G.
- Defined in
- Mathlib.GroupTheory.OrderOfElement
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 71 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.
Cites16
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- mul_oneproof · cited by 3,885
- AddMonoidstatement and proof · cited by 2,864
- mul_commproof · cited by 2,262
- Nat.Primestatement and proof · cited by 2,059
- mul_assocproof · cited by 1,667
- addOrderOfstatement and proof · cited by 208
- Nat.minFacproof · cited by 72
- Nat.minFac_primeproof · cited by 31
- isOfFinAddOrder_iff_nsmul_eq_zeroproof · cited by 27
- Nat.minFac_dvdproof · cited by 24
- Dvd.intro_leftproof · cited by 20
- addOrderOf_dvd_iff_nsmul_eq_zeroproof · cited by 17
Cited by1
Results whose statement or proof uses this declaration.
- AddCommute.addOrderOf_add_eq_right_of_forall_prime_mul_dvdproof · cited by 2