RankRizz
JEE MAIN 2021 · 31 AUG S2+4 / −1EASYTRANSCRIBED

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

Negation of the statement (p∨r)⇒(q∨r)(p \vee r) \Rightarrow (q \vee r) is:

SOLUTION

We begin with the given statement of implication

(p∨r)⇒(q∨r).(p \vee r) \Rightarrow (q \vee r).

First, we recall the logical equivalence that an implication A⇒BA \Rightarrow B can be rewritten as ∼A ∨ B.\sim A \,\vee\, B. Stating this clearly:

A⇒B    is equivalent to    ∼A∨B.A \Rightarrow B \;\; \text{is equivalent to} \;\; \sim A \vee B.

Here, the role of AA is played by (p∨r)(p \vee r) and the role of BB is played by (q∨r).(q \vee r). Applying the formula gives

(p∨r)⇒(q∨r)    ≡    ∼(p∨r) ∨ (q∨r).(p \vee r) \Rightarrow (q \vee r) \;\; \equiv \;\; \sim(p \vee r) \,\vee\, (q \vee r).

Now we want the negation of the entire implication. So we place a negation sign in front of the whole expression we just obtained:

∼ ⁣[(p∨r)⇒(q∨r)]  =  ∼ ⁣[  ∼(p∨r) ∨ (q∨r)].\sim\!\bigl[(p \vee r) \Rightarrow (q \vee r)\bigr] \;=\; \sim\!\bigl[\;\sim(p \vee r) \,\vee\, (q \vee r)\bigr].

Next, we use De Morgan’s law, which states that the negation of a disjunction is the conjunction of the negations:

∼(A∨B)  ≡  ∼A ∧ ∼B.\sim(A \vee B) \;\equiv\; \sim A \,\wedge\, \sim B.

Applying this law with A=∼(p∨r)A = \sim(p \vee r) and B=(q∨r),B = (q \vee r), we get

∼ ⁣[  ∼(p∨r) ∨ (q∨r)]  =  [  ∼ ⁣(∼(p∨r))] ∧ [  ∼(q∨r)].\sim\!\bigl[\;\sim(p \vee r) \,\vee\, (q \vee r)\bigr] \;=\; \bigl[\;\sim\!\bigl(\sim(p \vee r)\bigr)\bigr] \,\wedge\, \bigl[\;\sim(q \vee r)\bigr].

Simplify each part separately. First, note that the double negation law tells us ∼(∼X)=X.\sim(\sim X) = X. Therefore,

∼ ⁣( ∼(p∨r))  =  (p∨r).\sim\!\bigl(\,\sim(p \vee r)\bigr) \;=\; (p \vee r).

For the second part, we again apply De Morgan’s law:

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

Substituting these simplified pieces back, the negation becomes

(p∨r) ∧ [(∼q)∧(∼r)].(p \vee r) \,\wedge\, \bigl[(\sim q) \wedge (\sim r)\bigr].

Associativity of ∧\wedge allows us to drop parentheses inside the conjunction, giving

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

Now we must distribute (p∨r)(p \vee r) over the other conjunctive factors. Using the distributive property (X∨Y) ∧ Z  ≡  (X∧Z)∨(Y∧Z),(X \vee Y)\,\wedge\,Z \;\equiv\; (X \wedge Z) \vee (Y \wedge Z), with X=p,  Y=r,  Z=(∼q∧∼r),X = p,\; Y = r,\; Z = (\sim q \wedge \sim r), we have

(p∨r) ∧ ∼q ∧ ∼r  =  [p∧(∼q)∧(∼r)]  ∨  [r∧(∼q)∧(∼r)].(p \vee r) \,\wedge\, \sim q \,\wedge\, \sim r \;=\; \bigl[p \wedge (\sim q) \wedge (\sim r)\bigr] \;\vee\; \bigl[r \wedge (\sim q) \wedge (\sim r)\bigr].

Observe that the second term contains the factor (r∧∼r),(r \wedge \sim r), which is always false. Hence that entire term vanishes, leaving only

p ∧ ∼q ∧ ∼r.p \,\wedge\, \sim q \,\wedge\, \sim r.

Thus, the negation of (p∨r)⇒(q∨r)(p \vee r) \Rightarrow (q \vee r) simplifies completely to

p∧∼q∧∼r.p \wedge \sim q \wedge \sim r.

Comparing with the options provided, this matches Option C.

Hence, the correct answer is Option C.

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