proposition: Lemma cst_crealP (x : F) : creal_axiom (fun _ => x).
proof: Proof. by exists (fun _ => 0%N)=> *; rewrite subrr normr0. 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)