proposition: Lemma hr_notlt_le : ∏ X Y, ¬ hr_lt_rel X Y <-> hr_le_rel Y X.
proof: Proof. intros x y. rewrite <- (hr_to_NR_bij x), <- (hr_to_NR_bij y). split ; intro H. - apply NR_to_hr_le. apply notlt_leNonnegativeReals. intro H0 ; apply H. apply NR_to_hr_lt. exact H0. - intro H0. refine (pr2 (notlt_leNonnegativeReals _ _) _ _). + refine (pr2 (NR_to_hr_le _ _) _). apply H. + apply_pr2 NR_to_hr_lt. exact H0. Qed.
imports: UniMath.Algebra.Groups UniMath.Foundations.Preamble UniMath.MoreFoundations.Orders UniMath.MoreFoundations.Tactics UniMath.OrderTheory.Lattice.Lattice UniMath.RealNumbers.Prelim UniMath.RealNumbers.Sets UniMath.RealNumbers.NonnegativeRationals UniMath.RealNumbers.NonnegativeReals