TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-08-06 (claude-opus-5)

How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

$X ∖ (a \cup b) = (X ∖ a) \cap (X ∖ b)$ and $X ∖ (a \cap b) = (X ∖ a) \cup (X ∖ b)$ ; and for a nonempty set $F$ , $X ∖ ⋃ F = ⋂ {X ∖ a : a \in F}$ and $X ∖ ⋂ F = ⋃ {X ∖ a : a \in F}$

Statement

For all sets $X$ , $a$ and $b$ ,

$X ∖ (a \cup b) = (X ∖ a) \cap (X ∖ b), X ∖ (a \cap b) = (X ∖ a) \cup (X ∖ b) .$

Let $F$ be a set with $F \neq \emptyset$ . Then ${X ∖ a : a \in F}$ is a nonempty set and

$X ∖ ⋃ F = ⋂ {X ∖ a : a \in F}, X ∖ ⋂ F = ⋃ {X ∖ a : a \in F} .$

Facts & Assumptions

Given: sets $X$ , $a$ , $b$ , and a set $F$ with $F \neq \emptyset$ where the family forms are concerned.

[L1]

$z \in a ∖ b$ holds exactly when $z \in a$ and $z \notin b$ (The difference $a ∖ b$ , the symmetric difference $a △ b$ , and the complement $X ∖ a$ relative to a set $X$ ).

[L2]

$z \in a \cup b$ holds if and only if $z \in a$ or $z \in b$ ( $⋃ \emptyset = \emptyset$ , $⋃ {a} = a$ , $⋃ {a, b} = a \cup b$ , $⋂ {a} = a$ , and $⋂ {a, b} = a \cap b$ ).

[L3]

$z \in a \cap b$ holds if and only if $z \in a$ and $z \in b$ ( $⋃ \emptyset = \emptyset$ , $⋃ {a} = a$ , $⋃ {a, b} = a \cup b$ , $⋂ {a} = a$ , and $⋂ {a, b} = a \cap b$ ).

[L4]

$⋃ x$ is the set whose elements are exactly the elements of the elements of $x$ (The union $⋃ x$ of a set, and the binary union $a \cup b : = ⋃ {a, b}$ ).

[L5]

For $x \neq \emptyset$ , $⋂ x$ is the set whose elements are exactly the sets belonging to every element of $x$ (The intersection $⋂ x$ of a nonempty set, the binary intersection $a \cap b : = ⋂ {a, b}$ , and disjointness).

[L6]

For any parameters $\overset{ˉ}{p}$ and any set $x$ , there is a set $y$ whose elements are exactly the elements $z$ of $x$ for which $φ (z, \overset{ˉ}{p})$ holds (The Axiom Schema of Separation: for each formula $φ$ , $\forall \overset{ˉ}{p} \forall x \exists y \forall z (z \in y \leftrightarrow (z \in x \land φ (z, \overset{ˉ}{p})))$ ).

[L7]

$z \in P (x)$ holds if and only if $z \subseteq x$ (The power set $P (x) = {z : z \subseteq x}$ ).

[L8]

$x \subseteq y$ means that every element of $x$ is an element of $y$ (Subset $x \subseteq y$ , proper subset $x ⊊ y$ , and the separation notation ${z \in x : φ (z)}$ ).

[L9]

If every $z$ satisfies $z \in x$ if and only if $z \in y$ , then $x = y$ (The Axiom of Extensionality: $\forall x \forall y (\forall z (z \in x \leftrightarrow z \in y) \to x = y)$ ).

Proof

technique · direct

1.1

Every $X ∖ a$ is a subset of $X$ , so the class ${X ∖ a : a \in F}$ is the separated set ${w \in P (X) : \exists a (a \in F \land w = X ∖ a)}$ , hence a set; and it has a member because $F$ does.

L1L6L7L8

1.2

$z \in X ∖ (a \cup b)$ holds exactly when $z \in X$ and neither $z \in a$ nor $z \in b$ , that is, exactly when $z \in X$ and $z \notin a$ , and $z \in X$ and $z \notin b$ ; this is $z \in (X ∖ a) \cap (X ∖ b)$ .

L1L2L3L9

1.3

$z \in X ∖ (a \cap b)$ holds exactly when $z \in X$ and not both $z \in a$ and $z \in b$ , that is, exactly when $z \in X$ and $z \notin a$ , or $z \in X$ and $z \notin b$ ; this is $z \in (X ∖ a) \cup (X ∖ b)$ .

L1L2L3L9

2.1

$z \in X ∖ ⋃ F$ holds exactly when $z \in X$ and no member $s$ of $F$ has $z \in s$ , that is, exactly when $z \in X ∖ a$ for every $a \in F$ ; the sets $X ∖ a$ with $a \in F$ are precisely the elements of ${X ∖ a : a \in F}$ , which is nonempty, so this is $z \in ⋂ {X ∖ a : a \in F}$ .

L1L4L5L9step 1.1

2.2

$z \in X ∖ ⋂ F$ holds exactly when $z \in X$ and $z$ fails to lie in some member $a$ of $F$ , that is, exactly when $z \in X ∖ a$ for some $a \in F$ ; this is $z \in ⋃ {X ∖ a : a \in F}$ .

L1L4L5L9step 1.1

3.1

The two finite laws and the two family laws are established, which is the statement.

step 1.2step 1.3step 2.1step 2.2∎

Depends on

Used by

Dependency tree · two levels

14 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources

De Morgan's laws (Wikipedia) (standard reference, not scraped)
Algebra of sets (Wikipedia) (standard reference, not scraped)
B. Kaya, MATH 320 Set Theory (METU), §1.2 (standard reference, not scraped)

X∖(a∪b)=(X∖a)∩(X∖b)X∖(a∪b)=(X∖a)∩(X∖b) and X∖(a∩b)=(X∖a)∪(X∖b)X∖(a∩b)=(X∖a)∪(X∖b); and for a nonempty set FF, X∖⋃F=⋂{ X∖a:a∈F }X∖⋃F=⋂{X∖a:a∈F} and X∖⋂F=⋃{ X∖a:a∈F }X∖⋂F=⋃{X∖a:a∈F}