Theorem: LO.FirstOrder.Arith.Model.lt_hash_one_iff (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 # 1 ↔ ‖a‖ ≤ ‖b‖
Tactic:
simpa using lt_hash_iff (a := a) (b := b) (c := 1)
State after:
no goals