Welcome to Westonci.ca, where finding answers to your questions is made simple by our community of experts. Experience the ease of finding accurate answers to your questions from a knowledgeable community of professionals. Connect with a community of professionals ready to help you find accurate solutions to your questions quickly and efficiently.
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
We appreciate your visit. Our platform is always here to offer accurate and reliable answers. Return anytime. We hope you found what you were looking for. Feel free to revisit us for more answers and updated information. We're here to help at Westonci.ca. Keep visiting for the best answers to your questions.