proposition: Lemma OO1 : ((0 <= 0 :> R) && (0 <= 1 :> R))%R.
proof: Proof. by apply /andP; split; [rewrite lexx | rewrite ler01]. Qed.
imports: mathcomp(all_ssreflect ssralg ssrnum) mathcomp(reals normedtype) mathcomp(mathcomp_extra boolp) mathcomp(lra ring Rstruct)