proposition: Lemma uniq_roots a b p : uniq (roots p a b).
proof: Proof. have [->|p0] := eqVneq p 0; first by rewrite roots0. by apply: (@sorted_uniq _ <%R); [apply: lt_trans | apply: ltxx|]. Qed.
imports: mathcomp.ssreflect.ssreflect mathcomp(ssrfun ssrbool eqtype ssrnat seq choice fintype) mathcomp(bigop order ssralg poly polydiv ssrnum zmodp) mathcomp(polyorder path interval ssrint)