proposition: Lemma disjoint_map_l : forall A B C (E : list (asn A B)) (F : list (asn A B)) (f1 : A -> A) (f2: B -> B), disjoint (map f1 f2 E) F <-> disjoint E F.
proof: Proof. intros; intuition eauto using disjoint_map_1, disjoint_map_2. Qed.
imports: Coq.FSets.FSets Coq.Lists.List Coq.Logic.Decidable Metalib.CoqFSetDecide Metalib.CoqListFacts Metalib.LibTactics Metalib.MetatheoryAtom Metalib.LibTactics