For any two statement and , the negative of the expression is:
We begin with the given propositional expression
Our task is to find the negation and then match it with the choices. To do this comfortably, it is convenient first to simplify itself.
We recall the distributive law of propositional logic, stated as
Comparing, we see Substituting we obtain
Now, for any statement , the expression is always true; it is a tautology. We may therefore replace it by the propositional constant T (True):
The conjunction of a tautology with any statement leaves that statement unchanged, because T acts like the multiplicative identity in logic. Hence
Having reduced the original expression to we now negate it. For this we invoke De Morgan’s law, which states
Applying the law directly with and we get
This final form exactly matches Option C in the list.
Hence, the correct answer is Option C.
Tagged Logical connectives, truth tables and tautologies. Machine-assigned, so read it as a strong shortlist rather than a verdict.