orderOf_pow

∀ {G : Type u_1} [inst : LeftCancelMonoid G] [Finite G] {n : ℕ} (x : G), orderOf (x ^ n) = orderOf x / (orderOf x).gcd n

This is the same as orderOf_pow' and orderOf_pow'' but with one assumption less which is automatic in the case of a finite cancellative monoid.

Defined in: Mathlib.GroupTheory.OrderOfElement
Cited by: 5 results in Mathlib
Foundations: Depth 69 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes: LeftCancelMonoid Finite

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Results whose statement or proof uses this declaration.