proposition: Lemma map_mx0 : 0^f = 0 :> 'M_(m, n).
proof: Proof. by rewrite map_const_mx raddf0. 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)