proposition: Lemma grec1_correct Fi (F : PolR.T -> nat -> PolR.T) Gi (G : PolR.T -> nat -> R) ai a si s n : (forall qi q m, qi >:: q -> Fi qi m >:: F q m) -> (forall qi q m, qi >:: q -> Gi qi m >: G q m) -> ai >:: a -> seq_contains_pointwise si s -> eq_size si s -> grec1 Fi Gi ai si n >:: PolR.grec1 F G a s n.
proof: Proof. move=> HF HG Ha Hs Hsize. by apply: (grec1up_correct (Rel := fun r i => i >: r)); first exact: J.zero_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