Welcome to Westonci.ca, the ultimate question and answer platform. Get expert answers to your questions quickly and accurately. Join our Q&A platform to connect with experts dedicated to providing precise answers to your questions in different areas. Get immediate and reliable solutions to your questions from a community of experienced professionals 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. We hope you found what you were looking for. Feel free to revisit us for more answers and updated information. We're glad you chose Westonci.ca. Revisit us for updated answers from our knowledgeable team.