proposition: Lemma eq_le_creal (x y : creal) : x == y -> (x <= y)%CR.
proof: Proof. by move=> /eq_creal_sym ? /lt_neq_creal. 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)