proposition: Lemma poly_ind : forall (f : T -> Prop), f polyNil -> (forall a p, f p -> f (polyCons a p)) -> forall p, f p.
proof: Proof. by move=> f h1 hrec; elim =>//= a e; apply:hrec. 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