Theorem: LO.FirstOrder.Arith.Model.Seq.exists (Arithmetization/ISigmaOne/HFS/Seq.lean)

State before:
M : Type u_1
inst✝⁵ : Zero M
inst✝⁴ : One M
inst✝³ : Add M
inst✝² : Mul M
inst✝¹ : LT M
inst✝ : M ⊧ₘ* 𝐈𝚺₁
s : M
h : Seq s
x : M
hx : x < lh s
⊢ x ∈ domain s
Tactic:
simpa [h.domain_eq] using hx
State after:
no goals