proposition: Lemma seq_sub_default s : size s > 0 -> seq_sub s.
proof: Proof. by case: s => // x s _; exists x; rewrite mem_head. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(path div)