Theorem: LO.FirstOrder.Rew.qpow_comp (Logic/FirstOrder/Basic/Syntax/Rew.lean)

State before:
L : Language
L' : Language
L₁ : Language
L₂ : Language
L₃ : Language
ξ : Type u_1
ξ' : Type u_2
ξ₁ : Type u_3
ξ₂ : Type u_4
ξ₃ : Type u_5
n n₁ n₂ n₃ : ℕ
ω✝ ω : Rew L ξ₁ n₁ ξ₂ n₂
k : ℕ
ω₂ : Rew L ξ₂ n₂ ξ₃ n₃
ω₁ : Rew L ξ₁ n₁ ξ₂ n₂
⊢ (ω₂.comp ω₁).qpow k = (ω₂.qpow k).comp (ω₁.qpow k)
Tactic:
induction k <;> simp[*, q_comp]
State after:
no goals