Theorem: Arith.HSemiformula.val_negDelta (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
m : ℕ
p : HSemiformula L ξ n (𝚫, m)
⊢ (~p).val = ~p.pi.val
Tactic:
simp [Tilde.tilde, negDelta]
State after:
no goals