Theorem: LO.FirstOrder.Semiformula.neg_bex (Logic/FirstOrder/Basic/Syntax/Formula.lean)

State before:
L : Language
L₁ : Language
L₂ : Language
L₃ : Language
ξ : Type u_1
ξ₁ : Type u_2
ξ₂ : Type u_3
ξ₃ : Type u_4
n n₁ n₂✝ n₂ m m₁ m₂ m₃ : ℕ
p q : Semiformula L ξ (n + 1)
⊢ ~(∃[p] q) = ∀[p] ~q
Tactic:
simp[LogicalConnective.ball, LogicalConnective.bex, imp_eq]
State after:
no goals