proposition: Lemma meval_eq v1 v2 p : v1 =1 v2 -> meval v1 p = meval v2 p.
proof: Proof. move=> eq_v; rewrite !mevalE; apply/eq_bigr=> i _. by congr *%R; apply/eq_bigr=> j _; rewrite eq_v. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq path) mathcomp(choice fintype tuple finfun bigop finset binomial) mathcomp(order fingroup perm ssralg zmodp poly ssrint) mathcomp(matrix vector) mathcomp(bigenough) ssrcomplements freeg