**DeMorgan's laws** are a collection of replacement rules for propositional logic that state that the negation of the conjunction of any two propositions is logically equivalent to the disjunction of the negations of those two propositions. They also state that the negation of the disjunction of any two propositions is logically equivalent to the conjunction of the negations of those propositions^{[1]}^{[2]} In symbols:

In set theory, it is the rule that the complement of the union of any two sets is equal to the intersection of the complements of those two sets^{[3]}. Also, they state that the complement of the intersection of any two sets is equal to the union of the complements of those sets. In symbols:

## ReferencesEdit

- ↑ DeMorgan's Laws. Whitman College. Web. 4 April 2017. <https://www.whitman.edu/mathematics/higher_math_online/section01.03.html>
- ↑ DeMorgan's laws { Philosophy Index }. Philosophy Index.Web.4 April 2017. <http://www.philosophy-index.com/logic/forms/de-morgan-laws.php>
- ↑ Weisstein, Eric W. "de Morgan's Laws." From MathWorld -- A Wolfram Web Resource. Wolfram Research, Inc. Web. 4 April 2017. <http://mathworld.wolfram.com/deMorgansLaws.html>

**Rules of inference**

Modus Ponens | Modus Tollens | Disjunctive Syllogism | Hypothetical Syllogism | Conjunction Introduction | Conjunction Elimination | Disjunction Introduction | Disjunction Elimination | Bicondional Introduction | Biconditional Elimination | Constructive Dilemma | Destructive Dilemma | Absorption | Modus ponendo tollens

**Rules of Transformation**

Double Negation | Associative property | Commutative property | Distributive property | **DeMorgan's Laws** | Tautology | Exportation | Material Implication | Transposition

**Concepts**

Set theory, Set, Element, Subset, Equality, Empty Set, Enumeration, Function, Ordered pair, Uncountable set, Extensionality, Finite set, Domain, Codomain, Image, **DeMorgan's Laws**