Formulating and Proving DeMorgan's Laws in Set Theory

  • Thread starter Thread starter FeynmanIsCool
  • Start date Start date
  • Tags Tags
    Laws
Click For Summary
SUMMARY

The discussion centers on formulating and proving DeMorgan's Laws in set theory, specifically using the sets A, B, and C as defined in Munkres' Topology. The user demonstrates an attempt to prove the first law, which states that A minus the union of B and C is equivalent to the intersection of A minus B and A minus C. The proof requires clarification on the necessity of stating that elements x are not in sets B and C to validate the argument. The user seeks confirmation on the correctness of their proof approach.

PREREQUISITES
  • Understanding of set theory concepts, including unions and intersections.
  • Familiarity with formal proof techniques in mathematics.
  • Knowledge of Munkres Topology as a foundational text.
  • Ability to manipulate logical statements involving universal quantifiers.
NEXT STEPS
  • Study the formal proof structure in set theory, focusing on quantifiers and logical implications.
  • Review DeMorgan's Laws in set theory for a deeper understanding of their applications.
  • Practice constructing proofs involving set operations and logical reasoning.
  • Explore additional resources on Munkres Topology to reinforce concepts related to set operations.
USEFUL FOR

Students of mathematics, particularly those studying set theory and topology, as well as educators seeking to clarify proof techniques related to DeMorgan's Laws.

FeynmanIsCool
Messages
121
Reaction score
0
Hello,
I am working through Munkres Topology (not for a class). It asks the reader to formulate and proove DeMorgans Laws. I am new to proofs, so I was wondering if this is what the book is asking. Any help would be appreciated!

assume two sets
\, \,\begin{Bmatrix}<br /> A-(B\cup C)\,<br /> \end{Bmatrix}\, and\, \begin{Bmatrix}<br /> (A-B)\cup (A-C)<br /> \end{Bmatrix}\, \, \,

\forall x\in (B\cup C), x\in B\, or\, x\in C \, or \, both

\therefore \, \, \forall x\, \in\begin{Bmatrix}<br /> A-(B\cup C)\,<br /> \end{Bmatrix}, x\in A

Now,

\forall x\in (A-B), \, x\in A\, \, and\, \, \forall x\in (A-C), \, \, x\in A

\Rightarrow \forall x\in \begin{Bmatrix}<br /> (A-B)\cap (A-C), \, x \in A<br /> \end{Bmatrix}x \in AThus: \begin{Bmatrix}<br /> A-(B \cup C)<br /> \end{Bmatrix}<br /> =\begin{Bmatrix}<br /> (A-B)\cap (A-C)<br /> \end{Bmatrix}

Does this proove DeMorgans Law (just the first one)? Formally?

Thanks again!
 
Last edited:
Physics news on Phys.org
If x\in"A- anything" then x\in A. You haven't said anything about x NOT being in the other sets.
 
so I also need to state: x\notin B and x\notin C ?
So if I tagged those statements onto the proof after I state x\in A, then its good?

Im just a little confused, by saying:

\forall x\in (B\cup C), x\in B\, or\, x\in C \, or \, both

\therefore \, \, \forall x\, \in\begin{Bmatrix}<br /> A-(B\cup C)\,<br /> \end{Bmatrix}, x\in A

Aren't I stating that I am taking out all elements of B and C, thus all elements left are elements of A?
 
Last edited:

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
Replies
14
Views
2K
Replies
6
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 5 ·
Replies
5
Views
1K