End Membership.
Hint Resolve disjoint_nil disjoint_nil'.
(** *** Inclusion  We use the following lemmas from Coq's standard library List. - [incl_refl :  A <<= A] - [incl_tl :  A <<= B -> A <<= x::B] - [incl_cons : x el B -> A <<= B -> x::A <<= B] - [incl_appl : A <<= B -> A <<= B++C] - [incl_appr : A <<= C -> A <<= B++C] - [incl_app : A <<= C -> B <<= C -> A++B <<= C] *)
Hint Resolve incl_refl incl_tl incl_cons incl_appl incl_appr incl_app.
Hint Resolve incl_nil.

(* Specifications: *)
Lemma incl_map X Y A B (f : X -> Y) :
A <<= B -> map f A <<= map f B.
Lemma incl_map X Y A B (f : X -> Y) :
A <<= B -> map f A <<= map f B.