proposition: Lemma lift0_permK s : cancel (lift0_perm s) (lift0_perm s^-1).
proof: Proof. by move=> i; rewrite /lift0_perm -lift_permV permK. 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)