Theorem: LO.FirstOrder.Arith.Model.seqCons_defined (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 ⊧ₘ* 𝐈𝚺₁
⊢ 𝚺₀-Function₂ seqCons via seqConsDef
Tactic:
intro v
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
⊢ (fun v => v 0 = (fun v => v 0 ⁀' v 1) fun x => v x.succ) v ↔ (Semiformula.Evalbm M v) (HSemiformula.val seqConsDef)

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 seqConsDef)
Tactic:
simp [seqConsDef, seqCons_graph]
State after:
no goals