Theorem: Equiv.Perm.Basis.eq_cycleOf' (Jordan/ConjClassCount.lean)

State before:
α : Type u_1
inst✝¹ : DecidableEq α
inst✝ : Fintype α
g : Equiv.Perm α
a : Equiv.Perm.Basis g
c : { x // x ∈ Equiv.Perm.cycleFactorsFinset g }
e : Equiv.Perm { x // x ∈ Equiv.Perm.cycleFactorsFinset g }
i : ℤ
⊢ ↑(e c) = Equiv.Perm.cycleOf g (Kf a e (c, i))
Tactic:
rw [Kf_def, Equiv.Perm.cycleOf_self_apply_zpow, a.cycleOf_eq]
State after:
no goals