proposition: Lemma fresh (s : seq A) : A -> Type.
proof: Proof. intro s. induction s as [a|b s fresh_s]. exact (fun _ => True). exact (fun a => (b [#] a) and (fresh_s a)). Defined.
imports: ssreflect CSetoids CSetoidFun CFields CPolynomials Program Omega Equivalence Morphisms Wf Morphisms CRings CRing_Homomorphisms Rational Setoid CPoly_NthCoeff CPoly_Degree CReals Intervals CauchySeq IntervalFunct MoreIntervals MoreFunctions Composition seq