proposition: Lemma Dcuts_inv_bot : Dcuts_def_bot Dcuts_inv_val.
proof: Proof. intros r Hr q Hq. revert Hr. apply hinhfun ; intros l. exists (pr1 l) ; repeat split. - intros rx Xrx. apply istrans_leNonnegativeRationals with (2 := pr1 (pr2 l) _ Xrx). now apply multNonnegativeRationals_lecompat_r. - exact (pr1 (pr2 (pr2 l))). - exact (pr2 (pr2 (pr2 l))). Qed.
imports: UniMath.MoreFoundations.Orders UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.Notations UniMath.RealNumbers.Sets UniMath.Algebra.ConstructiveStructures UniMath.OrderTheory.Lattice.Lattice UniMath.RealNumbers.Prelim UniMath.RealNumbers.NonnegativeRationals