proposition: Lemma disjoint_map_r : forall A B C (E : list (asn A B)) (F : list (asn A B)) (f1 : A -> A) (f2: B -> B), disjoint F (map f1 f2 E) <-> disjoint E F.
proof: Proof. intros. rewrite -> disjoint_sym. apply disjoint_map_l. auto. Qed.
imports: Coq.FSets.FSets Coq.Lists.List Coq.Logic.Decidable Metalib.CoqFSetDecide Metalib.CoqListFacts Metalib.LibTactics Metalib.MetatheoryAtom Metalib.LibTactics