proposition: Lemma Exists_filter_pred_incl : forall P Q l, Exists P l -> pred_incl P Q -> Exists P (filter Q l).
proof: Proof. Proof using. introv M N. induction M; rew_listx. { forwards*: N. case_if*. } { case_if~. } Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)