proposition: Lemma le_path_min x s : path <=%O x s -> all (>= x) s.
proof: Proof. exact/order_path_min/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)