proposition: Lemma lt_sorted_pairwise s : sorted <%O s = pairwise <%O s.
proof: Proof. exact/sorted_pairwise/lt_trans. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)