proposition: Lemma mpoly_eqP p q : (p = q) <-> (p = q :> {freeg _ / _}).
proof: Proof. split=> [->//|]; case: p q => [p] [q]. by rewrite !mpoly_valK=> ->. 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