We begin with the given statement of implication
(p∨r)⇒(q∨r).
First, we recall the logical equivalence that an implication A⇒B can be rewritten as ∼A∨B. Stating this clearly:
A⇒Bis equivalent to∼A∨B.
Here, the role of A is played by (p∨r) and the role of B is played by (q∨r). Applying the formula gives
(p∨r)⇒(q∨r)≡∼(p∨r)∨(q∨r).
Now we want the negation of the entire implication. So we place a negation sign in front of the whole expression we just obtained:
∼[(p∨r)⇒(q∨r)]=∼[∼(p∨r)∨(q∨r)].
Next, we use De Morgan’s law, which states that the negation of a disjunction is the conjunction of the negations:
∼(A∨B)≡∼A∧∼B.
Applying this law with A=∼(p∨r) and B=(q∨r), we get
∼[∼(p∨r)∨(q∨r)]=[∼(∼(p∨r))]∧[∼(q∨r)].
Simplify each part separately. First, note that the double negation law tells us ∼(∼X)=X. Therefore,
∼(∼(p∨r))=(p∨r).
For the second part, we again apply De Morgan’s law:
∼(q∨r)=(∼q)∧(∼r).
Substituting these simplified pieces back, the negation becomes
(p∨r)∧[(∼q)∧(∼r)].
Associativity of ∧ allows us to drop parentheses inside the conjunction, giving
(p∨r)∧∼q∧∼r.
Now we must distribute (p∨r) over the other conjunctive factors. Using the distributive property
(X∨Y)∧Z≡(X∧Z)∨(Y∧Z),
with X=p,Y=r,Z=(∼q∧∼r), we have
(p∨r)∧∼q∧∼r=[p∧(∼q)∧(∼r)]∨[r∧(∼q)∧(∼r)].
Observe that the second term contains the factor (r∧∼r), which is always false. Hence that entire term vanishes, leaving only
p∧∼q∧∼r.
Thus, the negation of (p∨r)⇒(q∨r) simplifies completely to
p∧∼q∧∼r.
Comparing with the options provided, this matches Option C.
Hence, the correct answer is Option C.