proposition: Lemma leR_eqVlt x y : x <= y <-> x == y \/ x < y.
proof: Proof. split=> [lexy | [-> | /ltRW] //]. by have [|/ltR_total[]//] := reals_classic (x == y); [left | right]. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div order) mathcomp(ssralg ssrnum ssrint rat intdiv) Coq(Morphisms Setoid) fourcolor(real realsyntax)