proposition: Lemma lerz1 n : (n%:~R <= 1 :> R) = (n <= 1).
proof: Proof. by rewrite -[1]/(1%:~R) ler_int. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(fintype finfun bigop order ssralg countalg ssrnum) mathcomp(poly)