De Morgan's laws for logic look like a memorisation chore: \lnot(p \land q) \equiv \lnot p \lor \lnot q. But the visual story is simple and unforgettable. Draw p and q as two overlapping circles. The statement p \land q is the overlap. Its negation — \lnot(p \land q) — is every region of the picture that is not the overlap. Now, separately, shade the region outside p and the region outside q. Their union is also every region that is not the overlap. Same region, two descriptions. That is De Morgan.

Two statements, one region

Read each side of the law as a colouring instruction and the equivalence becomes visual.

Both instructions produce the same picture. The slider below morphs the left-hand picture into the right-hand picture — but the shaded region never changes, because the two instructions describe the same set of worlds.

De Morgan swap animation on Venn circlesTwo overlapping circles labelled p and q. On the left side at t=0, the region shaded represents not of p and q — everything except the overlap. On the right side at t=1, the shaded region represents not p or not q — the union of the two outside regions. The shaded region is identical in both views. A slider at the bottom morphs the labelling between the two interpretations. p q p ∧ q shaded = universe minus overlap ¬(p ∧ q) ¬p ∨ ¬q
Drag the slider from left ($\lnot(p \land q)$) to right ($\lnot p \lor \lnot q$). The shaded region — everywhere *except* the overlap — is identical in both interpretations. The law is not a memorised identity; it is a single picture with two equally valid captions.

The swap by truth table

The picture is the intuition; the truth table is the proof.

\begin{array}{cc|c|c|c|c|c} p & q & p \land q & \lnot(p \land q) & \lnot p & \lnot q & \lnot p \lor \lnot q \\ \hline \mathbf{T} & \mathbf{T} & \mathbf{T} & \mathbf{F} & \mathbf{F} & \mathbf{F} & \mathbf{F} \\ \mathbf{T} & \mathbf{F} & \mathbf{F} & \mathbf{T} & \mathbf{F} & \mathbf{T} & \mathbf{T} \\ \mathbf{F} & \mathbf{T} & \mathbf{F} & \mathbf{T} & \mathbf{T} & \mathbf{F} & \mathbf{T} \\ \mathbf{F} & \mathbf{F} & \mathbf{F} & \mathbf{T} & \mathbf{T} & \mathbf{T} & \mathbf{T} \\ \end{array}

Columns \lnot(p \land q) and \lnot p \lor \lnot q are identical — F, T, T, T — row for row. Equal columns means logical equivalence.

The dual law, same trick

\lnot(p \lor q) \equiv \lnot p \land \lnot q

Why the dual follows: the roles of \land and \lor swap, but the visual logic mirrors exactly. Negate the union of the two circles — you get everything outside both. Separately, take the outside of p and intersect with the outside of q — you also get everything outside both. Same region.

In English: "it is not true that it will rain or snow" is the same as "it will not rain and it will not snow." The negation distributes across the connective while flipping \lor into \land.

The one-line pattern to memorise

Push the \lnot inside by doing two things at once: negate each piece, and swap \land with \lor.

\lnot(\underbrace{p \land q}_{\text{inside}}) = \underbrace{\lnot p}_{\text{negate}} \; \underbrace{\lor}_{\text{swap}} \; \lnot q

Once this rhythm is muscle memory, negating nested connectives becomes mechanical — and you will see the same pattern repeat in set theory (\lnot \leftrightarrow complement, \land \leftrightarrow \cap, \lor \leftrightarrow \cup) and in quantifier logic (\forall swaps with \exists under negation).

Related: Logic and Propositions · Truth-Table Builder · De Morgan — Sets Version · Set Operations · Logic Gate Simulator