Welcome to Westonci.ca, your go-to destination for finding answers to all your questions. Join our expert community today! Get detailed and accurate answers to your questions from a dedicated community of experts on our Q&A platform. Get precise and detailed answers to your questions from a knowledgeable community of experts on our Q&A platform.
Sagot :
Any implication is logically equivalent to its contrapositive. In other words,
¬p ⇒ q ⇔ ¬q ⇒ p
(¬ means the same thing as ~, "not")
To prove this: recall that
p ⇒ q ⇔ ¬p ∨ q
This is because p ⇒ q is true if p is false, or both p and q are true, i.e.
p ⇒ q ⇔ ¬p ∨ (p ∧ q)
Disjunction (∨ or "or") distributes over conjunction (∧ or "and"), so that
p ⇒ q ⇔ (¬p ∨ p) ∧ (¬p ∨ q)
but ¬p ∨ p is always true, or a tautology, so we're just left with ¬p ∨ q.
Then
¬p ⇒ q ⇔ p ∨ q
… ⇔ q ∨ p
… ⇔ ¬(¬q) ∨ p
… ⇔ ¬q ⇒ p
Thank you for choosing our platform. We're dedicated to providing the best answers for all your questions. Visit us again. Thanks for using our platform. We aim to provide accurate and up-to-date answers to all your queries. Come back soon. Thank you for visiting Westonci.ca. Stay informed by coming back for more detailed answers.