proposition: Lemma asympt_le (x y : creal) (le_xy : (x <= y)%CR) : {asympt e : i / x i < y i + e}.
proof: Proof. exists_big_modulus m F. move=> e i e0 hm; rewrite ltNge; apply/negP=> he; apply: le_xy. by apply: (@lt_crealP e i i). by close. 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)