RankRizz
JEE MAIN 2013 · 22 APR ONLINE+4 / −1MEDIUMTRANSCRIBED

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

The statement p→(q→p)p \rightarrow (q \rightarrow p) is equivalent to :

SOLUTION

We are given the statement p→(q→p)p \rightarrow (q \rightarrow p) and need to find which option it is equivalent to. Recall that the implication a→ba \rightarrow b is logically equivalent to ¬a∨b\neg a \vee b. We will use this equivalence to simplify the given statement step by step.

First, consider the inner implication q→pq \rightarrow p. Using the equivalence, we rewrite it as ¬q∨p\neg q \vee p. So the entire statement becomes:

p→(¬q∨p)p \rightarrow (\neg q \vee p)

Now, apply the equivalence to the outer implication p→(¬q∨p)p \rightarrow (\neg q \vee p). This becomes:

¬p∨(¬q∨p)\neg p \vee (\neg q \vee p)

Disjunction (OR) is associative, meaning we can regroup the terms without changing the meaning. So we write:

(¬p∨p)∨¬q(\neg p \vee p) \vee \neg q

Notice that ¬p∨p\neg p \vee p is a tautology, meaning it is always true, regardless of the truth value of pp. Therefore:

¬p∨p=true\neg p \vee p = \text{true}

Substituting this, we get:

true∨¬q\text{true} \vee \neg q

The disjunction of true and any statement is always true. So:

true∨¬q=true\text{true} \vee \neg q = \text{true}

Thus, the original statement p→(q→p)p \rightarrow (q \rightarrow p) simplifies to true, meaning it is a tautology (always true).

Now, we check each option to see which one is also a tautology and equivalent to true.

Option A: p→qp \rightarrow q

Rewrite using equivalence:

¬p∨q\neg p \vee q

This is not always true. For example, when pp is true and qq is false, ¬p∨q=false∨false=false\neg p \vee q = \text{false} \vee \text{false} = \text{false}. So it is not a tautology and not equivalent to the original statement.

Option B: p→(p∨q)p \rightarrow (p \vee q)

Rewrite using equivalence:

¬p∨(p∨q)\neg p \vee (p \vee q)

Associativity allows regrouping:

(¬p∨p)∨q(\neg p \vee p) \vee q

Again, ¬p∨p=true\neg p \vee p = \text{true}, so:

true∨q=true\text{true} \vee q = \text{true}

This is a tautology. Therefore, it is equivalent to the original statement.

Option C: p→(p→q)p \rightarrow (p \rightarrow q)

First, rewrite the inner implication p→qp \rightarrow q as ¬p∨q\neg p \vee q. So the statement becomes:

p→(¬p∨q)p \rightarrow (\neg p \vee q)

Apply equivalence to the outer implication:

¬p∨(¬p∨q)\neg p \vee (\neg p \vee q)

Associativity and idempotence (since ¬p∨¬p=¬p\neg p \vee \neg p = \neg p):

(¬p∨¬p)∨q=¬p∨q(\neg p \vee \neg p) \vee q = \neg p \vee q

This is ¬p∨q\neg p \vee q, which is the same as p→qp \rightarrow q. As in Option A, this is not a tautology (e.g., false when pp is true and qq is false). So it is not equivalent to the original statement.

Option D: p→(p∧q)p \rightarrow (p \wedge q)

Rewrite using equivalence:

¬p∨(p∧q)\neg p \vee (p \wedge q)

Distribute ∨\vee over ∧\wedge:

(¬p∨p)∧(¬p∨q)(\neg p \vee p) \wedge (\neg p \vee q)

Now, ¬p∨p=true\neg p \vee p = \text{true}, so:

true∧(¬p∨q)=¬p∨q\text{true} \wedge (\neg p \vee q) = \neg p \vee q

Again, this is ¬p∨q\neg p \vee q, same as p→qp \rightarrow q, which is not a tautology. So it is not equivalent to the original statement.

Only Option B simplifies to true, making it a tautology and equivalent to the original statement p→(q→p)p \rightarrow (q \rightarrow p).

Hence, the correct answer is Option B.

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