Proof with firstorder auto.
pose proof NoDup_cons.
intros ? ? E.
induction E; [firstorder | | | firstorder].
split; intro A; inversion_clear A; apply NoDup_cons...
rewrite <- E...
rewrite E...
split; intro A; inversion_clear A; inversion_clear H1...
Qed.
Hint Resolve incl_tran.

(* Specifications: *)
Lemma Permutation_incl X (a b: list X): Permutation a b -> incl a b.
Lemma pointwise_eq_refl A B (x: A -> B): pointwise_relation A eq x x.
Instance filter_perm X: Proper (pointwise_relation _ eq ==> Permutation ==> Permutation) (@filter X).