proposition: Lemma disjoint_one_r : forall A B (x : atom) (a : A) (E : list (asn A B)), disjoint E (one (VarAsn B x a)) <-> x `notin` dom E.
proof: Proof. intros. rewrite -> disjoint_sym. apply disjoint_one_l. Qed.
imports: Coq.FSets.FSets Coq.Lists.List Coq.Logic.Decidable Metalib.CoqFSetDecide Metalib.CoqListFacts Metalib.LibTactics Metalib.MetatheoryAtom Metalib.LibTactics