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