Theorem: LO.FirstOrder.Semiformula.lMap_rel₀ (Logic/FirstOrder/Basic/Syntax/Formula.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₂
r : L₁.Rel 0
v : Fin 0 → Semiterm L₁ ξ n
⊢ (lMap Φ) (rel r v) = rel (Φ.rel r) ![]
Tactic:
simp[lMap_rel, Matrix.empty_eq]
State after:
no goals