Two sets $A$ and $B$ are considered equal, if $A$ is a subset of $B$, and vice versa. Formally:
$$A=B\Longleftrightarrow (A\subseteq B)\wedge (B\subseteq A).$$
The negation of the equality of sets is their inequality and denoted by $A\neq B.$
|
|
|
|
| created: 2017-08-13 11:44:27 | modified: 2020-05-10 18:35:44 | by: bookofproofs | references: [711]
[711] Mendelson Elliott: “Theory and Problems of Boolean Algebra and Switching Circuits”, McGraw-Hill Book Company, 1982