Theorem: LO.FirstOrder.Rew.hom_const (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₂
c : Semiformula.Const L
⊢ ω.hom (Semiformula.Operator.const c) = Semiformula.Operator.const c
Tactic:
simp [Semiformula.Operator.const, ω.hom_operator']
State after:
no goals