Learn Practice Download

*T&C Apply

De Morgan's Law
De Morgan's laws are a pair of transformation rules in boolean algebra and set theory that is
used to relate the intersection and union of sets through complements. There are two
conditions that are specified under Demorgan's law. These conditions are primarily used to
reduce expressions into a simpler form. This increases the ease of performing calculations
and solving complex boolean expressions.

According to De Morgan's Laws:

The complement of the union of two sets is equal to the intersection of their individual
complements.
Additionally, the complement of the intersection of two sets is equal to the union of their
individual complements.

These laws can easily be visualized using Venn diagrams. In this article, we will learn about
the statements of Demorgan's law, the proof of these statements, their applications, and
examples.

What are De Morgan's Laws?

Demorgan's laws are a set of two postulates that are widely used in set theory. They state
that: (i) (A ∪ B)’ = A’ ∩ B’ and (ii) (A ∩ B)’ = A’ ∪ B’.

☛Also Check: 1

A union B Complement (First De Morgan's Law)

A Intersection B Complement (Second De Morgan's Law)

When we have a collection of well-defined distinct objects that form a group, this collection is
known as set. When we want to simplify set operations such as taking the complement,
Math worksheets and
union, and intersection of sets, we use De Morgan's laws. Book A FREE Class
visual curriculum

De Morgan's Law Statement

Demorgan's law can be used in boolean algebra as well as in set theory to simplify
mathematical expressions. Suppose we have two sets A and B that are subsets of the
universal set U. A' is the complement of A and B' is the complement of B. '∩' is the symbol for
intersection and '∪' is used to denote the union. Then the De Morgan's laws are given below.

De Morgan's Law of Union: The complement of the union of the two sets A and B will be
equal to the intersection of A' (complement of A) and B' (complement of B). This is also
known as De Morgan's Law of Union. It can be represented as (A ∪ B)’ = A’ ∩ B’. We can also
generalize this law. Suppose we have n sets given by {A1 , A2 , . . . , An } then formula is given by
′
(⋃ni=1 Ai ) = ⋂ni=1 Ai .
′

Learn Math Better & Faster Restart

 Learn Practice Download

In the above Venn diagram, the orange-coloured shaded portion represents A ∪ B and the
blue-coloured portion represents (A ∪ B)’.

De Morgan's Law of Intersection: The complement of the intersection of A and B will be

equal to the union of A' and B'. This condition is called De Morgan's law of Intersection. It can
be given by (A ∩ B)’ = A’ ∪ B’. Similarly, as above this law can be generalized by the formula
′
(⋂ni=1 Ai ) = ⋃ni=1 Ai .
′

In the above Venn diagram, the orange-coloured shaded portion represents A ∩ B and the
blue-coloured portion represents (A ∩ B)’.

De Morgan's Law Example

Let us understand De Morgan's law with the help of a simple example. Let the universal set U
1

= {7, 8, 9, 10, 11, 12, 13 }. The two subsets are given by A = {11, 12, 13} and B = {7, 8}.

De Morgan's Law of Union Example: (A ∪ B) = {7, 8, 11, 12, 13}, (A ∪ B)’ = {9, 10}. A’ = {7, 8, 9,
10} and B' = { 9, 10, 11, 12, 13}. A’ ∩ B’ = {9, 10}. Thus, (A ∪ B)’ = A’ ∩ B’
De Morgan's Law of Intersection Example: (A ∩ B) = ∅, (A ∩ B)' = {7, 8, 9, 10, 11, 12, 13 }. A’ ∪
Math worksheets and
B’ = {7, 8, 9, 10, 11, 12, 13}. Hence, (A ∩ B)’ = A’ ∪ B’
visual curriculum

De Morgan's Law Proof

In set theory, Demorgan's law proves that the intersection and union of sets get interchanged
under complementation. We can prove De Morgan's law both mathematically and by taking
the help of truth tables.

Proof of (A ∪ B)’ = A’ ∩ B’:

The first De Morgan's theorem or law of Union can be proved as follows:

Let R = (A U B)' and S = A' ∩ B'. Our intention now is to prove R = S. For this, it is sufficient to
prove that R ⊂ S and S ⊂ R.

Suppose we choose an element y that belongs to R. This is denoted as y ∈ R.

⇒ y ∈ (A U B)'

⇒ y ∉ (A U B)

⇒ y ∉ A and y ∉ B

⇒ y ∈ A' and y ∈ B'

⇒ y ∈ A' ∩ B'
⇒y∈S

Thus, we conclude that R ⊂ S (R is a subset of S) ...(1)

Learn Practice Download
Now suppose we have an arbitrary element z that belongs to set S. Then z ∈ S

⇒ z ∈ A' ∩ B'

⇒ z ∈ A' and z ∈ B'

⇒ z ∉ A and z ∉ B

⇒ z ∉ (A U B)

⇒ z ∈ (A U B)'

⇒z∈R

Hence, S ⊂ R ...(2)

From (1) and (2) we infer that S = R or (A ∪ B)’ = A’ ∩ B’. Thus, this theorem is proved.

Proof of (A ∩ B)’ = A’ ∪ B’:

The second De Morgan's theorem or law of Intersection can be mathematically proved using
the following steps:

Let G = (A ∩ B)' and H = A' U B'. We would now prove that G = H by proving G ⊂ H and H ⊂ G.

Let an element y belong to G. y ∈ G.

⇒ y ∈ (A ∩ B)'

⇒ y ∉ (A ∩ B)

⇒ y ∉ A or y ∉ B

⇒ y ∈ A' or y ∈ B'

⇒ y ∈ A' U B'

⇒y∈H

This implies that G ⊂ H ...(1)

If z is an arbitrary element of H then z ∈ H 1

⇒ z ∈ A' U B'

⇒ z ∈ A' or z ∈ B'

⇒ z ∉ A or z ∉ B

⇒ zworksheets
Math ∉ (A ∩ B) and
visual curriculum
⇒ z ∈ (A ∩ B)'

⇒z∈G

Therefore, H ⊂ G ...(2)

Now when we combine (1) and (2) we can say that G = H or (A ∩ B)’ = A’ ∪ B’. Hence, we have
successfully proved the second theorem.

De Morgan's Law in Boolean Algebra

De Morgan's laws in boolean algebra are as follows:
¯¯¯¯¯¯¯¯¯¯¯¯¯ ¯¯¯¯ ¯¯¯¯
A∙B =A +B
¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯ ¯¯¯¯ ¯¯¯¯
A+B =A •B

In boolean algebra, we make use of logic gates. These logic gates work on logic operations.
Here, A and B become input binary variables. "0's" and "1's" are used to represent digital
input and output conditions. Thus, using these conditions we can create truth tables to
define operations such as AND (A•B), OR (A + B), and NOT (negation). By using logic
operations as well as truth tables, we can state and prove De Morgan's laws as follows.

First De Morgan's Law

It that when two or more input variables (A, B) are OR’ed and then negated, the result is
¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯ ¯¯¯¯ ¯¯¯¯
equal to the AND of the complements of the individual input variables. A + B = A •B . To
prove this theorem we can use the truth table as given below:
Learn Practice Download

¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯ ¯¯¯¯ ¯¯¯¯

From the above table, we can notice that the columns of A + B and A · B are one and the
same.

Second De Morgan's Law

It states that when two or more input variables are AND'ed and negated, then the obtained
¯¯¯¯¯¯¯¯¯¯¯¯¯ ¯¯¯¯ ¯¯¯¯
result will be equal to the OR of the complements of the individual variables. A ∙ B =A +B.
Using the truth table, we can prove this as follows:

B
1

1
Math worksheets and
visual curriculum
1

For simplicity purposes, OR operation is analogous to the union of sets operation while the
AND operation corresponds to the intersection operation of sets.

De Morgan's Law Formula

Demorgan's law is used both in set theory as well as in boolean algebra. These laws are
critical in understanding mathematical arguments. Using these laws a relationship can be
established between union and intersection via complementation. Given below are the
various forms of the formulas:
In set theory,

(A ∪ B)’ = A’ ∩ B’
(A ∩ B)’ = A’ ∪ B’
Learn Practice Download

Generalized Formulas for infinite unions and intersections,

(⋃ni=1 Ai ) = ⋂ni=1 Ai
′ ′

(⋂ni=1 Ai ) = ⋃ni=1 Ai
′ ′

In Boolean Algebra,
¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯ ¯¯¯¯ ¯¯¯¯
A+B = A •B
¯¯¯¯¯¯¯¯¯¯¯¯¯ ¯¯¯¯ ¯¯¯¯
A∙B =A +B

Applications of De Morgan's Theorem

De Morgan's law is used in both elementary algebra as well as Boolean algebra. As this law
helps to reduce complicated expressions it is widely utilized in most engineering industries
to create hardware and simplify operations. Given below are some other applications of De
morgan's law.

De morgan's law applications can be seen in electronic engineering for developing logic
gates. By using, this law equations can be constructed using only the NAND (AND negated)
or NOR (OR negated) gates. This results in cheaper hardware. Further, NAND, NOT and NOR
gates are easier to implement practically.
Demorgan's law is used in computer programming. This law helps to simplify logical
expressions written in codes thereby, reducing the number of lines. Thus, it helps in the
overall optimization of the code. Furthermore, these laws are make verifying SAS codes
much simpler and faster.

☛Related Articles:

Boolean Algebra Calculator

Types of Sets
Set Operations

Important Notes on De Morgan's Law:

1
¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯ ¯¯¯¯ ¯¯¯¯
The first de morgan's law is given by the formula (A ∪ B)’ = A’ ∩ B’ or A + B = A •B . This is
also known as De Morgan's law of union.
¯¯¯¯¯¯¯¯¯¯¯ ¯¯¯¯ ¯¯¯¯
The second de morgan's law is written as (A ∩ B)’ = A’ ∪ B’ or A. B = A + B . This is also
called De Morgan's law of intersection.
The union operator is analogous to the logical OR and the intersection operator is equivalent
Math worksheets and
visualto logical
curriculum AND.
The proof of de morgan's law can be given by truth tables (in boolean algebra) and
theoretically (set theory).

Cuemath is one of the world's leading math learning platforms that offers LIVE 1-to-1 online
math classes for grades K-12. Our mission is to transform the way children learn math, to
help them excel in school and competitive exams. Our expert tutors conduct 2 or more live
classes per week, at a pace that matches the child's learning needs.

Download FREE Study Materials

 Learn Practice Download

The Pill Scare 😨

Examples Using De Morgan's Law

Example 1: If U = {1, 3, 5, 7, 9, 11}, A = {3, 5} and B = {5, 7, 9}, then prove De Morgan's first law.

Solution: According to De Morgan's First law, (A ∪ B)’ = A’ ∩ B’

(A ∪ B) = {3, 5, 7, 9}, (A ∪ B)’ = {1, 11}

A’ = {1, 7, 9, 11} and B' = {1, 3, 11}

A’ ∩ B’ = {1, 11}.

Answer: Hence, (A ∪ B)’ = A’ ∩ B’

Math worksheets and

visual curriculum

Practice Questions on De Morgan's Law

Q.1
Simplify the following expression:
¯¯¯¯¯¯¯¯¯
CD + CD

D + CD

¯¯¯¯
C

1
 Learn Practice Download

FAQs on De Morgan's Law

What Does De Morgan's Law in Sets State?

What is the Formula for De Morgan's Law?

What are the Two De Morgan's Laws in Sets?

What is De Morgan's Law in Boolean Algebra?

How to Prove De Morgan's Laws?

What is De Morgan's Law Truth Table?

How to Apply De Morgan's Law?

1
FOLLOW CUEMATH

Math worksheets and

visual curriculum

MATHS PROGRAM ABOUT US

Maths Program Our Mission

Online Tutors Our Journey

Our Team

MATHS WORKSHEETS
Year 1 Maths Worksheets MATHS TOPICS
Year 2 Maths Worksheets Numbers

Year 3 Maths Worksheets Algebra

Year 4 Maths Worksheets Geometry

Year 5 Maths Worksheets Measurement

Year 6 Maths Worksheets Commercial Maths

Year 7 Maths Worksheets Data

 Year 8 Maths Worksheets Trigonometry

Year 9 Maths Worksheets Calculus

Year 10 Maths Worksheets Maths Formulae

Learn Year 11 Maths Worksheets Practice Download Calculators

Multiplication Tables

INTERNATIONAL
United States QUICK LINKS
United Kingdom Maths Games

Canada Maths Puzzles

Dubai Maths Questions

Australia Blogs

France

Germany
CURRICULUM
Indonesia
Year 1 Maths
Italy
Year 2 Maths
Netherlands
Year 3 Maths
Sri Lanka
Year 4 Maths
Singapore
Year 5 Maths
Saudi Arabia
Year 6 Maths
Oman
Year 7 Maths
Bahrain
Year 8 Maths
Qatar
Year 9 Maths
Norway

Sweden

Ireland

Terms and Conditions Privacy Policy

Math worksheets and

visual curriculum