proposition: Lemma ltRW x y : x < y -> x <= y.
proof: Proof. by have [] := leR_total x y. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div order) mathcomp(ssralg ssrnum ssrint rat intdiv) Coq(Morphisms Setoid) fourcolor(real realsyntax)