Strict_Ordering_Preserved_under_Product_with_Cancellable_Element
Provedordered-semigroupsproofwiki
Let be an ordered semigroup. Let be such that is cancellable for Then
Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem Strict_Ordering_Preserved_under_Product_with_Cancellable_Element (a b c : ℤ) (hc : c ≠ 0) (h : a < b) : a * c < b * c ∨ b * c < a * c := by sorry
Source