Theorem: Arith.HSemiformula.eval_extd_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
Γ : HierarchySymbol
e : Fin n → M
ε : ξ → M
p : HSemiformula ℒₒᵣ ξ n Γ
⊢ (Semiformula.Evalm M e ε) (extd L p).val ↔ (Semiformula.Evalm M e ε) p.val
Tactic:
induction p <;> simp [extd, *]
State after:
no goals