proposition: Lemma uniq_tmono (h : seq 'I_n) : tmono h -> uniq h.
proof: Proof. rewrite /tmono => /sorted_uniq; rewrite (map_inj_uniq val_inj). by apply; [apply/ltn_trans | move=> ?; rewrite /ltn /= ltnn]. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq path) mathcomp(choice fintype tuple finfun bigop finset binomial) mathcomp(order fingroup perm ssralg zmodp poly ssrint) mathcomp(matrix vector) mathcomp(bigenough) ssrcomplements freeg