proposition: Lemma eventually_impl_base: forall (P Q: DS_set I -> Prop), (forall i:DS_set I, P i -> Q i) -> eventually P -> eventually Q.
proof: Proof. intros. destruct H0. exists x. intros. auto. Qed.
imports: ZornsLemma(Relation_Definitions_Implicit) Coq(Classical) Coq(Arith) Coq(Lia)