Using De Morgans to reduce a boolean expression

Posted by ouverson on Jul 23, 2021; 2:27pm
URL: http://nand2tetris-questions-and-answers-forum.52.s1.nabble.com/Using-De-Morgans-to-reduce-a-boolean-expression-tp4036177.html

From the 2nd edition:

"Proof: According to De Morgan law, the Or operator can be expressed using the Not and And operators."

The disjunctive normal form (DNF) of the Or function:

(Not(a) And b) Or (a And (Not(b)) Or (a And b)

De Morgans:

Not(a Or b) = Not(a) And Not(b)

How would I apply De Morgans to reduce this expression using Not and And operators only?

P.S. If I could have asked this question in more accurate terms (or phrases) please let me know.