Theorem: l1_2_20_ii (AlgebraI/Subgroups.lean)

State before:
G : Type u_1
inst✝ : Group G
g : G
i j : ℤ
h : ¬IsOfFinOrder g
⊢ g ^ i = g ^ j ↔ i = j
Tactic:
rw [← orderOf_eq_zero_iff] at h
State after:
G : Type u_1
inst✝ : Group G
g : G
i j : ℤ
h : orderOf g = 0
⊢ g ^ i = g ^ j ↔ i = j

State before:
G : Type u_1
inst✝ : Group G
g : G
i j : ℤ
h : orderOf g = 0
⊢ g ^ i = g ^ j ↔ i = j
Tactic:
rw [zpow_eq_zpow_iff_modEq, h, Int.ofNat_zero, Int.modEq_zero_iff]
State after:
no goals