# Set Identities

We now consider the basic set identities that relate the various set operations.

The sets \(A,\) \(B,\) \(C\) below are subsets of a universal set \(U.\)

### Identity Laws

### Domination Laws

### Idempotent Laws

### Complement Laws

### Double Complement Law

### Commutative Laws

### Associative Laws

### Distributive Laws

### De Morgan's Laws

### Absorption Laws

### Complements of \(U\) and \(\varnothing\)

### Set Difference Law

There are different ways to prove set identities.

The basic method to prove a set identity is the element method or the method of double inclusion. It is based on the set equality definition: two sets \(A\) and \(B\) are said to be equal if \(A \subseteq B\) and \(B \subseteq A\). In this method, we need to prove that the left-hand side \(\left({LHS}\right)\) of a set identity is a subset of the right-hand side \(\left({RHS}\right)\) and vice versa.

Another way to prove is to use the basic algebraic identities considered above (the algebraic method). It is also worthwhile to mention methods based on the use of membership tables (similar to truth tables) and set builder notation.