proposition: Lemma last_roots_le p a b : a < b -> last a (roots p a b) < b.
proof: Proof. by case: rootsP=> // *; apply: last_roots_on_le. 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)