Mathematical logic and foundations Proof
Proof of De Morgan's laws for sets
Builds on SetAxiom of extensionalityComplementUnionIntersectionDe Morgan's laws
Proof
We show that each side has the same elements as the other. Two sets with the same elements are equal, by the axiom of extensionality.
- Let be a set, let , and write for the complement of .
- Let be an object. By the definitions of complement and union, holds exactly when and .
- By the first of De Morgan's laws, is equivalent to .
- So holds exactly when , and . This says and .
- By the definition of intersection, step 4 says that holds exactly when . Hence .
- By the definitions of complement and intersection, holds exactly when and .
- By the second of De Morgan's laws, is equivalent to .
- So holds exactly when , and or . This says or .
- By the definition of union, step 8 says that holds exactly when . Hence .
Idea
Complement means "not", union means "or" and intersection means "and". Written for one element, each set law becomes one of De Morgan's laws of logic.
Reading path
To understand this page from the ground up, read these 23 pages in order. The foundations come first. The path takes the proof Proof of De Morgan's laws by truth tables.
Show the path as a graph
- no evidence level
- Element definition
- Proposition concept
- Set definition
- Conjunction definition
- Disjunction definition
- Implication definition
- Negation definition
- Predicate definition
- Intersection definition
- Union definition
- Biconditional definition
- Truth table concept
- Universal quantifier definition
- Axiom of extensionality statement
- Subset definition
- Propositional logic concept
- Universal set definition
- Tautology definition
- Complement definition
- Logical equivalence definition
- Proof of De Morgan's laws by truth tables proof
- De Morgan's laws statement
- Proof of De Morgan's laws for sets proof
Where this leads
64 pages build on this one.
- Closure is the set of limits of sequences
- Non-uniqueness for a non-Lipschitz equation
- Urysohn's lemma
- Cantor set is closed
- Closure is closed
- Arzelà–Ascoli theorem
- Riesz's lemma
- Peano existence theorem
- Intersection of closed sets is closed
- A set is closed iff it equals its closure
- Tychonoff's theorem
- Connected components are closed
- Second Borel–Cantelli lemma
- Cantor set is homeomorphic to the space of binary sequences
- Closure is the smallest closed superset
- De Morgan's laws for sets
- Compact closed unit ball implies finite dimension
- Complete subspaces are closed
- Countable intersection of dense open sets is dense
- Tietze extension theorem
- Proof of the Peano existence theorem by Euler polygons
- Proof of Tychonoff's theorem by maximal families with the finite intersection property
- Nonexistence of infinite-dimensional Lebesgue measure
- Hellinger–Reissner principle
- Brouwer's characterization of the Cantor space
- Proof that connected components are connected and closed
- Carathéodory's existence theorem
- Proof of Riesz's lemma
- Céa's lemma
- Proof that the Cantor set is homeomorphic to the space of binary sequences
- Vanishing mean oscillation
- Absolute neighborhood retract
- Tychonoff space
- Finite element method in structural mechanics
- Lax–Milgram theorem
- Proof of Urysohn's lemma by dyadic open sets
- Proof that complete subspaces are closed
- Minimum total potential energy principle
- Proof of the Tietze extension theorem by successive approximation
- Proof that the closure is the smallest closed superset
- Proof that a compact closed unit ball implies finite dimension
- Schauder fixed-point theorem for integral equations
- Poincaré inequality
- Korn's inequality
- Proof that a countable intersection of dense open sets in a Baire space is dense
- Ill-posedness of first-kind equations
- Compactness of integral operators
- Galerkin method
- Compactness of families of harmonic functions
- Proof of the second Borel–Cantelli lemma
- Jentzsch's theorem on positive kernels
- Kneser's theorem on solution sets
- Hu–Washizu principle
- Ladyzhenskaya–Babuška–Brezzi condition
- Cantor algebra
- Cantor space
- Algorithmic randomness
- Proof that a set is closed if and only if it equals its closure
- Automorphism group of a bounded domain is a Lie group
- Rellich–Kondrachov theorem
- Proof that the closure is the set of limits of sequences
- Proof that the Cantor set is closed
- Proof of the Arzelà–Ascoli theorem by total boundedness
- Montel's theorem
Further reading
- Web https://en.wikipedia.org/wiki/De_Morgan's_laws, Proof for set theory
About this page
| Tag | 64395G4VWB |
|---|---|
| URI | m2://64395G4VWB |
| Kind | proof |
| Writing | W0 stub |
| MSC | 03E20 |
| Proves | De Morgan's laws for sets |
| Uses | Set, Axiom of extensionality, Complement, Union, Intersection, De Morgan's laws |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.