proposition: Lemma monic_prod_XsubCe I rI (P : pred I) (F : I -> R) (G : I -> nat): \prod_(i <- rI | P i) ('X - (F i)%:P )^+ (G i) \is monic.
proof: Proof. by apply: monic_prod => i _; exact: monicXsubCe. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice fintype order) mathcomp(binomial bigop ssralg poly ssrnum ssrint rat) mathcomp(polydiv polyorder path interval polyrcf)