proposition: Lemma uboundP (x : creal) i : `|x i| <= ubound x.
proof: Proof. by rewrite /ubound; case: ubound_subproof. 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)