Discover answers to your questions with Westonci.ca, the leading Q&A platform that connects you with knowledgeable experts. Get detailed and accurate answers to your questions from a community of experts on our comprehensive Q&A platform. Join our platform to connect with experts ready to provide precise answers to your questions in different areas.
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 useful. Return anytime for more information and answers to any other questions you have. We hope you found what you were looking for. Feel free to revisit us for more answers and updated information. Find reliable answers at Westonci.ca. Visit us again for the latest updates and expert advice.
