Theorem: LO.FirstOrder.Arith.Model.Nuon.len_polyI (Arithmetization/OmegaOne/Nuon.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 : M
pos : 0 < A
⊢ √‖A‖ < ‖2 * A‖
Tactic:
simp [length_two_mul_of_pos pos, lt_succ_iff_le]
State after:
no goals