proposition: Lemma filter_eq_self_of_Forall : forall l P, Forall P l -> filter P l = l.
proof: Proof. Proof using. introv M. rewrite Forall_eq_forall_mem in M. applys* filter_eq_self_of_mem_implies_P. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)