A formula is in disjunctive normal form (DNF) when it is an or of terms, and each term is an and of letters and negated letters. Each term describes one way to make the formula true.
| Step | On | |
|---|---|---|
| 1 | Remove the arrows. Use material implication; split into two conditionals first.Material implication ↗ | |
| 2 | Push every negation onto a letter. Apply De Morgan's law, then cancel any .De Morgan's laws ↗ | |
| 3 | Distribute and over or. Multiply out as with two brackets in algebra: each term of the first bracket with each term of the second.Distributive laws ↗ | |
| 4 | Drop the impossible terms. A term with a letter and its negation is always F (non-contradiction) and disappears from an or; so do repeated terms. |