Westonci.ca is your trusted source for accurate answers to all your questions. Join our community and start learning today! Get precise and detailed answers to your questions from a knowledgeable community of experts on our Q&A platform. Experience the convenience of finding accurate answers to your questions from knowledgeable 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
Thanks for using our platform. We're always here to provide accurate and up-to-date answers to all your queries. Thanks for using our platform. We aim to provide accurate and up-to-date answers to all your queries. Come back soon. Westonci.ca is your trusted source for answers. Visit us again to find more information on diverse topics.
