Theorem: LO.FirstOrder.Rew.hom_finitary0 (Logic/FirstOrder/Basic/Operator.lean)

State before:
L✝ : Language
L L' : Language
L₁ : Language
L₂ : Language
L₃ : Language
ξ ξ' : Type v
ξ₁ : Type v₁
ξ₂ : Type v₂
ξ₃ : Type v₃
n n₁ n₂ n₃ : ℕ
ω : Rew L ξ₁ n₁ ξ₂ n₂
o : Semiformula.Operator L 0
v : Fin 0 → Semiterm L ξ₁ n₁
⊢ ω.hom (o.operator v) = o.operator ![]
Tactic:
simp [ω.hom_operator', Matrix.empty_eq]
State after:
no goals