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

State before:
L : Language
L₁ : Language
L₂ : Language
L₃ : Language
ξ : Type u_1
ξ₁ : Type u_2
ξ₂ : Type u_3
ξ₃ : Type u_4
n n₁ n₂✝ n₂ m m₁ m₂ m₃ : ℕ
ω : Rew L ξ₁ n₁ ξ₂ n₂
k : ℕ
r : L.Rel k
v : Fin k → Semiterm L ξ₁ n₁
⊢ ω.hom (nrel r v) = nrel r fun i => ω (v i)
Tactic:
rfl
State after:
no goals