Theorem: LO.FirstOrder.Arith.Model.seqExp_defined (Arithmetization/ISigmaOne/HFS/Supplemental.lean)

State before:
M : Type u_1
inst✝⁵ : Zero M
inst✝⁴ : One M
inst✝³ : Add M
inst✝² : Mul M
inst✝¹ : LT M
inst✝ : M ⊧ₘ* 𝐈𝚺₁
v : Fin (Nat.succ 2) → M
⊢ (fun v => v 0 = (fun v => v 0 ^ˢ v 1) fun x => v x.succ) v ↔ (Semiformula.Evalbm M v) (HSemiformula.val seqExpDef)
Tactic:
simp [seqExp.construction.result_defined_iff, seqExpDef]
State after:
M : Type u_1
inst✝⁵ : Zero M
inst✝⁴ : One M
inst✝³ : Add M
inst✝² : Mul M
inst✝¹ : LT M
inst✝ : M ⊧ₘ* 𝐈𝚺₁
v : Fin (Nat.succ 2) → M
⊢ v 0 = v 1 ^ˢ v 2 ↔ v 0 = seqExp.construction.result ![v 1] (v 2)

State before:
M : Type u_1
inst✝⁵ : Zero M
inst✝⁴ : One M
inst✝³ : Add M
inst✝² : Mul M
inst✝¹ : LT M
inst✝ : M ⊧ₘ* 𝐈𝚺₁
v : Fin (Nat.succ 2) → M
⊢ v 0 = v 1 ^ˢ v 2 ↔ v 0 = seqExp.construction.result ![v 1] (v 2)
Tactic:
rfl
State after:
no goals