Formulating and Proving DeMorgan's Laws in Set Theory

  • Thread starter FeynmanIsCool
  • Start date
  • Tags
    Laws
In summary, the conversation is about formulating and proving DeMorgan's Laws, specifically the first one, in the context of working through Munkres Topology. The conversation also touches on the concept of sets and the use of proofs.
  • #1
FeynmanIsCool
121
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
[itex]\, \,\begin{Bmatrix}
A-(B\cup C)\,
\end{Bmatrix}\, and\, \begin{Bmatrix}
(A-B)\cup (A-C)
\end{Bmatrix}\, \, \, [/itex]

[itex]\forall x\in (B\cup C), x\in B\, or\, x\in C \, or \, both[/itex]

[itex]\therefore \, \, \forall x\, \in\begin{Bmatrix}
A-(B\cup C)\,
\end{Bmatrix}, x\in A[/itex]

Now,

[itex]\forall x\in (A-B), \, x\in A\, \, and\, \, \forall x\in (A-C), \, \, x\in A[/itex]

[itex]\Rightarrow \forall x\in \begin{Bmatrix}
(A-B)\cap (A-C), \, x \in A
\end{Bmatrix}[/itex][itex] x \in A[/itex]Thus: [itex]\begin{Bmatrix}
A-(B \cup C)
\end{Bmatrix}
=\begin{Bmatrix}
(A-B)\cap (A-C)
\end{Bmatrix}[/itex]

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

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

Im just a little confused, by saying:

[itex]\forall x\in (B\cup C), x\in B\, or\, x\in C \, or \, both[/itex]

[itex]\therefore \, \, \forall x\, \in\begin{Bmatrix}
A-(B\cup C)\,
\end{Bmatrix}, x\in A[/itex]

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:

Related to Formulating and Proving DeMorgan's Laws in Set Theory

1. What are DeMorgans Laws?

DeMorgans Laws are a set of rules in logic that explain how to negate, or flip, logical statements. They are named after mathematician August DeMorgan.

2. What is the first law of DeMorgans Laws?

The first law states that the negation of a conjunction (AND) is equivalent to the disjunction (OR) of the negation of the individual statements. In other words, "not (A and B)" is the same as "(not A) or (not B)".

3. What is the second law of DeMorgans Laws?

The second law states that the negation of a disjunction (OR) is equivalent to the conjunction (AND) of the negation of the individual statements. In other words, "not (A or B)" is the same as "(not A) and (not B)".

4. How are DeMorgans Laws used in logic?

DeMorgans Laws are used to simplify complex logical statements by breaking them down into smaller, more easily understood parts. They can also be used to transform a statement into a different form without changing its meaning.

5. Can DeMorgans Laws be applied to any type of logical statement?

Yes, DeMorgans Laws are applicable to all types of logical statements, including propositional logic, predicate logic, and Boolean algebra. They are a fundamental concept in logic and are used in various fields such as mathematics, computer science, and philosophy.

Similar threads

  • Calculus and Beyond Homework Help
Replies
6
Views
992
  • Calculus and Beyond Homework Help
Replies
14
Views
1K
  • Calculus and Beyond Homework Help
Replies
5
Views
1K
  • Calculus and Beyond Homework Help
Replies
9
Views
1K
  • Calculus and Beyond Homework Help
Replies
3
Views
976
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
10
Views
2K
  • Calculus and Beyond Homework Help
Replies
8
Views
2K
  • Calculus and Beyond Homework Help
Replies
6
Views
2K
Replies
3
Views
1K
Back
Top