proposition: Lemma ler0z n : (0 <= n%:~R :> R) = (0 <= n).
proof: Proof. by rewrite pmulrz_rge0. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(fintype finfun bigop order ssralg countalg ssrnum) mathcomp(poly)