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

State before:
L✝ : Language
ξ✝ : Type u_1
n n₁ n₂✝ n₂ m m₁ m₂ m₃ : ℕ
L : Language
L₁ : Language
L₂ : Language
L₃ : Language
ξ : Type u_2
Φ : L₁ →ᵥ L₂
p : SyntacticSemiformula L₁ (n + 1)
⊢ (lMap Φ) ((Rew.hom Rew.free) p) = (Rew.hom Rew.free) ((lMap Φ) p)
Tactic:
simp[Rew.free, lMap_bind, Function.comp, Matrix.comp_vecConsLast]
State after:
no goals