Subject:

Forgot password? New user?

## De Morgan's Laws for Sets

Sign up. Existing user? Log in. Already have an account? Log in here. De Morgan's Laws describe how mathematical statements and concepts are related through their opposites.

## De-Morgan Law with Proof-Lect-25 (Hindi+English)

In set theory , De Morgan's Laws relate the intersection and union of sets through complements. In propositional logic , De Morgan's Laws relate conjunctions and disjunctions of propositions through negation.

De Morgan's Laws are also applicable in computer engineering for developing logic gates. Interestingly, regardless of whether De Morgan's Laws apply to sets, propositions, or logic gates, the structure is always the same. This same structure can be used to make observations in cardinality of sets, to calculate certain probabilities , and to write equivalent propositions.

For sets, De Morgan's Laws are simply observations about the relation between sets and their complements.

## Subscribe to RSS

An easy way to visualize these rules is through Venn Diagrams. Observe the union of the complements of two sets. On a Venn Diagram, this union covers all space in the Venn Diagram except for the intersection of the two sets. Hence, De Morgan's Law for the complement of an intersection of two sets. Submit your answer A recent survey asked high school students whether or not they planned to go to the upcoming basketball game or the upcoming football game.

Observe the intersection of the complements of two sets. On a Venn Diagram, this intersection covers all space in the Venn Diagram except for the union of the two sets. Hence, De Morgan's Law for the complement of a union of two sets. The complement of the intersection of these sets is:.

## De Morgan's First Law

The complement of the union of these sets is:. Because these generalizations require finding the unions and intersections of many sets, it is important to consider the principle of inclusion and exclusion when calculating the cardinality of sets with De Morgan's Laws.

Submit your answer Let a tough-to-test composite be a positive integer that is composite, but not divisible by 2, nor 3, nor 5. Given that there are prime numbers between 1 and , how many tough-to-test composite numbers are there between 1 and ?

Notes : 1 is neither prime nor composite.

## PROOFS FOR DEMORGAN'S LAWS

There are some tough-to-test composite numbers that many would recognize as composite. For example, 49 and De Morgan's Laws follow a similar structure for logical propositions. The language of these concepts can seem intimidating, but the concepts themselves are fairly straightforward. The negation of the conjunction of two propositions p p p and q q q is equivalent to the disjunction of the negations of those propositions.

This can be confirmed with a truth table of the propositions p p p and q q q :. What is an equivalent statement to "The lawn needs mowed and the car needs washed, but I will not do both.

## Proof by Venn diagram

The two propositions are "I will mow the lawn" and "I will wash the car. Note that this statement leaves open the possibility that one of the chores is completed, and it is also possible that neither chores are completed. The negation of the disjunction of two propositions p p p and q q q is equivalent to the conjunction of the negations of those propositions. The two propositions are "The dog is brown" and "The dog is black. The negation of the conjunction of these propositions is equivalent to the disjunction of their negations:.

The negation of the disjunction of these propositions is equivalent to the conjunction of their negations:. Having an understanding of De Morgan's Laws can help one understand how to make these constructions.

## Demorgan's Law of Set Theory Proof

Each of these inputs can have a value of 1 1 1 for high or 0 0 0 for low. Otherwise, the output is 1 1 1. A NOT gate negates a signal. If the input is 1 1 1 , then the output will be 0 0 0 , and vice versa.

## De Morgan's Laws for Logical Propositions

Thus, the NAND gate will produce the negated signal. An AND gate works just like a logical conjunction. If both input signals are 1 1 1 , then the output signal is 1 1 1. Otherwise, the output signal is 0 0 0. This can be accomplished with the NOT construction above. An OR gate works just like a logical disjunction. If both input signals are 0 0 0 , then the output signal is 0 0 0. Otherwise, the output signal is 1 1 1. In particular, consider how De Morgan's Laws can be applied.

Sign up Log in. Excel in math and science.

Log in with Facebook Log in with Google Log in with email. Join using Facebook Join using Google Join using email. Sign up with Facebook or Sign up manually.

## De morgan s law proof pdf online

Recommended Course Logic Stretch your analytic muscles with knights, knaves, logic gates, and more! Andy Hayes and Vincent Wu contributed. Submit your answer. A recent survey asked high school students whether or not they planned to go to the upcoming basketball game or the upcoming football game.

How many students plan to attend both games? How many integers between 1 and inclusive are neither multiples of 2 nor multiples of 5? Let a tough-to-test composite be a positive integer that is composite, but not divisible by 2, nor 3, nor 5. Negation of the Conjunction of Propositions The negation of the conjunction of two propositions p p p and q q q is equivalent to the disjunction of the negations of those propositions.

Negation of the Disjunction of Propositions The negation of the disjunction of two propositions p p p and q q q is equivalent to the conjunction of the negations of those propositions. Cite as: De Morgan's Laws.

## Navigation menu

Master concepts like these Get started Learn more in our Logic course, built by experts for you. Sign up to read all wikis and quizzes in math, science, and engineering topics.

This is likely due to network issues. Please try again in a few seconds, and if the problem persists, send us an email.