RankRizz
JEE MAIN 2021 · 27 AUG S1+4 / −1EASYTRANSCRIBED

JEE Main 2021 Mathematics question — Logical connectives, truth tables and tautologies

The statement (p∧(p→q)∧(q→r))→r(p \wedge (p \rightarrow q) \wedge (q \rightarrow r)) \rightarrow r is

SOLUTION

We have to inspect the compound statement (p∧(p→q)∧(q→r))→r\bigl(p \wedge (p \rightarrow q) \wedge (q \rightarrow r)\bigr) \rightarrow r and decide whether it is always true (a tautology), always false (a fallacy), or equivalent to some simpler implication.

First of all, recall the standard equivalence for an implication:

x→y    is logically equal to    ∼x∨y.x \rightarrow y \;\;\text{is logically equal to}\;\; \sim x \vee y.

Using this rule, we rewrite each implication inside the larger expression.

p→q≡∼p∨q,p \rightarrow q \equiv \sim p \vee q,

q→r≡∼q∨r.q \rightarrow r \equiv \sim q \vee r.

Substituting these into the original statement gives

(p∧(∼p∨q)∧(∼q∨r))→r.\Bigl(p \wedge (\sim p \vee q) \wedge (\sim q \vee r)\Bigr) \rightarrow r.

Let us now simplify the conjunction in the antecedent, step by step.

First combine the first two factors:

p∧(∼p∨q)=(p∧∼p)∨(p∧q).p \wedge (\sim p \vee q) = (p \wedge \sim p) \vee (p \wedge q).

But p∧∼pp \wedge \sim p is a contradiction, hence equal to false. So

(p∧∼p)∨(p∧q)=false∨(p∧q)=p∧q.(p \wedge \sim p) \vee (p \wedge q) = \text{false} \vee (p \wedge q) = p \wedge q.

Thus the antecedent has now become

(p∧q)∧(∼q∨r).(p \wedge q) \wedge (\sim q \vee r).

We keep going. Group the last two factors:

q∧(∼q∨r)=(q∧∼q)∨(q∧r).q \wedge (\sim q \vee r) = (q \wedge \sim q) \vee (q \wedge r).

Again q∧∼qq \wedge \sim q is a contradiction, so this reduces to

(q∧∼q)∨(q∧r)=false∨(q∧r)=q∧r.(q \wedge \sim q) \vee (q \wedge r) = \text{false} \vee (q \wedge r) = q \wedge r.

Hence the whole antecedent simplifies neatly to

p∧(q∧r)=p∧q∧r.p \wedge (q \wedge r) = p \wedge q \wedge r.

The complete statement is therefore

(p∧q∧r)→r.(p \wedge q \wedge r) \rightarrow r.

Apply the implication equivalence once more:

(p∧q∧r)→r≡∼(p∧q∧r)∨r.(p \wedge q \wedge r) \rightarrow r \equiv \sim(p \wedge q \wedge r) \vee r.

By De Morgan’s law,

∼(p∧q∧r)=∼p∨∼q∨∼r.\sim(p \wedge q \wedge r) = \sim p \vee \sim q \vee \sim r.

So the entire disjunction becomes

(∼p∨∼q∨∼r)∨r.\bigl(\sim p \vee \sim q \vee \sim r\bigr) \vee r.

Now observe that ∼r∨r\sim r \vee r is a tautology (it is always true). Because that tautology is one of the disjuncts, the whole expression is invariably true, no matter what truth-values p,q,p, q, and rr may take.

Therefore the original statement is always true; that is, it is a tautology.

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.

TopicLogical connectives, truth tables and tautologies
TypeMultiple choice