proposition: Lemma disjoint_map_r : forall A B C (E : list (X.t*A)) (F : list (X.t*B)) (f:A->C), disjoint F (map f E) <-> disjoint E F.
proof: Proof. intros. rewrite disjoint_sym. apply disjoint_map_l. Qed.
imports: Coq.FSets.FSets Coq.Lists.List Coq.Logic.Decidable Coq.Strings.String String Metalib.CoqFSetDecide Metalib.CoqListFacts Metalib.LibTactics Metalib.CoqFSetInterface Coq.Classes.Equivalence Coq.Classes.EquivDec Metalib.CoqEqDec