Disjoint sets
In mathematics, two sets are said to be disjoint if they have no element in common. Equivalently, disjoint sets are sets whose intersection is the empty set. For example, {1, 2, 3} and {4, 5, 6} are disjoint sets, while {1, 2, 3} and {3, 4, 5} are not.
This definition of disjoint sets can be extended to any family of sets. A family of sets is pairwise disjoint or mutually disjoint if every two different sets in the family are disjoint. For example, the collection of sets { {1}, {2}, {3}, ... } is pairwise disjoint.
Two sets are said to be almost disjoint sets if their intersection is small in some sense. For instance, two infinite sets whose intersection is a finite set may be said to be almost disjoint.
In topology, there are various notions of separated sets with more strict conditions than disjointness. For instance, two sets may be considered to be separated when they have disjoint closures or disjoint neighborhoods. Similarly, in a metric space, positively separated sets are sets separated by a nonzero distance.
The set of the drum and the guitar is disjoint to the set of the card and the book
A pairwise disjoint family of sets
A non pairwise disjoint family of sets
Disjointness of two sets, or of a family of sets, may be expressed in terms of their intersections.
Two sets A and B are disjoint if and only if their intersection is the empty set. It follows from this definition that every set is disjoint from the empty set, and that the empty set is the only set that is disjoint from itself.
...
Wikipedia