proposition: Lemma cat_sorted2 s s' : sorted leT (s ++ s') -> sorted leT s * sorted leT s'.
proof: Proof. by case: s => //= x s; rewrite cat_path => /andP[-> /path_sorted]. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq)