proposition: Lemma roots_on_roots : forall p a b, p != 0 -> roots_on p `]a, b[ (roots p a b).
proof: Proof. by move=> a b p; case: rootsP. 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)