Theorem: Arith.HSemiformula.val_or (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
p q : HSemiformula L ξ n Γ
⊢ (p ⋎ q).val = p.val ⋎ q.val
Tactic:
rcases Γ with ⟨Γ, m⟩
State after:
case mk
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
Γ : SigmaPiDelta
m : ℕ
p q : HSemiformula L ξ n (Γ, m)
⊢ (p ⋎ q).val = p.val ⋎ q.val

State before:
case mk
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
Γ : SigmaPiDelta
m : ℕ
p q : HSemiformula L ξ n (Γ, m)
⊢ (p ⋎ q).val = p.val ⋎ q.val
Tactic:
rcases Γ <;> simp [val, val_sigma]
State after:
no goals