proposition: Lemma opp_correct pi p : pi >:: p -> opp pi >:: PolR.opp p.
proof: Proof. move=> Hp k; rewrite /opp /PolR.opp /nth /PolR.nth. apply (@map_correct R I.type) =>//. - exact: J.zero_correct. - by move=> ? /J.contains_only_0 ->; rewrite Ropp_0; apply: J.zero_correct. - by move=> *; rewrite -(Ropp_0); apply: J.neg_correct. - move=> *; exact: J.neg_correct. Qed.
imports: Coq(ZArith Reals) Coquelicot(Coquelicot) mathcomp.ssreflect(ssreflect ssrfun ssrbool eqtype ssrnat seq fintype bigop) Flocq(Core) Stdlib MathComp Interval Xreal Basic_rec