proposition: Lemma leR_minr : min x y <= y.
proof: Proof. by case: (min x y) / IFR_cases => _ [][lemy ->]. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div order) mathcomp(ssralg ssrnum ssrint rat intdiv) Coq(Morphisms Setoid) fourcolor(real realsyntax)