Theorem: LO.FirstOrder.Semiformula.EvalAux_neg (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 : Semiformula L μ n
⊢ EvalAux s ε e (~p) = ¬EvalAux s ε e p
Tactic:
induction p using rec' <;> simp [*, EvalAux, ←neg_eq, or_iff_not_imp_left]
State after:
no goals