proposition: Lemma norm_crealP (x : creal) : creal_axiom (fun i => `|x i|).
proof: Proof. exists (cauchymod x). by move=> *; rewrite (le_lt_trans (ler_dist_dist _ _)) ?cauchymodP. 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)