The proposition is equivalent to:
We begin with the given compound proposition
Our goal is to simplify it step by step, using the standard Boolean algebra (logical algebra) identities. The symbols have their usual meanings: denotes negation, denotes disjunction (OR), and denotes conjunction (AND).
First, we recall the distributive law of logic, stated as
Here we can identify and Substituting these into the distributive law, we obtain
Next, notice that the expression is a tautology because a statement OR its negation is always true. Symbolically,
When we have a conjunction in which one of the factors is the tautology, the whole conjunction reduces to the other factor. That is, Therefore,
So we have shown
Now we recognize another standard logical equivalence: the implication form. The implication
is, by definition, equivalent to the disjunction
Since we have just derived the very same disjunction, it follows directly that
Thus, the original proposition is logically equivalent to the implication which corresponds to Option A.
Hence, the correct answer is Option A.
Tagged Logical connectives, truth tables and tautologies. Machine-assigned, so read it as a strong shortlist rather than a verdict.