Theorem: Arith.HSemiformula.ProperOn.iff' (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 : HSemisentence L n (𝚫, m)
h : ProperOn M p
e : Fin n → M
⊢ (Semiformula.Evalbm M e) (pi p).val ↔ (Semiformula.Evalbm M e) (val p)
Tactic:
simp [←h.iff, val_sigma]
State after:
no goals