Theorem: LO.FirstOrder.Semiformula.lMap_rewriteMap (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₂
ξ₁ : Type u_3
ξ₂ : Type u_4
p : Semiformula L₁ ξ₁ n
f : ξ₁ → ξ₂
⊢ (lMap Φ) ((Rew.rewriteMap f).hom p) = (Rew.rewriteMap f).hom ((lMap Φ) p)
Tactic:
simp [Rew.rewriteMap, lMap_rewrite, Function.comp]
State after:
no goals