Explore Westonci.ca, the leading Q&A site where experts provide accurate and helpful answers to all your questions. Experience the ease of finding accurate answers to your questions from a knowledgeable community of professionals. Get quick and reliable solutions to your questions from a community of experienced experts on our platform.
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
We hope our answers were helpful. Return anytime for more information and answers to any other questions you may have. Thank you for your visit. We're dedicated to helping you find the information you need, whenever you need it. We're dedicated to helping you find the answers you need at Westonci.ca. Don't hesitate to return for more.
