proposition: Lemma lift0_mx_is_perm s : is_perm_mx (lift0_mx (perm_mx s)).
proof: Proof. by rewrite lift0_mx_perm perm_mx_is_perm. 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)