proposition: Lemma bottom_perm : Order.bottom = (1 : 'S_n).
proof: Proof. by []. Qed.
imports: HB(structures) mathcomp(all_ssreflect) mathcomp(fingroup perm morphism presentation) permcomp tools permuted combclass congr presentSn ordtype