Theorem: LO.FirstOrder.Rew.hom_substs_mbar_zero_comp_shift_eq_free (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₃ : ℕ
p : SyntacticSemiformula L 1
⊢ [→ &0].hom ((hom ⇑) p) = (hom free) p
Tactic:
simp[←hom_comp_app, substs_mbar_zero_comp_shift_eq_free]
State after:
no goals