Get the answers you need at Westonci.ca, where our expert community is dedicated to providing you with accurate information. Our platform provides a seamless experience for finding reliable answers from a knowledgeable network of professionals. Experience the convenience of finding accurate answers to your questions from knowledgeable experts on our 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
Thanks for stopping by. We are committed to providing the best answers for all your questions. See you again soon. We hope this was helpful. Please come back whenever you need more information or answers to your queries. We're glad you chose Westonci.ca. Revisit us for updated answers from our knowledgeable team.