HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Earth and Environmental Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
Valid Arguments and Methods of Proof
  1. 1Validating statements and arguments
  2. 2Direct proof, contrapositive and counterexample
  3. 3Proof by contradiction and by cases
  1. Mathematics
  2. /Valid Arguments and Methods of Proof
  3. /Validating statements and arguments

Course 36.3·Lesson 1 of 3

Validating statements and arguments

To validate a statement is to show when it is true. An 'and' needs both parts, and an 'or' needs one part once the other is assumed false. An if-then can be shown directly, through the contrapositive or by contradiction, and an if-and-only-if needs both directions. An argument is valid when its conclusion is true in every row where all its premises are true; modus ponens and modus tollens are valid, while affirming the consequent is a fallacy.

about 25 min1 simulation1 practice question
Lesson 1 of 3Show all lessonsHide
Valid Arguments and Methods of Proof
  1. 1Validating statements and arguments
  2. 2Direct proof, contrapositive and counterexample
  3. 3Proof by contradiction and by cases

Try the code and the simulations beside the lesson.

What you will be able to do

  • validate a statement built with "and", "or", "if ... then" and "if and only if";
  • decide whether an argument is valid, with a truth table or a known form;
  • spot the two common fallacies.

What it takes to show a statement is true

A statement is valid (true) when we can show it with reasons. The connective tells us what to show.

  • ppp and qqq: show that ppp is true, and show that qqq is true.
  • ppp or qqq: assume ppp is false and show qqq is true. Or assume qqq is false and show ppp is true. This works because p∨q≡∼p⇒qp \vee q \equiv \sim p \Rightarrow qp∨q≡∼p⇒q.
  • If ppp then qqq: there are three ways. Assume ppp and show qqq (the direct method). Assume ∼q\sim q∼q and show ∼p\sim p∼p (the contrapositive method). Assume ppp and ∼q\sim q∼q together and reach something impossible (the method of contradiction).
  • ppp if and only if qqq: show "if ppp then qqq" and "if qqq then ppp".

The picture sums up the ways to deal with an if-then statement. The last row is for a claim about every case: one case with ppp true and qqq false is enough to make it false.

A flow chart of four methods of proof for a statement 'if p then q'. Direct: start from p, a chain of steps, end at q. Contrapositive: start from not q, a chain of steps, end at not p. Contradiction: start from p and not q together, a chain of steps, end at an impossible statement, then conclude that the statement is true. Counterexample: one case with p true and q false shows that a for-all claim is false.

Example. Validate "if xxx and yyy are odd integers, then xyxyxy is odd". Directly: write x=2m+1x = 2m + 1x=2m+1 and y=2n+1y = 2n + 1y=2n+1. Then

xy=4mn+2m+2n+1,\displaystyle xy = 4mn + 2m + 2n + 1,xy=4mn+2m+2n+1,
xy=2(2mn+m+n)+1,\displaystyle xy = 2(2mn + m + n) + 1,xy=2(2mn+m+n)+1,

which is odd. So the statement is true.

Arguments

An argument is a list of statements, the premises, followed by a conclusion.

  • Premise 1: if it rains, the match is cancelled.
  • Premise 2: it rains.
  • Conclusion: the match is cancelled.

An argument is valid when the conclusion is true in every case in which all the premises are true. In symbols, the argument with premises P1,…,PkP_1, \dots, P_kP1​,…,Pk​ and conclusion CCC is valid when

(P1∧⋯∧Pk)⇒C\displaystyle (P_1 \wedge \dots \wedge P_k) \Rightarrow C(P1​∧⋯∧Pk​)⇒C

is a tautology.

Valid does not mean true. "All fish can fly. A shark is a fish. So a shark can fly" is valid, but the first premise is false. A valid argument only promises a true conclusion when the premises are true.

Four valid forms

  • Modus ponens: p⇒qp \Rightarrow qp⇒q and ppp; so qqq.
  • Modus tollens: p⇒qp \Rightarrow qp⇒q and ∼q\sim q∼q; so ∼p\sim p∼p.
  • Chain rule (hypothetical syllogism): p⇒qp \Rightarrow qp⇒q and q⇒rq \Rightarrow rq⇒r; so p⇒rp \Rightarrow rp⇒r.
  • Disjunctive syllogism: p∨qp \vee qp∨q and ∼p\sim p∼p; so qqq.

Two fallacies

A fallacy is an argument that looks valid but is not.

  • Affirming the consequent: p⇒qp \Rightarrow qp⇒q and qqq; so ppp. If it rains, the ground is wet. The ground is wet. So it rained? No. A water tank may have leaked.
  • Denying the antecedent: p⇒qp \Rightarrow qp⇒q and ∼p\sim p∼p; so ∼q\sim q∼q. It did not rain. So the ground is dry? No, for the same reason.

To show an argument is a fallacy, give one row in which every premise is true and the conclusion is false. For affirming the consequent, that row is ppp false and qqq true.

Checking an argument with a truth table

Is this argument valid? Premises: p∨qp \vee qp∨q, ∼p\sim p∼p. Conclusion: qqq.

Go through the four rows of ppp, qqq and keep only the rows where both premises are true.

  1. T, T: ∼p\sim p∼p is F. Skip.
  2. T, F: ∼p\sim p∼p is F. Skip.
  3. F, T: both premises are T. The conclusion qqq is T.
  4. F, F: p∨qp \vee qp∨q is F. Skip.

The only row with true premises has a true conclusion, so the argument is valid.

Practise with new numbers

Try it in Python

The program checks an argument by going through every row. It prints any row in which all the premises are true and the conclusion is false. If there is none, the argument is valid.

Read it first. Then run it. Which of the two arguments is valid?

1. Add an argument for modus tollens and check it.

2. For the fallacy, look at the bad row the program prints. Say it in words about rain and a wet ground.

Common mistakes

  • Calling an argument invalid because its conclusion is false. Validity is about the form, not about the facts.
  • Affirming the consequent. From p⇒qp \Rightarrow qp⇒q and qqq nothing follows about ppp.
  • Validating an "or" by checking only the easy part. You must cover the case where that part fails.
  • Proving only one direction of an if-and-only-if.

Remember these

  • And: both parts. Or: assume one false, show the other. If-then: direct, contrapositive or contradiction. Iff: both directions.
  • An argument is valid when (premises) ⇒\Rightarrow⇒ (conclusion) is a tautology.
  • Modus ponens, modus tollens, the chain rule and disjunctive syllogism are valid.

Check yourself

Try each one on your own first. If you are stuck, open a hint. Then check with Show the answer.

  1. Premises: "If a shape is a square, it has four sides." "This shape has four sides." Conclusion: "This shape is a square." Is the argument valid?
  1. Which valid form gives "Ali did not pass" from "If Ali passed, Ali got a certificate" and "Ali did not get a certificate"?
  1. How do you validate "x≥0x \ge 0x≥0 or x2>0x^2 > 0x2>0" for a real number xxx?
  1. Is ((p⇒q)∧(q⇒r))⇒(p⇒r)((p \Rightarrow q) \wedge (q \Rightarrow r)) \Rightarrow (p \Rightarrow r)((p⇒q)∧(q⇒r))⇒(p⇒r) a tautology?
  1. A valid argument has a false conclusion. What must be true of its premises?

References

  • NCERT, Mathematics Textbook for Class XI (edition before 2023), Chapter 14, section 14.6, Validating statements.
  • OpenStax, Contemporary Mathematics, Chapter 2, section on logical arguments.

Enroll free in Valid Arguments and Methods of Proof

Every lesson is open to read. Enrolling also lets you:

  • Mark lessons done and carry on where you stopped.
  • Take the tests of this lesson and its course.
  • Count the course towards the certificate for its chapter.
No payment. You can leave at any time.

Problems (3)

Write each argument in symbols and decide whether it is valid…Hard · High School (11–12) · by StemPy Lab
Use truth tables to test two arguments in p, q and r…Advanced · High School (11–12) · by StemPy Lab
Validate the statement "for a real number x, x² - 5x + 6 = 0 if and only if x = 2 or x = 3"…Hard · High School (11–12) · by StemPy Lab
Next: lesson 2Direct proof, contrapositive and counterexample
← Valid Arguments and Methods of Proof
← PreviousDirect proof, contrapositive and counterexample →

Discussion (0)

Log in to join the discussion.

Loading…

1 Python program
5 questions to check yourself

This lesson is free to read. Enroll free to keep your place and take the tests.

Python Labs (1)

An argument checkerPython Lab · by StemPy Lab