proposition: Lemma eq_creal_trans x y z : x == y -> y == z -> x == z.
proof: Proof. move=> eq_xy eq_yz; apply: eq_crealP; exists_big_modulus m F. by move=> e i *; rewrite (@split_dist_add (y i)) ?eq_modP ?divrn_gt0. 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)