Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 1 - Section 1.3 - Propositional Equivalences - Exercises - Page 35: 26

Answer

See step by step work for solution

Work Step by Step

We start with $¬p→(q→r)$ Use Logical Equivalence twice: (p→q)≡(¬p∨q) $$¬p→(q→r)≡¬(¬p)∨(q→r)≡¬(¬p)∨(¬q∨r)$$Use Double Negation: $$≡p∨(¬q∨r)$$ Use Associative Law:$$(p∨¬q)∨r)$$ Use Commutative Law:$$(¬q∨p)∨r)$$ Use Associative Law:$$¬q∨(p∨r)$$ Use Logical Equivalence:(p→q)≡(¬p∨q) $$≡q\rightarrow (p∨r)$$ We have thus derived that $¬p→(q→r)$≡$q\rightarrow (p∨r)$.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.