proposition: Lemma sgp_rightc (x c : R) : sgp_right c%:P x = sgr c.
proof: Proof. rewrite /sgp_right size_polyC. by have [->|cn0] /= := eqVneq; rewrite ?sgr0 // rootC hornerC cn0. 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)