We have the compound statement
((P∨Q)∧(∼P))⇒Q.
First we recall the basic logical equivalence for an implication:
A⇒B≡∼A∨B.
Here,
A=(P∨Q)∧(∼P)andB=Q.
Applying the rule we obtain
((P∨Q)∧(∼P))⇒Q≡∼((P∨Q)∧(∼P))∨Q.
Now we remove the negation inside by using De Morgan’s law:
∼(X∧Y)≡∼X∨∼Y.
So, with
X=(P∨Q)andY=(∼P),
we have
∼((P∨Q)∧(∼P))=(∼(P∨Q))∨(∼(∼P))=(∼P∧∼Q)∨P.
The expression therefore becomes
((∼P∧∼Q)∨P)∨Q.
The associative and commutative laws of ∨ allow us to regroup and reorder the disjunction:
((∼P∧∼Q)∨P)∨Q=P∨Q∨(∼P∧∼Q).
Next we distribute ∨ over ∧ to simplify the mixed term:
P∨Q∨(∼P∧∼Q)=(P∨Q)∨(∼P∧∼Q)=(P∨Q∨∼P)∧(P∨Q∨∼Q).
Each of the two factors contains a full pair of complementary literals:
P∨∼P=T,Q∨∼Q=T.
Hence both brackets reduce to T (truth), and we are left with
T∧T=T.
Thus the given compound statement is a tautology; it is always true for every possible truth-value assignment to P and Q.
Among the provided options, Option D is
∼(P⇒Q)⇔P∧∼Q,
which is itself a biconditional connecting two logically equivalent expressions (since ∼(P⇒Q)≡P∧∼Q). A biconditional between two identical propositions is also a tautology, i.e. it is always true. Therefore the original statement and Option D are equivalent.
Hence, the correct answer is Option 4.