proposition: Lemma indporbitP x : ((s ^+ (indporbit x)) (canporbit x))%g = x.
proof: Proof. Proof using. by rewrite /indporbit; case: ex_minnP => i /eqP. Qed.
imports: mathcomp.ssreflect.ssreflect mathcomp(ssrfun ssrbool eqtype ssrnat seq choice fintype) mathcomp(tuple finfun finset path bigop) mathcomp(fingroup perm action) mathcomp(ssralg matrix mxalgebra algC classfun) partition tools sorted permcomp fibered_set cycles