This Venn diagram is meant to represent a relation between

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

The relation tells, that the set is empty:    =

It can be written as ${\displaystyle A^{c}\subseteq B}$ or as ${\displaystyle B^{c}\subseteq A}$.
It tells, that all elements are within the two sets ${\displaystyle ~A}$ and ${\displaystyle ~B}$:   ${\displaystyle (A\cup B)^{c}=\emptyset }$

Example: The set of male first names and the set of female first names are subdisjoint.
But they are not complementary sets, because some names (such as Andrea) can be given to both boys and girls.

Under this condition several set operations, not equivalent in general, produce equivalent results.
These equivalences define subdisjoint sets:

Venn diagrams	written formulas
${\displaystyle \Leftrightarrow }$    =	${\displaystyle A^{c}\subseteq B}$   ${\displaystyle \Leftrightarrow }$   ${\displaystyle (A\cup B)^{c}=\emptyset }$
${\displaystyle \Leftrightarrow }$    =	${\displaystyle A^{c}\subseteq B}$   ${\displaystyle \Leftrightarrow }$   ${\displaystyle (A\Delta B)^{c}=A\cap B}$
${\displaystyle \Leftrightarrow }$    =	${\displaystyle A^{c}\subseteq B}$   ${\displaystyle \Leftrightarrow }$   ${\displaystyle A^{c}=B\setminus A}$
${\displaystyle \Leftrightarrow }$    =	${\displaystyle A^{c}\subseteq B}$   ${\displaystyle \Leftrightarrow }$   ${\displaystyle A^{c}\cup B=B}$
${\displaystyle \Leftrightarrow }$    =	${\displaystyle A^{c}\subseteq B}$   ${\displaystyle \Leftrightarrow }$   ${\displaystyle B^{c}=A\setminus B}$
${\displaystyle \Leftrightarrow }$    =	${\displaystyle A^{c}\subseteq B}$   ${\displaystyle \Leftrightarrow }$   ${\displaystyle A\cup B^{c}=A}$
${\displaystyle \Leftrightarrow }$    =	${\displaystyle A^{c}\subseteq B}$   ${\displaystyle \Leftrightarrow }$   ${\displaystyle (A\cap B)^{c}=A\Delta B}$
${\displaystyle \Leftrightarrow }$    =	${\displaystyle A^{c}\subseteq B}$   ${\displaystyle \Leftrightarrow }$   ${\displaystyle \emptyset ^{c}=A\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 tells, that the statement is never true:   ${\displaystyle \Leftrightarrow }$

It can be written as ${\displaystyle \neg A\Rightarrow B}$ or as ${\displaystyle \neg B\Rightarrow A}$.
It tells, that the statements ${\displaystyle ~A}$ and ${\displaystyle ~B}$ are never false together:   ${\displaystyle \neg (A\lor B)=false}$

Example: The statements "The president's first name could be given to a girl." and "The president's first name could be given to a boy." are subcontrary: They can not be false together. But they are not contradictory, because both statements are true, if the president's first name is e.g. Andrea.

Under this condition several logic operations, not equivalent in general, produce equivalent results.
These equivalences define subcontrary statements:

Venn diagrams	written formulas
${\displaystyle \equiv }$   ${\displaystyle \Leftrightarrow }$	${\displaystyle \neg A\Rightarrow B}$   ${\displaystyle \equiv }$   ${\displaystyle \neg (A\lor B)\Leftrightarrow false}$
${\displaystyle \equiv }$   ${\displaystyle \Leftrightarrow }$	${\displaystyle \neg A\Rightarrow B}$   ${\displaystyle \equiv }$   ${\displaystyle A\leftrightarrow B\Leftrightarrow A\land B}$
${\displaystyle \equiv }$   ${\displaystyle \Leftrightarrow }$	${\displaystyle \neg A\Rightarrow B}$   ${\displaystyle \equiv }$   ${\displaystyle \neg A\Leftrightarrow \neg A\land B}$
${\displaystyle \equiv }$   ${\displaystyle \Leftrightarrow }$	${\displaystyle \neg A\Rightarrow B}$   ${\displaystyle \equiv }$   ${\displaystyle \neg A\lor B\Leftrightarrow B}$
${\displaystyle \equiv }$   ${\displaystyle \Leftrightarrow }$	${\displaystyle \neg A\Rightarrow B}$   ${\displaystyle \equiv }$   ${\displaystyle \neg B\Leftrightarrow A\land \neg B}$
${\displaystyle \equiv }$   ${\displaystyle \Leftrightarrow }$	${\displaystyle \neg A\Rightarrow B}$   ${\displaystyle \equiv }$   ${\displaystyle A\lor \neg B\Leftrightarrow A}$
${\displaystyle \equiv }$   ${\displaystyle \Leftrightarrow }$	${\displaystyle \neg A\Rightarrow B}$   ${\displaystyle \equiv }$   ${\displaystyle \neg (A\land B)\Leftrightarrow A\oplus B}$
${\displaystyle \equiv }$   ${\displaystyle \Leftrightarrow }$	${\displaystyle \neg A\Rightarrow B}$   ${\displaystyle \equiv }$   ${\displaystyle true\Leftrightarrow 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

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

∅c

A = A

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

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

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

¬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

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

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

∅

A ${\displaystyle \scriptstyle \land }$ B

A = Ac

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

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.   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. 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.) Relations like subset and implication, 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.

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.