Two sets are equal when each is a subset of the other. To prove an identity, take an arbitrary element of the left side and show it lies in the right side, then do the same in reverse.
| Step | On | |
|---|---|---|
| 1 | Translate each side into membership conditions. Use the definition of each operation, one at a time. | left: , ; right: , |
| 2 | Show that the left side is a subset of the right side. Take any on the left. means and , so and . | |
| 3 | Show that the right side is a subset of the left side. Take any on the right. Then , and , so is in neither nor : . | |
| 4 | Conclude that the sets are equal. Two inclusions give equality. Before writing a proof, test the claim on small sets: a single failure disproves it. | the identity holds |