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: 24

Answer

See step by step work for solution

Work Step by Step

We start with $p→(q∨r)$ Use Logical Equivalence: $(p→q)≡(¬p∨q)$ $$p→(q∨r)≡¬p∨(q∨r)$$ Use Idempotent Law: $$≡(¬p∨¬p)∨(q∨r)$$ Use Associative and Commutative Law: $$≡(¬p∨q)∨(¬p∨r)$$ Use Logical Equivalence:$(p→q)≡(¬p∨q)$ $$≡(p\rightarrow q)∨(p\rightarrow r)$$ We have thus derived that $p→(q∨r) \equiv (p\rightarrow q)∨(p\rightarrow 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.