Theorem: Arith.HSemiformula.emb_proper (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 : (𝚫, m)-Semisentence n
⊢ ProperOn M (emb L p) ↔ ProperOn M p
Tactic:
rcases p
State after:
case mkDelta
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 : ℕ
a✝¹ : HSemiformula ℒₒᵣ Empty n (𝚺, m)
a✝ : HSemiformula ℒₒᵣ Empty n (𝚷, m)
⊢ ProperOn M (emb L (a✝¹.mkDelta a✝)) ↔ ProperOn M (a✝¹.mkDelta a✝)

State before:
case mkDelta
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 : ℕ
a✝¹ : HSemiformula ℒₒᵣ Empty n (𝚺, m)
a✝ : HSemiformula ℒₒᵣ Empty n (𝚷, m)
⊢ ProperOn M (emb L (a✝¹.mkDelta a✝)) ↔ ProperOn M (a✝¹.mkDelta a✝)
Tactic:
simp [ProperOn, emb]
State after:
no goals