Theorem: Arith.HSemiformula.ProperOn.eval_neg (Arithmetization/Definability/Hierarchy.lean)

State before:
L : Language
inst✝⁷ : L.ORing
ξ : Type v
n : ℕ
M : Type u_1
inst✝⁶ : Zero M
inst✝⁵ : One M
inst✝⁴ : Add M
inst✝³ : Mul M
inst✝² : LT M
inst✝¹ : Structure L M
inst✝ : Structure.ORing L M
k m : ℕ
p : HSemisentence L k (𝚫, m)
hp : ProperOn M p
e : Fin k → M
⊢ (Semiformula.Evalbm M e) (val (~p)) ↔ ¬(Semiformula.Evalbm M e) (val p)
Tactic:
simp [val, ←val_sigma, hp.iff]
State after:
no goals