proposition: Lemma ler0N1 : 0 <= -1 :> R = false.
proof: Proof. by rewrite lt_geF // ltrN10. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)