Theorems · Theorem · group theory
orderOf_eq_of_pow_and_pow_div_prime
∀ {G : Type u_1} [inst : Monoid G] {x : G} {n : ℕ},
0 < n → x ^ n = 1 → (∀ (p : ℕ), Nat.Prime p → p ∣ n → x ^ (n / p) ≠ 1) → orderOf x = nIf x^n = 1, but x^(n/p) ≠ 1 for all prime factors p of n,
then x has order n in G.
- Defined in
- Mathlib.GroupTheory.OrderOfElement
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 71 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Monoid
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.
- Monoidstatement and proof · cited by 3,887
- mul_oneproof · cited by 3,885
- mul_commproof · cited by 2,262
- Nat.Primestatement and proof · cited by 2,059
- mul_assocproof · cited by 1,667
- orderOfstatement and proof · cited by 324
- Nat.minFacproof · cited by 72
- Nat.minFac_primeproof · cited by 31
- isOfFinOrder_iff_pow_eq_oneproof · cited by 27
- orderOf_dvd_of_pow_eq_oneproof · cited by 24
- Nat.minFac_dvdproof · cited by 24
- orderOf_dvd_iff_pow_eq_oneproof · cited by 22
Cited by2
Results whose statement or proof uses this declaration.
- lucas_primalityproof · cited by 2
- Commute.orderOf_mul_eq_right_of_forall_prime_mul_dvdproof · cited by 2