Theorem: LO.FirstOrder.Semiterm.lMap_bind (Logic/FirstOrder/Basic/Syntax/Rew.lean)

State before:
L : Language
L' : Language
L₁ : Language
L₂ : Language
L₃ : Language
ξ : Type u_1
ξ' : Type u_2
ξ₁ : Type u_3
ξ₂ : Type u_4
ξ₃ : Type u_5
n n₁ n₂ n₃ : ℕ
Φ : L₁ →ᵥ L₂
b : Fin n₁ → Semiterm L₁ ξ₂ n₂
e : ξ₁ → Semiterm L₁ ξ₂ n₂
t : Semiterm L₁ ξ₁ n₁
⊢ lMap Φ ((Rew.bind b e) t) = (Rew.bind (lMap Φ ∘ b) (lMap Φ ∘ e)) (lMap Φ t)
Tactic:
induction t <;> simp[*, lMap_func, Rew.func]
State after:
no goals