Westonci.ca connects you with experts who provide insightful answers to your questions. Join us today and start learning! Discover in-depth answers to your questions from a wide network of experts on our user-friendly Q&A platform. Our platform offers a seamless experience for finding reliable answers from a network of knowledgeable professionals.
Sagot :
we proved that (p ∨ q) ∨ (p ∨ r) ⇒ ¬r → (p ∨ q)
given assertion is
(p v q) v ( p v r ) and we have to prove that
(p ∨ q) ∨ (p ∨ r) ⇒ ¬r → (p ∨ q)
we use addition property on Right hand side
(p v q) -> (p v q) v r
now we are using commutativity property
(p v q) -> r v (p v q)
(p v r) -> q v (p v r) addition
(p v r) -> (q v p) v r associativity
(p v r) -> (p v q) v r commutativity
(p v r) -> r v (p v q) commutativity
r v (p v q )
¬ ¬r v ( p v q) double negation
¬ r -> (p v q ) implication
Hence we proved that (p ∨ q) ∨ (p ∨ r) ⇒ ¬r → (p ∨ q)
learn more about of associativity here
https://brainly.com/question/24191420
#SPJ4
Thank you for trusting us with your questions. We're here to help you find accurate answers quickly and efficiently. Thank you for visiting. Our goal is to provide the most accurate answers for all your informational needs. Come back soon. Your questions are important to us at Westonci.ca. Visit again for expert answers and reliable information.
