How Do You Prove De Morgan's Law for Union and Complement?

  • Thread starter 385sk117
  • Start date
  • Tags
    Laws
In summary, the conversation discusses how to prove De Morgan's Laws using mathematical logic. The conversation includes a step-by-step explanation of how to prove the law (A U B)' = A' n B' and addresses the use of logic in mathematical proofs. The conversation also offers tips for solving similar problems.
  • #1
385sk117
50
0

Homework Statement



Prove De Morgan's Laws (only (A U B)' = A' n B' part)

Homework Equations



(A U B)' = A' n B'

The Attempt at a Solution



I used this
x does not belong to (A U B)
x belongs to A' and B'
x belongs to A' n B'

now opposite

x belongs to A' n B'
x belogns to A' and B'
x does not belong to A and B

and that's it.
how can this x does not belong to A and B can be changed into
x does not belong to (A U B)' ?

all these proving things are confusing..they are too obvious and that's why i can not do this properly how silly..
Any tips that can be used when solving this kind of questions?

Thankyou!
 
Physics news on Phys.org
  • #2
[tex] (x \in A' \cap B') \Rightarrow \neg(x \in A)\wedge \neg (x \in B) = \neg[ (x \in A) \vee (x \in B) ] \Rightarrow (x \in (A \cup B)') [/tex]

Does that make sense?
 
  • #3
@dx - you are using demorgans law to prove demorgans law...

You used that form of the law that applies to mathematical logic, to get the same law in a different form in set theory..

So that proof is void
 
  • #4
@dx - you are using demorgans law to prove demorgans law...

You used that form of the law that applies to mathematical logic, to get the same law in a different form in set theory..

So that proof is void
 
  • #5
How can you prove anything if you're not allowed to use logic?
 
  • #6
you can use logic. What i was talking about was a branch of mathematics - mathematical logic. You have to start from the axioms and prove the law that u have used in your proof. Start from the axioms of 'Mathematical Logic', and use those to prove it. It can be proved, but u must do it. Once that is done, rest follows

What you have done is use DeMorgan's Law in ML to prove the same in set theory. That is where u are wrong.
 
  • #7
you can use logic. What i was talking about was a branch of mathematics - mathematical logic. You have to start from the axioms and prove the law that u have used in your proof. Start from the axioms of 'Mathematical Logic', and use those to prove it. It can be proved, but u must do it. Once that is done, rest follows

What you have done is use DeMorgan's Law in ML to prove the same in set theory. That is where u are wrong.
 
  • #8
what is this \neg stand for?
 
  • #9
385sk117 said:

Homework Statement



Prove De Morgan's Laws (only (A U B)' = A' n B' part)

Homework Equations



(A U B)' = A' n B'

The Attempt at a Solution



I used this
x does not belong to (A U B)
x belongs to A' and B'
x belongs to A' n B'
Very good but more precisely: "Let x belong to (A U B)'. Then x does not belong to A U B and so is not in A and is not in B. Therefore x is in A' and x is in B'. Then x is in A' n B'.

now opposite

x belongs to A' n B'
x belogns to A' and B'
x does not belong to A and B
Let x be in A' n B'. Then x is in A' and in B'. Since x is in A', x is not in A. Since x is in B', x is not in B. If x were in A U B, it would have to be in either A or B. Since it is not, it is not in A U B and so is in A' U B'.

and that's it.
how can this x does not belong to A and B can be changed into
x does not belong to (A U B)' ?

all these proving things are confusing..they are too obvious and that's why i can not do this properly how silly..
Any tips that can be used when solving this kind of questions?

Thankyou!
 
Last edited by a moderator:

What are De Morgan's Laws?

De Morgan's Laws are a set of logical equivalences that relate the negation of a conjunction (AND) or disjunction (OR) to the negation of its individual components.

Why are De Morgan's Laws important?

De Morgan's Laws are important because they allow us to simplify logical expressions and make them more manageable and understandable. They also provide a way to check the validity of logical arguments.

How do you prove De Morgan's Laws?

To prove De Morgan's Laws, we can use truth tables or algebraic manipulation. We can show that the logical expressions on both sides of the equation have the same truth values for all possible combinations of inputs.

What is an example of using De Morgan's Laws?

One example is simplifying the negation of "A or B" to "not A and not B". This can be done using the first De Morgan's Law which states that the negation of a disjunction is equivalent to the conjunction of the negations of its individual components.

Can De Morgan's Laws be applied to other operations?

Yes, De Morgan's Laws can be applied to other operations such as the exclusive disjunction (XOR) and material conditional (if-then) by using their equivalent forms in terms of conjunction and disjunction.

Similar threads

  • Precalculus Mathematics Homework Help
Replies
5
Views
953
  • Precalculus Mathematics Homework Help
2
Replies
57
Views
3K
  • Set Theory, Logic, Probability, Statistics
Replies
11
Views
1K
  • Calculus and Beyond Homework Help
Replies
4
Views
2K
  • Precalculus Mathematics Homework Help
Replies
8
Views
2K
  • Precalculus Mathematics Homework Help
Replies
1
Views
972
  • Precalculus Mathematics Homework Help
Replies
2
Views
1K
  • Precalculus Mathematics Homework Help
Replies
13
Views
2K
  • Calculus and Beyond Homework Help
Replies
2
Views
266
  • Precalculus Mathematics Homework Help
Replies
1
Views
2K
Back
Top