proposition: Lemma sorted_enum n (P : pred 'I_n): sorted ltn (map val (enum P)).
proof: Proof. apply (@subseq_sorted _ ltn trans_ltn _ (map val (enum 'I_n))). - by apply: map_subseq; rewrite {1}/enum_mem enumT filter_subseq. by rewrite val_enum_ord iota_ltn_sorted. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq path) mathcomp(ssralg fintype perm choice finfun) mathcomp(matrix bigop zmodp mxalgebra fingroup) minor