proposition: Lemma asympt_eq (x y : creal) (eq_xy : x == y) : {asympt e : i / `|x i - y i| < e}.
proof: Proof. exists_big_modulus m F. move=> e i e0 hi; rewrite ltNge; apply/negP=> he; apply: eq_xy. by apply: (@neq_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)