proposition: Lemma le0r x : (0 <= x) = (x == 0) || (0 < x).
proof: Proof. by rewrite le_eqVlt eq_sym. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)