Theorem: LO.FirstOrder.Rew.qpow_castLE (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 n n' : ℕ
h : n ≤ n'
⊢ (castLE h).qpow k = castLE ⋯
Tactic:
induction k <;> simp[*]
State after:
no goals