Theorem: LO.FirstOrder.Rew.rel1 (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₂
r : L.Rel 1
t : Semiterm L ξ₁ n₁
⊢ ω.hom (rel r ![t]) = rel r ![ω t]
Tactic:
simp[ω.rel, Matrix.constant_eq_singleton]
State after:
no goals