proposition: Lemma disjoint_app_r : forall A B (E F : list (asn A B)) (G : list (asn A B)), disjoint G (E ++ F) <-> disjoint E G /\ disjoint F G.
proof: Proof. intros. rewrite -> disjoint_sym. apply disjoint_app_l. Qed.
imports: Coq.FSets.FSets Coq.Lists.List Coq.Logic.Decidable Metalib.CoqFSetDecide Metalib.CoqListFacts Metalib.LibTactics Metalib.MetatheoryAtom Metalib.LibTactics