proposition: Lemma take_bseqP s : size (take m s) <= n.
proof: Proof. by rewrite size_take_min (leq_trans _ (size_bseq s)) // geq_minr. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq choice fintype path)