Theorem: LO.FirstOrder.Semiformula.lMap_bex (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₂
p q : Semiformula L₁ ξ (n + 1)
⊢ (lMap Φ) (∃[p] q) = ∃[(lMap Φ) p] (lMap Φ) q
Tactic:
simp [LogicalConnective.bex]
State after:
no goals