How does the explorer verify a three-set law visually?

The explorer displays the left-hand side and right-hand side of each identity as two miniature three-circle Venn diagrams. Each side shades the regions where its expression is true across all eight combinations of membership in A, B, C. When the two shaded patterns match across all eight regions, a green badge confirms that the identity holds for any sets A, B, C.

What categories of three-set laws are included?

The explorer covers twelve identities across four categories: associative laws for union, intersection, and symmetric difference; distributive laws of intersection over union and union over intersection; the two three-set De Morgan's laws; and five difference identities including difference over union, difference over intersection, and nested differences.

Why is the visual proof a valid proof?

A three-circle Venn diagram divides the universe into eight disjoint regions, and any three-set expression assigns each region a single truth value. Two expressions are equal as sets if and only if they produce the same truth value in every region. Checking all eight combinations of A, B, C membership is therefore a complete decision procedure for three-set identities, equivalent to a truth-table proof in propositional logic.

What is the distributive law for sets?

The distributive laws state that intersection distributes over union and union distributes over intersection: A intersect (B union C) equals (A intersect B) union (A intersect C), and A union (B intersect C) equals (A union B) intersect (A union C). Unlike ordinary arithmetic, where multiplication distributes over addition but not the reverse, set union and intersection are mutually distributive over each other.

Venn Diagrams: Three Sets Laws and Complex Identities

Visual proofs — both diagrams should highlight the same regions

Jump to

Identity(A ∪ B) ∪ C = A ∪ (B ∪ C)

(A ∪ B) ∪ C

A ∪ (B ∪ C)

✓ Regions match — identity holds

Theme

ColorOpacity0.85

1 / 12

Explanation

Associative (Union)

(A ∪ B) ∪ C = A ∪ (B ∪ C)

Definition

Grouping does not matter in repeated union.

Key Terms

Getting Started with the Explorer

Navigating Category Tabs

Selecting an Identity

Reading the Side-by-Side Proof

The Match Indicator

Theme Controls and Navigation

What is a Three-Set Identity?

Why Do Visual Proofs Work?

Associative and Distributive Laws

Difference Identities in Three Sets

Related Concepts and Tools

Key Terms

Set identity — an equation between two set expressions that holds for all sets
Associative law — $(A \cup B) \cup C = A \cup (B \cup C)$ , also for $\cap$ and $\triangle$
Distributive law — $A \cap (B \cup C) = (A \cap B) \cup (A \cap C)$ and its dual
De Morgan's laws (three sets) — $(A \cup B \cup C)' = A' \cap B' \cap C'$ and $(A \cap B \cap C)' = A' \cup B' \cup C'$
Symmetric difference — $A \triangle B$ , elements in exactly one of $A$ or $B$ ; extends to $A \triangle B \triangle C$
Difference distribution — $A \setminus (B \cup C) = (A \setminus B) \cap (A \setminus C)$ and $A \setminus (B \cap C) = (A \setminus B) \cup (A \setminus C)$
Nested difference — $(A \setminus B) \setminus C = A \setminus (B \cup C)$
Visual proof — two diagrams shading the same eight regions confirm an identity
Eight regions — the disjoint pieces a three-circle Venn diagram divides the universe into

Getting Started with the Explorer

Open the explorer and you'll see two miniature three-circle Venn diagrams side by side, separated by an equals sign. The left diagram shades the regions for the left-hand side of an identity; the right diagram shades the regions for the right-hand side. When the two shaded patterns match, the identity holds — and a green badge below the diagrams confirms it.

The current identity is shown as a badge above the diagrams (e.g.

(A \cup B) \cup C = A \cup (B \cup C)

). Each side has a label showing the specific expression it represents. The first identity loads automatically, so you can start interacting immediately.

The interface has three control areas: the category tabs at the top, the formula buttons below them, and the Jump to dropdown on the right. Underneath the diagrams are theme controls and a Previous/Next navigation strip with a counter showing your position among the 12 identities.

Navigating Category Tabs

The four category tabs group the 12 laws by structural type:

• Associative — grouping does not matter for repeated

\cup

\cap

, or

\triangle

(three identities)
• Distributive — intersection distributes over union and union distributes over intersection (two identities)
• De Morgan's Laws — the complement of a triple union or triple intersection (two identities)
• Difference — five identities showing how set difference interacts with union, intersection, and itself, including nested differences

Click a tab to switch the row of formula buttons below it. The current identity stays selected across tab switches, so you can browse other groups without losing context. The active tab updates automatically when you use Previous/Next.

Selecting an Identity

Two ways to pick a law. The formula buttons under the active tab display every identity in that category — each button shows the full equation (e.g.

(A \cup B) \cup C = A \cup (B \cup C)

A \cap (B \cup C) = (A \cap B) \cup (A \cap C)

). Click any one to load it into the diagrams.

The Jump to dropdown lists all 12 identities across every category in a single menu, grouped by tab. Useful when you know the formula but not which group it belongs to.

When you select an identity, four things update simultaneously:

• The badge above the diagrams shows the new equation
• The left diagram re-shades for the new LHS expression
• The right diagram re-shades for the new RHS expression
• The match indicator below confirms whether the two patterns agree on all eight regions

Reading the Side-by-Side Proof

Each side of the equals sign is a complete three-circle Venn diagram with eight disjoint regions: outside all circles, three "only" regions (

A

B

C

alone), three pairwise-but-not-triple regions (

A \cap B

minus

C

, and the rest), and the central triple intersection

A \cap B \cap C

. The shaded combination of these eight regions represents the set described by the expression.

A set identity asserts that the LHS and RHS pick out the same regions. The explorer evaluates both expressions on all eight combinations of

A

B

C

membership and shades the diagrams accordingly. If the same regions are shaded on both sides, the two set expressions are equal as sets — that is the geometric content of the identity.

For example, selecting

A \cap (B \cup C) = (A \cap B) \cup (A \cap C)

produces two diagrams that each shade the same three regions where

A

meets either

B

C

. The visual match is the proof.

The Match Indicator

Below the two diagrams, a colored badge reports whether the regions agree:

• Green badge with a checkmark — the two predicates produce the same truth value on all eight membership combinations, meaning the identity holds for any choice of

A

B

C

• Red badge with a cross — the regions differ, meaning the equation is not a valid identity

For every law in the explorer's catalog, the badge is green — the catalog only includes valid identities. The match indicator is a verification, not a test of the user's input. Its purpose is to make the equality between LHS and RHS visible: the equation is true because the two shaded patterns are identical across all eight regions, not just because a textbook says so.

This turns the explorer into a tool for visual reasoning rather than rote memorization.

Theme Controls and Navigation

The Theme panel below the diagrams customizes shading appearance:

• Color picker — change the hue of the shaded regions
• Opacity slider — adjust transparency from

1.00

(opaque) to

0.00

(invisible), with the current value shown next to the slider
• Reset — restore the default blue at

0.85

opacity

Theme changes persist across identity selections, so adjustments apply to every law you visit afterward. Lower opacity is particularly useful when comparing the central triple-intersection regions on both diagrams, where multiple circle boundaries overlap.

The navigation strip at the bottom has Previous and Next buttons that cycle through all 12 identities in the order defined by the category groups: Associative, then Distributive, then De Morgan's Laws, then Difference. Navigation wraps around. The active tab and active formula button update automatically as you advance.

What is a Three-Set Identity?

A three-set identity is an equation between two set expressions in three variables that holds for every possible choice of the sets involved. The equation

A \cap (B \cup C) = (A \cap B) \cup (A \cap C)

is an identity because it is true regardless of what

A

B

C

are. By contrast,

A \cup B = C

is not an identity — it only holds for specific choices of sets.

Three-set identities are where set algebra becomes genuinely structural. Two-set laws like commutativity and idempotence are short statements involving few operations; three-set laws like associativity and distributivity govern how operations combine across multiple operands. They are the rules that make set algebra usable for systematic manipulation in proofs and computation.

For the full algebraic catalog, including identities involving more than three sets, see set laws and identities.

Why Do Visual Proofs Work?

A three-circle Venn diagram divides the universe into eight mutually exclusive regions, and every three-set expression assigns each region one of two states: in or out. Two expressions are equal as sets if and only if they assign the same state to every region.

This means a set identity in three variables can be verified by checking exactly eight cases — the eight possible combinations of "is in

A

", "is in

B

", "is in

C

". The explorer performs this check by evaluating each expression on all eight combinations and shading the regions where the result is true. If the two diagrams match across all eight regions, the identity is verified.

This is not just a heuristic — it is a complete decision procedure for three-set identities, equivalent to a truth-table proof in propositional logic. For identities in

n

sets, the same principle requires

2^n

regions, but the visual approach becomes hard to read past three sets. See venn diagrams for the multi-set generalization.

Associative and Distributive Laws

Three is the smallest number of operands for which associativity becomes meaningful. The explorer covers three associative laws:

(A \cup B) \cup C = A \cup (B \cup C)

(A \cap B) \cap C = A \cap (B \cap C)

(A \triangle B) \triangle C = A \triangle (B \triangle C)

In each case, grouping does not matter — the result is independent of where parentheses are placed.

The two distributive laws govern how union and intersection combine:

A \cap (B \cup C) = (A \cap B) \cup (A \cap C)

A \cup (B \cap C) = (A \cup B) \cap (A \cup C)

Unlike ordinary arithmetic — where addition does not distribute over multiplication — set union and intersection are mutually distributive. Each law lets you expand or factor expressions, and both can be verified by checking that the eight regions match on both sides.

Difference Identities in Three Sets

The Difference tab collects five identities that govern how set difference interacts with union, intersection, and itself across three sets:

• Difference over union:

A \setminus (B \cup C) = (A \setminus B) \cap (A \setminus C)

— removing a union equals intersecting individual differences
• Difference over intersection:

A \setminus (B \cap C) = (A \setminus B) \cup (A \setminus C)

— removing an intersection equals unioning individual differences
• Union minus a set:

(A \cup B) \setminus C = (A \setminus C) \cup (B \setminus C)

— difference distributes from the right over union
• Intersection minus a set:

(A \cap B) \setminus C = A \cap (B \setminus C)

— subtracting

C

from

A \cap B

equals intersecting

A

with

B \setminus C

• Nested difference:

(A \setminus B) \setminus C = A \setminus (B \cup C)

— subtracting two sets in sequence equals subtracting their union

These laws are essentially the De Morgan and distributive laws translated into difference notation, since

A \setminus B = A \cap B'

. They are useful for simplifying complex expressions involving multiple subtractions.

Related Concepts and Tools

Two-Set Laws and Identities — the companion explorer for 27 two-set laws across categories like idempotent, commutative, absorption, and compound complements.

Three-Set Basic Identities — the companion explorer for shading individual three-set expressions (triple union, triple intersection, "exactly two", and so on) rather than identity equations.

Set Operations — formal definitions of union, intersection, complement, difference, and symmetric difference.

Venn Diagrams — overview of one-set, two-set, and three-set diagrams.

De Morgan's Laws — algebraic proofs and the

n

-set generalization.

Set Laws and Identities — the full algebraic catalog including associativity, distributivity, and absorption.

Set Theory Definitions — glossary of foundational terms used throughout set algebra.