Theorem: LO.FirstOrder.Arith.Model.Nuon.sq_polyI_hash_polyL_polybounded (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
⊢ (polyI A # polyL A) ^ 2 ≤ ((2 * A + 1) ^ 64) ^ 2
Tactic:
simp [polyI_hash_polyL_polybounded pos]
State after:
no goals

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
⊢ ((2 * A + 1) ^ 64) ^ 2 = polyU A
Tactic:
simp [polyU, ←pow_mul]
State after:
no goals