proposition: Lemma multNonnegativeRationals_lecompat_r' : ∏ k x y : NonnegativeRationals, 0 < k -> x * k <= y * k -> x <= y.
proof: Proof. intros k x y Hk. rewrite !(iscomm_multNonnegativeRationals _ k). exact (multNonnegativeRationals_lecompat_l' k x y Hk). Qed.
imports: UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.PartA UniMath.MoreFoundations.Sets UniMath.MoreFoundations.Orders UniMath.RealNumbers.Sets UniMath.RealNumbers.Fields UniMath.Algebra.DivisionRig UniMath.OrderTheory.Lattice.Lattice UniMath.RealNumbers.Prelim