Theorem: LO.FirstOrder.Arith.Model.len_bexp (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 ⊧ₘ* 𝐈𝚫₀
a x : M
h : x < ‖a‖
⊢ ‖bexp a x‖ = x + 1
Tactic:
rw [length_of_pos (bexp_pos h), log_bexp h]
State after:
no goals