Theorem: Arith.HSemiformula.graphDelta_val (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 : HSemiformula L ξ (k + 1) (𝚺, m)
⊢ p.graphDelta.val = p.val
Tactic:
cases m <;> simp [graphDelta]
State after:
no goals