proposition: Lemma disjoint_sym : forall A B (E : list (asn A B)) (F : list (asn A B)), disjoint E F <-> disjoint F E.
proof: Proof. intuition auto using disjoint_sym_1. Qed.
imports: Coq.FSets.FSets Coq.Lists.List Coq.Logic.Decidable Metalib.CoqFSetDecide Metalib.CoqListFacts Metalib.LibTactics Metalib.MetatheoryAtom Metalib.LibTactics