Size of this PNG preview of this SVG file: 384 × 280 pixels. Other resolutions: 320 × 233 pixels | 640 × 467 pixels | 1,024 × 747 pixels | 1,280 × 933 pixels | 2,560 × 1,867 pixels.

This Venn diagram is meant to represent a relation between

• two sets in set theory,
• or two statements in propositional logic respectively.

The relation 👁 Image
tells, that the set 👁 Image
is empty:   👁 Image
= 👁 Image

In written formulas:

The relation 👁 {\displaystyle A\subseteq B}
tells, that the set 👁 {\displaystyle A\cap B^{c}}
is empty:   👁 {\displaystyle A\cap B^{c}=\emptyset }

Under this condition, several set operations, not equivalent in general, produce equivalent results.
These equivalences define the subset relation:

Venn diagrams	written formulas
👁 Image    👁 {\displaystyle \Leftrightarrow }    👁 Image = 👁 Image	👁 {\displaystyle A\subseteq B}    👁 {\displaystyle \Leftrightarrow }    👁 {\displaystyle A\setminus B=\emptyset }
👁 Image    👁 {\displaystyle \Leftrightarrow }    👁 Image = 👁 Image	👁 {\displaystyle A\subseteq B}    👁 {\displaystyle \Leftrightarrow }    👁 {\displaystyle A=A\cap B}
👁 Image    👁 {\displaystyle \Leftrightarrow }    👁 Image = 👁 Image	👁 {\displaystyle A\subseteq B}    👁 {\displaystyle \Leftrightarrow }    👁 {\displaystyle A\Delta B=B\setminus A}
👁 Image    👁 {\displaystyle \Leftrightarrow }    👁 Image = 👁 Image	👁 {\displaystyle A\subseteq B}    👁 {\displaystyle \Leftrightarrow }    👁 {\displaystyle A\cup B=B}
👁 Image    👁 {\displaystyle \Leftrightarrow }    👁 Image = 👁 Image	👁 {\displaystyle A\subseteq B}    👁 {\displaystyle \Leftrightarrow }    👁 {\displaystyle B^{c}=A^{c}\cap B^{c}}
👁 Image    👁 {\displaystyle \Leftrightarrow }    👁 Image = 👁 Image	👁 {\displaystyle A\subseteq B}    👁 {\displaystyle \Leftrightarrow }    👁 {\displaystyle A\cup B^{c}=(A\Delta B)^{c}}
👁 Image    👁 {\displaystyle \Leftrightarrow }    👁 Image = 👁 Image	👁 {\displaystyle A\subseteq B}    👁 {\displaystyle \Leftrightarrow }    👁 {\displaystyle A^{c}\cup B^{c}=A^{c}}
👁 Image    👁 {\displaystyle \Leftrightarrow }    👁 Image = 👁 Image	👁 {\displaystyle A\subseteq B}    👁 {\displaystyle \Leftrightarrow }    👁 {\displaystyle \emptyset ^{c}=A^{c}\cup B}

The sign 👁 {\displaystyle \Leftrightarrow }
tells, that two statements about sets mean the same.
The sign = tells, that two sets contain the same elements.

The relation 👁 Image
tells, that the statement 👁 Image
is never true:   👁 Image
👁 {\displaystyle \Leftrightarrow }
👁 Image

In written formulas:

The relation 👁 {\displaystyle A\Rightarrow B}
tells, that the statement 👁 {\displaystyle A\land \neg B}
is never true:   👁 {\displaystyle A\land \neg B\Leftrightarrow false}

Under this condition, several logic operations, not equivalent in general, produce equivalent results.
These equivalences define the logical implication:

Venn diagrams	written formulas
👁 Image    👁 {\displaystyle \equiv }    👁 Image 👁 {\displaystyle \Leftrightarrow } 👁 Image	👁 {\displaystyle A\Rightarrow B}    👁 {\displaystyle \equiv }    👁 {\displaystyle A\land \neg B\Leftrightarrow false}
👁 Image    👁 {\displaystyle \equiv }    👁 Image 👁 {\displaystyle \Leftrightarrow } 👁 Image	👁 {\displaystyle A\Rightarrow B}    👁 {\displaystyle \equiv }    👁 {\displaystyle A\Leftrightarrow A\land B}
👁 Image    👁 {\displaystyle \equiv }    👁 Image 👁 {\displaystyle \Leftrightarrow } 👁 Image	👁 {\displaystyle A\Rightarrow B}    👁 {\displaystyle \equiv }    👁 {\displaystyle A\oplus B\Leftrightarrow \neg A\land B}
👁 Image    👁 {\displaystyle \equiv }    👁 Image 👁 {\displaystyle \Leftrightarrow } 👁 Image	👁 {\displaystyle A\Rightarrow B}    👁 {\displaystyle \equiv }    👁 {\displaystyle A\lor B\Leftrightarrow B}
👁 Image    👁 {\displaystyle \equiv }    👁 Image 👁 {\displaystyle \Leftrightarrow } 👁 Image	👁 {\displaystyle A\Rightarrow B}    👁 {\displaystyle \equiv }    👁 {\displaystyle \neg B\Leftrightarrow \neg A\land \neg B}
👁 Image    👁 {\displaystyle \equiv }    👁 Image 👁 {\displaystyle \Leftrightarrow } 👁 Image	👁 {\displaystyle A\Rightarrow B}    👁 {\displaystyle \equiv }    👁 {\displaystyle A\leftarrow B\Leftrightarrow A\leftrightarrow B}
👁 Image    👁 {\displaystyle \equiv }    👁 Image 👁 {\displaystyle \Leftrightarrow } 👁 Image	👁 {\displaystyle A\Rightarrow B}    👁 {\displaystyle \equiv }    👁 {\displaystyle \neg A\lor \neg B\Leftrightarrow \neg A}
👁 Image    👁 {\displaystyle \equiv }    👁 Image 👁 {\displaystyle \Leftrightarrow } 👁 Image	👁 {\displaystyle A\Rightarrow B}    👁 {\displaystyle \equiv }    👁 {\displaystyle true\Leftrightarrow A\rightarrow B}

Especially the last line in this table is important:
The logical implication 👁 {\displaystyle A\Rightarrow B}
tells, that the material implication 👁 {\displaystyle A\rightarrow B}
is always true.
The material implication 👁 {\displaystyle A\rightarrow B}
is the same as 👁 {\displaystyle \neg A\lor B}
.

The sign 👁 {\displaystyle \equiv }
tells, that two statements about statements about whatever objects mean the same.
The sign 👁 {\displaystyle \Leftrightarrow }
tells, that two statements about whatever objects mean the same.

---

Important relations

👁 Image	👁 Image	👁 Image	👁 Image	👁 Image
Set theory:	subset	disjoint	subdisjoint	equal	complementary
Logic:	implication	contrary	subcontrary	equivalent	contradictory

c

A = A

👁 1111

👁 1111

Ac 👁 {\displaystyle \scriptstyle \cup }  Bc

true A ↔ A

A 👁 {\displaystyle \scriptstyle \cup }  B

A 👁 {\displaystyle \scriptstyle \subseteq }  Bc

A👁 {\displaystyle \scriptstyle \Leftrightarrow } A

A 👁 {\displaystyle \scriptstyle \supseteq }  Bc

👁 1110

👁 0111

👁 1110

👁 0111

A 👁 {\displaystyle \scriptstyle \cup }  Bc

¬A 👁 {\displaystyle \scriptstyle \lor }  ¬B A → ¬B

A 👁 {\displaystyle \scriptstyle \Delta }  B

A 👁 {\displaystyle \scriptstyle \lor }  B A ← ¬B

Ac 👁 {\displaystyle \scriptstyle \cup } B

A 👁 {\displaystyle \scriptstyle \supseteq } B

A👁 {\displaystyle \scriptstyle \Rightarrow } ¬B

A = Bc

A👁 {\displaystyle \scriptstyle \Leftarrow } ¬B

A 👁 {\displaystyle \scriptstyle \subseteq } B

👁 1101

👁 0110

👁 1011

👁 1101

👁 0110

👁 1011

Bc

A 👁 {\displaystyle \scriptstyle \lor }  ¬B A ← B

A

A 👁 {\displaystyle \scriptstyle \oplus }  B A ↔ ¬B

Ac

¬A 👁 {\displaystyle \scriptstyle \lor }  B A → B

B

B =

A👁 {\displaystyle \scriptstyle \Leftarrow } B

A = c

A👁 {\displaystyle \scriptstyle \Leftrightarrow } ¬B

A =

A👁 {\displaystyle \scriptstyle \Rightarrow } B

B = c

👁 1100

👁 0101

👁 1010

👁 0011

👁 1100

👁 0101

👁 1010

👁 0011

¬B

A 👁 {\displaystyle \scriptstyle \cap }  Bc

A

(A 👁 {\displaystyle \scriptstyle \Delta }  B)c

¬A

Ac 👁 {\displaystyle \scriptstyle \cap }  B

B

B👁 {\displaystyle \scriptstyle \Leftrightarrow } false

A👁 {\displaystyle \scriptstyle \Leftrightarrow } true

A = B

A👁 {\displaystyle \scriptstyle \Leftrightarrow } false

B👁 {\displaystyle \scriptstyle \Leftrightarrow } true

👁 0100

👁 1001

👁 0010

👁 0100

👁 1001

👁 0010

A 👁 {\displaystyle \scriptstyle \land }  ¬B

Ac 👁 {\displaystyle \scriptstyle \cap }  Bc

A 👁 {\displaystyle \scriptstyle \leftrightarrow }  B

A 👁 {\displaystyle \scriptstyle \cap }  B

¬A 👁 {\displaystyle \scriptstyle \land }  B

A👁 {\displaystyle \scriptstyle \Leftrightarrow } B

👁 1000

👁 0001

👁 1000

👁 0001

¬A 👁 {\displaystyle \scriptstyle \land }  ¬B

A 👁 {\displaystyle \scriptstyle \land }  B

A = Ac

👁 0000

👁 0000

false A ↔ ¬A

A👁 {\displaystyle \scriptstyle \Leftrightarrow } ¬A

These sets (statements) have complements (negations). They are in the opposite position within this matrix.

These relations are statements, and have negations. They are shown in a separate matrix in the box below.

more relations

👁 Image The operations, arranged in the same matrix as above. The 2x2 matrices show the same information like the Venn diagrams. (This matrix is similar to this Hasse diagram.)    In set theory the Venn diagrams represent the set, which is marked in red.   👁 Image These 15 relations, except the empty one, are minterms and can be the case. The relations in the files below are disjunctions. The red fields of their 4x4 matrices tell, in which of these cases the relation is true. (Inherently only conjunctions can be the case. Disjunctions are true in several cases.) In set theory the Venn diagrams tell, that there is an element in every red, and there is no element in any black intersection. 👁 Image Negations of the relations in the matrix on the right. In the Venn diagrams the negation exchanges black and red.   In set theory the Venn diagrams tell, that there is an element in one of the red intersections. (The existential quantifications for the red intersections are combined by or. They can be combined by the exclusive or as well.) 👁 Image Relations like , arranged in the same kind of matrix as above.   In set theory the Venn diagrams tell, that there is no element in any black intersection.

Public domainPublic domainfalsefalse

👁 Image

This work is ineligible for copyright and therefore in the public domain because it consists entirely of information that is common property and contains no original authorship.