Theorem: LO.FirstOrder.Arith.Model.bexp_eq_hash (Arithmetization/OmegaOne/Basic.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 b : M
⊢ ‖a‖ * ‖b‖ < ‖a # b‖
Tactic:
simp [length_hash]
State after:
no goals