proposition: Lemma nat_ind2 (P : nat -> Prop) : P 0 -> P 1 -> (forall k, P k -> P k.+1 -> P k.+2) -> forall k, P k.
proof: Proof. move=> H0 H1 Hind k. suff : P k /\ P k.+1 by case. elim: k => [|k [IHk0 IHk1]]; first by split. split; by [|apply: Hind]. Qed.
imports: Coq(ZArith Psatz Reals) Flocq(Raux) Coquelicot(Coquelicot) mathcomp.ssreflect(ssreflect ssrfun ssrbool eqtype ssrnat seq fintype bigop) Stdlib MathComp Coquelicot Xreal Interval Basic Xreal_derive Interval_compl Datatypes Taylor_poly Basic_rec Bound