proposition: Lemma truncP n : if 0 <= n then (trunc n)%:R <= n < (trunc n).+1%:R else trunc n == 0%N.
proof: Proof. by case: n => //= n; rewrite !natz intS ltz1D lexx. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(fintype finfun bigop order ssralg countalg ssrnum) mathcomp(poly)