proposition: Lemma lreg_mleadc p : GRing.lreg (mleadc p) -> GRing.lreg p.
proof: Proof. move/mulrI_eq0=> reg_p; apply/mulrI0_lreg=> q /eqP. apply/contraTeq => nz_q; rewrite -mleadc_eq0. by rewrite mleadcM_proper reg_p mleadc_eq0. 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