proposition: Lemma leR0n n : 0 <= n.
proof: Proof. by case: n => // n; apply/ltRW/ltR0Sn. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div order) mathcomp(ssralg ssrnum ssrint rat intdiv) Coq(Morphisms Setoid) fourcolor(real realsyntax)