Theorem: LO.FirstOrder.Arith.Model.bexp_defined (Arithmetization/ISigmaZero/Exponential/Log.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₂ bexp via bexpDef
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 => bexp (v 0) (v 1)) fun x => v x.succ) v ↔ (Semiformula.Evalbm M v) (HSemiformula.val bexpDef)

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 => bexp (v 0) (v 1)) fun x => v x.succ) v ↔ (Semiformula.Evalbm M v) (HSemiformula.val bexpDef)
Tactic:
simp [bexpDef, bexp_graph, ←le_iff_lt_succ]
State after:
no goals