proposition: Lemma poly_accr_bound2_ge0 p a r : 0 <= poly_accr_bound2 p a r.
proof: Proof. by rewrite ltW // poly_accr_bound2_gt0. Qed.
imports: mathcomp.ssreflect.ssreflect mathcomp(ssrfun ssrbool eqtype ssrnat seq choice fintype) mathcomp(bigop order ssralg ssrnum ssrint rat poly polydiv polyorder) mathcomp(perm matrix mxpoly polyXY binomial bigenough)