proposition: Lemma disjoint_eq_inter_empty : forall E F, (E \# F) = (E \n F = \{}).
proof: Proof. Proof using. auto. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibList LibOperation LibMonoid LibInt LibNat LibEpsilon LibRelation LibMin)