proposition: Lemma RminE x y : Rmin x y = Num.min x y.
proof: Proof. case: (lerP x y) => H; first by rewrite Rmin_left //; apply: RlebP. by rewrite ?ltW // Rmin_right //; apply/RlebP; move/ltW : H. Qed.
imports: Rdefinitions Raxioms RIneq Rbasic_fun Zwf Epsilon FunctionalExtensionality Ranalysis1 Rsqrt_def Rtrigo1 Reals mathcomp(all_ssreflect ssralg poly mxpoly ssrnum) HB(structures) mathcomp(boolp classical_sets) reals