Theorem: LO.FirstOrder.Semiformula.eval_bex (Logic/FirstOrder/Basic/Semantics/Semantics.lean)

State before:
n₂ : ℕ
L : Language
μ : Type v
μ₁ : Type v₁
μ₂ : Type v₂
M : Type w
s : Structure L M
n : ℕ
e : Fin n → M
e₂ : Fin n₂ → M
ε : μ → M
ε₂ : μ₂ → M
p q : Semiformula L μ (n + 1)
⊢ (Eval s e ε) (∃[p] q) ↔ ∃ x, (Eval s (x :> e) ε) p ⋏ (Eval s (x :> e) ε) q
Tactic:
simp [LogicalConnective.bex]
State after:
no goals