proposition: Lemma le_path_sortedE x s : path <=%O x s = all (>= x) s && sorted <=%O s.
proof: Proof. exact/path_sortedE/le_trans. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)