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