proposition: Lemma isinvolutive_invNonnegativeRationals : ∏ x, / / x = x.
proof: Proof. intros x. generalize (eq0orgt0NonnegativeRationals x) ; apply sumofmaps ; intro Hx0. - now rewrite Hx0, !inv_zeroNonnegativeRationals. - apply (multNonnegativeRationals_eqcompat_l (/ x)). + apply ispositive_invNonnegativeRationals ; exact Hx0. + rewrite islinv_NonnegativeRationals, isrinv_NonnegativeRationals. * reflexivity. * apply ispositive_invNonnegativeRationals ; exact Hx0. * exact Hx0. 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