RankRizz
JEE MAIN 2017 · 02 APR OFFLINE+4 / −1EASYTRANSCRIBED

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

The statement p→q→(∼p→q→q)p \to q \to (\sim p \to q \to q) is

SOLUTION

We have the propositional statement

p  →  q  →  ( ∼p  →  q  →  q ).p \;\rightarrow\; q \;\rightarrow\; (\,\sim p \;\rightarrow\; q \;\rightarrow\; q\,).

The implication sign →\rightarrow is taken to be right-associative, so an expression like a→b→ca \rightarrow b \rightarrow c is interpreted as a→( b→c ).a \rightarrow (\,b \rightarrow c\,). Using this convention, our statement can be rewritten (placing all invisible parentheses explicitly) as

p  →  ( q  →  ( (∼p)  →  ( q  →  q ))).p \;\rightarrow\; \bigl(\,q \;\rightarrow\; \bigl(\,(\sim p) \;\rightarrow\; (\,q \;\rightarrow\; q\,)\bigr)\bigr).

Now we proceed from the innermost part and gradually simplify.

First, consider the sub-statement q  →  q.q \;\rightarrow\; q.

• By the truth table for implication, a statement of the form A→AA \rightarrow A is always true, because:   • If AA is true, then A→AA \rightarrow A has true antecedent and true consequent, so it is true.
  • If AA is false, then A→AA \rightarrow A has false antecedent, and an implication with a false antecedent is true.
Hence

q  →  q≡T,q \;\rightarrow\; q \equiv \text{T},

where “T” denotes the truth constant “always true”.

Substituting this result into the expression, we obtain

p  →  ( q  →  ( (∼p)  →  T)).p \;\rightarrow\; \bigl(\,q \;\rightarrow\; \bigl(\,(\sim p) \;\rightarrow\; \text{T}\bigr)\bigr).

Next, look at the part (∼p)  →  T.(\sim p) \;\rightarrow\; \text{T}.

• A basic property of implication is: a statement of the form A→TA \rightarrow \text{T} is always true, because its consequent is true regardless of AA. Therefore

(∼p)  →  T≡T.(\sim p) \;\rightarrow\; \text{T} \equiv \text{T}.

Replacing this with “T”, the larger expression simplifies to

p  →  ( q  →  T).p \;\rightarrow\; \bigl(\,q \;\rightarrow\; \text{T}\bigr).

Again apply the same rule to q  →  Tq \;\rightarrow\; \text{T}: since the consequent is “T”, we have

q  →  T≡T.q \;\rightarrow\; \text{T} \equiv \text{T}.

This leaves the outermost implication:

p  →  T.p \;\rightarrow\; \text{T}.

And finally, by the very same principle, any implication whose consequent is “T” is itself always true, so

p  →  T≡T.p \;\rightarrow\; \text{T} \equiv \text{T}.

Thus every possible truth-value assignment to pp and qq makes the given statement true. Therefore the original statement 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