proposition: Lemma eq_tmono (h1 h2 : seq 'I_n) : tmono h1 -> tmono h2 -> h1 =i h2 -> h1 = h2.
proof: Proof. move=> tm1 tm2 h; apply/(inj_map val_inj). apply/(irr_sorted_eq (leT := ltn)) => //. exact/ltn_trans. by move=> ?; rewrite /ltn /= ltnn. move=> m; apply/mapP/mapP; case=> /= x; by rewrite (h, =^~ h)=> {}h ->; exists x. 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