Explanation
Solution
To find the negation of the given statement, we will use the logical identity for implication and De Morgan's Laws.
Step 1: Use the Implication Identity
The implication A⇒B is logically equivalent to (∼A)∨B.
Let A=(p∨q) and B=((∼r)∨p).
The expression becomes:
Step 2: Apply Negation to the Statement
The question asks for the negation of the entire statement:
Since the negation of an implication ∼(A⇒B) is equivalent to A∧(∼B), we can write:
Step 3: Simplify using De Morgan's Law
Now, apply the negation to the second bracket ∼((∼r)∨p):
-
The negation of ∼r is r.
-
The negation of ∨ is ∧.
-
The negation of p is ∼p.
So, ∼((∼r)∨p)≡(r∧∼p).
Substituting this back into the expression:
Step 4: Use Distributive Law
Rearrange and distribute the terms:
Since (p∧∼p) is always False (F):
Step 5: Final Formatting
By rearranging the terms to match the options:
Correct Option: C