proposition: Lemma seqmul0 (s : seq R) : seqmul [::] s = [::].
proof: Proof. by rewrite /seqmul zip_nil_1. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq path choice fintype order) mathcomp(prime div bigop ssralg poly polydiv polyorder ssrnum zmodp) mathcomp(polyrcf qe_rcf_th complex)