Truth conditions before intuition: implication, equivalence and valid mathematical arguments
JEE Main70 min study guide10 indexed sections
BY THE END, YOU CAN
Translate mathematical statements into precise logical forms.
Evaluate compound propositions and distinguish tautologies, contradictions and contingencies.
Use equivalent forms of implication, negation and biconditional statements.
Test argument validity and negate quantified statements without changing their scope.
BEFORE YOU START
Elementary examples involving integers, inequalities and divisibility.
The distinction between a statement and a variable-dependent condition.
Original educational lesson. Work through the examples before revealing the practice answers. Check the current official syllabus separately; historical question frequency does not establish eligibility or predict future questions.
CONNECT THE CONCEPT TO THE EXAM
Selected exam questions & worked solutions
These selected examples are separate from the original practice below. Each identifies its exam, year and wording. They do not represent every paper or every selected year.
No source-verified exam questions have been published for this lesson yet. The worked examples and practice below are original teaching material, not past-exam questions.
01 / UNDERSTAND & APPLY
1. A proposition has a definite truth value
A proposition is a declarative statement that is either true or false in the context being considered. Its truth value need not be known to the person reading it. A difficult unsolved mathematical assertion can still have the form of a proposition; ignorance of its truth is different from a sentence lacking a definite mathematical meaning.
Questions, commands and subjective evaluations are not propositions in this two-valued framework. The sentence “x is greater than 4” is an open predicate until x is specified or bound by a quantifier. Substituting x=6 produces a true proposition; quantifying “for every real x” produces a false one.
Letters such as p,q,r stand for complete propositions. A truth assignment chooses true or false for each letter. A compound proposition combines them using logical connectives whose truth conditions are defined precisely. Logic studies that structure independently of whether the component propositions discuss numbers, geometry or another subject.
When translating, keep an atomic statement intact unless its internal structure matters. For example, “n is divisible by 6” can be one atomic proposition p for a particular fixed integer n. If the task concerns all integers, the dependence on n must be retained as a predicate rather than forgotten.
02 / UNDERSTAND & APPLY
2. And, inclusive or, not and exclusive or
The negation ¬p reverses the truth value of p. The conjunction p∧q is true exactly when both components are true. The disjunction p∨q uses inclusive or: it is true when at least one component is true, including the case where both are true. Everyday “or” can be ambiguous, so state explicitly if exactly one alternative is intended.
Exclusive or, written here p⊕q, is true when exactly one of p,q is true. It can be expressed using the basic connectives as (p∨q)∧¬(p∧q). The distinction matters in counting truth assignments and in translating phrases such as “either, but not both.”
Parentheses determine the scope of each connective. The formula ¬(p∧q) negates the entire conjunction; (¬p)∧q negates only the first component. Although a standard precedence convention often places negation before conjunction before disjunction, explicit parentheses are safer in a complex expression.
A truth table lists all assignments once. For two independent atomic propositions there are four rows: TT, TF, FT and FF. For n atomic propositions there are 2ⁿ rows. Intermediate columns should follow the parentheses so that the final column is calculated from already evaluated parts.
ORIGINAL WORKED EXAMPLE
Evaluate scope instead of reading left to right
For p false, q true and r false, evaluate ¬(p∨r)∧q and ¬p∨(r∧q).
In the first expression, p∨r is false because both p and r are false. Its negation is true.
The remaining conjunction is true∧true, hence true.
In the second expression, ¬p is true and r∧q is false. Their disjunction is true.
Both expressions happen to be true for this assignment. They are not logically equivalent: when p,q,r are all false, the first expression is false because of its final conjunction with q, while the second is true because ¬p is true.
Answer Both are true for the stated assignment, but the all-false assignment proves they are not equivalent.
03 / UNDERSTAND & APPLY
3. Implication forbids one specific situation
The implication p→q is false only when p is true and q is false. It asserts that the situation p without q does not occur. Equivalently p→q is ¬p∨q. If p is false, the implication is true in material propositional logic regardless of q; this is often called vacuous truth.
This truth-functional definition does not claim that p causes q or that the two statements are related in ordinary language. Mathematical implication formalizes a guarantee conditional on its hypothesis. To disprove “every object with property p has property q,” one must exhibit an object with p true and q false.
In p→q, p is a sufficient condition for q, and q is a necessary condition for p. The phrase “p only if q” means p→q. The phrase “p if q” means q→p. Read “only if” as a required condition rather than following the left-to-right order of the English words mechanically.
The truth table in row order TT, TF, FT, FF is T,F,T,T. Keeping the single false row in mind is usually easier than memorizing four unrelated entries. It also gives the negation immediately: ¬(p→q) is p∧¬q, a true hypothesis together with a false conclusion.
ORIGINAL WORKED EXAMPLE
Necessary and sufficient conditions in arithmetic
For an integer n, translate “n is divisible by 12 only if n is divisible by 4.” Is divisibility by 4 sufficient for divisibility by 12?
Let p mean 12 divides n and q mean 4 divides n. The only-if statement is p→q.
If n=12k for an integer k, then n=4(3k), so the implication is true for every integer n.
Divisibility by 4 is necessary for divisibility by 12. Divisibility by 12 is sufficient for divisibility by 4.
The converse q→p is false: n=4 satisfies q but not p. Thus divisibility by 4 is not sufficient for divisibility by 12.
Answer p→q is true; q is necessary but not sufficient for p.
04 / UNDERSTAND & APPLY
4. Reverse and negate carefully
For an implication p→q, the converse is q→p, the inverse is ¬p→¬q, and the contrapositive is ¬q→¬p. The original and contrapositive are logically equivalent. The converse and inverse are logically equivalent to each other, but neither is generally equivalent to the original.
The equivalence with the contrapositive follows by rewriting both as disjunctions: p→q is ¬p∨q, while ¬q→¬p is q∨¬p. These have the same truth value by commutativity of or. This is why proving a contrapositive establishes the original theorem.
Do not confuse the inverse with the negation of an implication. The inverse remains an implication and can be true on many rows where the original is true. The actual negation p∧¬q identifies precisely the original implication’s false row.
In quantified mathematical claims, keep the domain unchanged when forming these related statements. For integers, the contrapositive of “if n² is even, then n is even” says “if n is odd, then n² is odd.” Here “not even” means odd because the domain is integers; that translation would not be valid over all real numbers.
ORIGINAL WORKED EXAMPLE
Classify four related statements by one counterexample
Starting with “if x>3, then x>1” on ℝ, write its converse, inverse and contrapositive and classify them.
The original is true because every real number above 3 is above 1.
The converse is “if x>1, then x>3.” It is false at x=2.
The inverse is “if x≤3, then x≤1.” It is also false at x=2.
The contrapositive is “if x≤1, then x≤3,” which is true and equivalent to the original. Notice that negating a strict inequality includes the equality case.
Answer Converse and inverse are false; original and contrapositive are true.
05 / UNDERSTAND & APPLY
5. Logical equivalence means agreement on every row
Two formulas are logically equivalent when their truth values agree for every assignment to their atomic propositions. A biconditional p↔q is a proposition that is true exactly when p and q have the same truth value. It is equivalent to (p→q)∧(q→p), so proving an if-and-only-if theorem requires both directions.
De Morgan’s laws state ¬(p∧q)≡¬p∨¬q and ¬(p∨q)≡¬p∧¬q. Negating “both” means at least one fails; negating “at least one” means both fail. Double negation gives ¬¬p≡p. These laws can be verified by four truth-table rows or by the precise meaning of and and or.
Distributivity works in both directions: p∧(q∨r)≡(p∧q)∨(p∧r), and p∨(q∧r)≡(p∨q)∧(p∨r). Absorption gives p∨(p∧q)≡p and p∧(p∨q)≡p. These can shorten a large truth-table calculation, provided each transformation is a valid equivalence.
Use ≡ here to state equivalence between formulas, while ↔ is a connective inside a formula. The formula P↔Q is a tautology exactly when P and Q are logically equivalent. This distinction separates saying “these expressions always agree” from evaluating a biconditional under one assignment.
ORIGINAL WORKED EXAMPLE
Simplify a nested implication without a large table
Simplify ¬(p→q)∨(p∧q).
Rewrite the negated implication using its single failure case: ¬(p→q)≡p∧¬q.
The expression becomes (p∧¬q)∨(p∧q).
Factor p by distributivity to obtain p∧(¬q∨q). The second factor is always true.
Therefore the expression is equivalent to p. If p is false both original disjuncts are false; if p is true, exactly one of q and ¬q makes a disjunct true.
Answer The expression is logically equivalent to p.
06 / UNDERSTAND & APPLY
6. Classify the final truth column
A tautology is true on every truth assignment. A contradiction is false on every assignment. A contingency is true on some assignments and false on others. For example p∨¬p is a tautology, p∧¬p is a contradiction, and p→q is a contingency because of its one false row.
Satisfiable means true on at least one assignment. Both tautologies and contingencies are satisfiable; contradictions are not. Two different formulas can have the same number of true rows without being equivalent, because their true rows may occur at different assignments.
To prove a tautology by a truth table, every row must be checked. To disprove tautology, one false row suffices. To disprove contradiction, one true row suffices. This difference suggests an efficient strategy: search for a decisive assignment before constructing a full large table.
When a compound formula contains an implication, its falsity is especially useful to analyze. Require the antecedent true and consequent false, then see whether those requirements can coexist. If they force a contradiction, the implication is a tautology.
ORIGINAL WORKED EXAMPLE
Prove a tautology by attempting its false row
Classify [(p→q)∧(q→r)]→(p→r).
For the outer implication to be false, both premises p→q and q→r must be true while p→r is false.
The latter falsity requires p=true and r=false.
Since p is true and p→q is true, q must be true. Since q is true and q→r is true, r must be true.
This contradicts r=false. Therefore no false row exists and the formula is a tautology. This is the logical basis of chaining implications.
Answer It is a tautology.
07 / UNDERSTAND & APPLY
7. Validity is about all assignments satisfying the premises
An argument with premises P₁,…,Pₖ and conclusion C is valid when every assignment making all premises true also makes C true. Equivalently, (P₁∧…∧Pₖ)→C is a tautology. Validity concerns the connection between premises and conclusion, not whether the premises are in fact true in an intended application.
Modus ponens uses p→q and p to infer q. Modus tollens uses p→q and ¬q to infer ¬p. Both are valid. Chaining p→q and q→r to infer p→r is also valid. Each rule can be justified by excluding the one false row of the relevant implication.
Affirming the consequent uses p→q and q to infer p; it is invalid. Denying the antecedent uses p→q and ¬p to infer ¬q; it is also invalid. The assignment p=false,q=true makes all premises true and the conclusion false in each of these two argument patterns.
An argument with mutually inconsistent premises is valid in this truth-functional sense because no assignment makes all premises true. That does not make it a useful explanation of reality. A sound argument is valid and has true premises; these are separate requirements that should be checked separately.
ORIGINAL WORKED EXAMPLE
Find a counterassignment rather than debating plausibility
Test the argument: p→q, r→q, q; therefore p∨r.
To invalidate it, seek true premises and a false conclusion. A false p∨r requires p=false and r=false.
Set q=true. Then both p→q and r→q are true, and the third premise q is true.
The conclusion p∨r remains false. Thus this assignment is an explicit counterexample to validity.
Knowing that either condition would guarantee q does not mean those are the only possible ways q could be true.
Answer Invalid; p=false, q=true, r=false is a counterassignment.
08 / UNDERSTAND & APPLY
8. Quantifiers extend the same discipline to predicates
A predicate P(x) depends on a variable in a specified domain. The universal statement ∀x P(x) claims that every allowed x satisfies it. The existential statement ∃x P(x) claims that at least one allowed x satisfies it. A counterexample disproves a universal claim, while one witness proves an existential claim.
Negation exchanges the quantifiers and negates the predicate: ¬∀x P(x) is equivalent to ∃x ¬P(x), and ¬∃x P(x) is equivalent to ∀x ¬P(x). “Not every” means at least one exception, not that every case fails. “There is no” means every possible candidate fails.
Quantifier order can matter. Over ℝ, ∀x∃y(y>x) is true because y=x+1 can depend on x. The reversed ∃y∀x(y>x) is false because no one real y exceeds every real x. When negating multiple quantifiers, change each in place without reordering them.
The domain also matters at its boundaries. The statement ∀x∈∅ P(x) is true vacuously, while ∃x∈∅ P(x) is false. In elementary number examples, be explicit about whether zero is included in the natural numbers, or use positive integers when that is the intended domain.
ORIGINAL WORKED EXAMPLE
Negate a universal implication with the correct witness
Negate “For every real x, if x²>4 then x>2,” and determine the original truth value.
Write the original as ∀x∈ℝ (x²>4→x>2).
Negating the universal quantifier produces an existential statement. Negating the implication gives its antecedent and the negation of its consequent.
The negation is: there exists a real x with x²>4 and x≤2.
The witness x=−3 satisfies 9>4 and −3≤2. Thus the negation is true and the original universal statement is false.
Answer Negation: ∃x∈ℝ with x²>4 and x≤2; the original is false.
09 / UNDERSTAND & APPLY
9. Original practice with explanations
Use truth assignments for propositional formulas and domain-respecting witnesses for quantified statements. A correct label should be accompanied by the reason that settles it.
ORIGINAL PRACTICE · 1
Is “x²=4” by itself a proposition when x is an unspecified real variable?
Reveal answer & reasoning
It is an open predicate, not yet a proposition.
Its truth depends on x. Specifying x or adding a quantifier turns it into a statement with a definite truth value.
ORIGINAL PRACTICE · 2
Evaluate p→q when p is false and q is false.
Reveal answer & reasoning
True.
An implication is false only when the antecedent is true and the consequent false. This row does not meet that condition.
ORIGINAL PRACTICE · 3
Negate p∨(q∧r).
Reveal answer & reasoning
¬p∧(¬q∨¬r).
Apply De Morgan first to the outer disjunction, then to the inner conjunction. Parentheses preserve the scope.
ORIGINAL PRACTICE · 4
Write the contrapositive of “if n is divisible by 8, then n is even” for integer n.
Reveal answer & reasoning
If n is not even, then n is not divisible by 8.
Reverse the implication and negate both components. On integers “not even” may also be written “odd.”
ORIGINAL PRACTICE · 5
Is (p→q)∨(q→p) a tautology?
Reveal answer & reasoning
Yes.
Both implications cannot be false simultaneously: the first would require p true,q false, while the second requires q true,p false.
ORIGINAL PRACTICE · 6
Is (p→q)∧(q→p) a tautology?
Reveal answer & reasoning
No; it is a contingency equivalent to p↔q.
It is true when p and q agree and false when they differ, so it has both true and false rows.
ORIGINAL PRACTICE · 7
Simplify (p∨q)∧(p∨¬q).
Reveal answer & reasoning
p.
Distributivity gives p∨(q∧¬q). The second term is false, leaving p.
ORIGINAL PRACTICE · 8
Test the argument p∨q, ¬p; therefore q.
Reveal answer & reasoning
Valid.
The disjunction requires at least one true component. Since p is false, q must be true whenever both premises hold.
ORIGINAL PRACTICE · 9
Negate “Every positive integer has an integer square root.”
Reveal answer & reasoning
Some positive integer has no integer square root.
Negation changes “every” to “some” and negates the existence of an integer root. For example, 2 supplies a counterexample to the original.
ORIGINAL PRACTICE · 10
Negate ∀x∈ℝ∃y∈ℝ (y>x).
Reveal answer & reasoning
∃x∈ℝ∀y∈ℝ (y≤x).
Switch each quantifier in its original order and negate y>x to y≤x. The negation is false over ℝ.
ORIGINAL PRACTICE · 11
How many truth assignments make (p∨q)∧r true?
Reveal answer & reasoning
3.
The value r must be true. The pair (p,q) may be TT,TF or FT, giving three assignments among the eight total.
ORIGINAL PRACTICE · 12
Give a counterassignment to the argument p→q, ¬p; therefore ¬q.
Reveal answer & reasoning
p=false and q=true.
The implication and ¬p are true, but ¬q is false. This is the fallacy of denying the antecedent.
10 / UNDERSTAND & APPLY
10. Translate, preserve scope, then test
First identify the complete atomic propositions and the domain of any variables. Translate only if, if, every, some and exactly one carefully. Insert parentheses before calculating; a negation must have a clearly defined scope.
For implication, remember the sole forbidden case: a true hypothesis with a false conclusion. The contrapositive preserves that forbidden case, whereas the converse generally changes it. A biconditional requires both directions, and an argument requires its conclusion on every assignment satisfying all premises.
To establish a universal logical claim, use a complete truth table or a chain of valid equivalences. To refute one, seek a single decisive counterassignment. For quantified mathematical statements, a counterexample must lie in the declared domain and violate precisely the claimed condition.
Do not substitute plausibility, causal language or agreement on a few examples for validity. The strength of symbolic logic is that it makes the required test explicit: which assignments, objects or witnesses would make the claim fail, and have those possibilities genuinely been excluded?
KEEP THE BIG IDEAS
Quick revision
Implication is false only for a true antecedent and false consequent.
An implication is equivalent to its contrapositive, not generally to its converse.
Logical equivalence requires agreement on every truth assignment.
An argument is invalid exactly when true premises can coexist with a false conclusion.
Negating a quantified statement switches each quantifier and preserves their order.
The teaching notes, worked explanations and original practice are written for this lesson. Separately labeled selected exam questions identify their exam, year, source and whether wording is paraphrased or an exact excerpt. Educational references do not certify current exam coverage.