Theorem: LO.FirstOrder.Rew.rewrite_comp_rewrite (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₂
f : ξ₁ → Semiterm L ξ₂ n
v : ξ₂ → Semiterm L ξ₃ n
w : ξ₁ → Semiterm L ξ₂ n
⊢ (rewrite v).comp (rewrite w) = rewrite (⇑(rewrite v) ∘ w)
Tactic:
ext <;> simp[comp_app]
State after:
no goals