proposition: Lemma eq_mxrow m (A_ B_ : forall j, 'M[T]_(m, q_ j)) : (forall j, A_ j = B_ j) -> (\mxrow_j A_ j = \mxrow_j B_ j).
proof: Proof. by move=> /eq_mxrowP. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq choice) mathcomp(fintype finfun bigop finset fingroup perm order) mathcomp(div prime binomial ssralg countalg finalg zmodp)