Theorem: LO.FirstOrder.Arith.Hierarchy.bexLTSucc_iff (Logic/FirstOrder/Arith/Hierarchy.lean)

State before:
L : Language
inst✝³ : L.LT
μ : Type v
inst✝² : L.Zero
inst✝¹ : L.One
inst✝ : L.Add
Γ : Polarity
s n : ℕ
p : Semiformula L μ (n + 1)
t : Semiterm L μ n
⊢ Hierarchy Γ s (Semiformula.bexLTSucc t p) ↔ Hierarchy Γ s p
Tactic:
simp [Semiformula.bexLTSucc]
State after:
no goals