proposition: Lemma inord1i n i : i.+1 < n -> (@inord n i = i :> nat).
proof: Proof. move=> Hi; rewrite inordK //; apply ltnW; exact: ltnW. Qed.
imports: HB(structures) mathcomp(all_ssreflect) mathcomp(fingroup perm morphism presentation) mathcomp(ssralg poly ssrint) permcomp tools permuted combclass congr