FineuralabA deeper understanding. A more capable you.
Skip to lesson

13 / 18 · Account for every step

A proof is a chain of permissions

Justify short natural-deduction steps using stated premises and rules.

Builds on Everyone has one, or one for everyone?

Go to practice ↓

A question to keep in mind

A conclusion feels obvious. Can you show the exact steps that license it?

A proof records how a conclusion follows through permitted rules. Unlike a truth table, it need not list all assignments. Every line must be a premise, an explicitly opened assumption, or a result justified from available earlier lines.

Conjunction elimination (∧E) takes P or Q from P ∧ Q. Conjunction introduction (∧I) combines available P and Q into P ∧ Q. Conditional elimination (→E), also called modus ponens, takes Q from P → Q and P.

Cite line numbers so another reader can inspect the dependency. A valid rule cannot be applied to premises that only resemble its required form. These exercises ask you to justify authored proof steps, not enter arbitrary proofs into a general theorem prover.

Work through an example

  1. 1. P ∧ Q (premise). 2. Q → R (premise).
  2. 3. Q (∧E, line 1). 4. R (→E, lines 2 and 3).
  3. Q was extracted, not guessed. R used the entire conditional and its antecedent.

Your turn

0 / 3
Practice 1Not checked

Complete the justifications for this direct proof.

Your answer
  1. 1. P → Q · premise
  2. 2. P · premise
  3. 3. Q → R · premise
Read solution · does not award completion
  1. 4. Q → →E, 1 + 2
  2. 5. R → →E, 3 + 4
  3. 6. Q ∧ R → ∧I, 4 + 5

Lines 4 and 5 each apply a conditional to its antecedent. Line 6 combines two established statements. No extra assumption is needed.

Practice 2Not checked

Given P ∧ (Q ∨ R), which follows directly by ∧E?

Your answer
Read solution · does not award completion

Q ∨ R

Respect parentheses: apply the rule to the main connective.

Practice 3Not checked

A proof has P → Q and Q, then labels P '→E'. What is wrong?

Your answer
Read solution · does not award completion

It affirms the consequent rather than applying →E.

The counterexample P = F, Q = T from lesson 7 still exposes this mistake.

Bring it back to your own work

Rewrite a three-step mathematical or programming explanation as numbered lines. Mark any step without an explicit justification.

Saved only on this browser0 / 6000

Practice answers and private notes stay in this browser; copied links contain only the public page address. Site advertising and analytics still apply.

Sources, scope, and corrections

Original Fineuralab teaching examples; fictional scenarios are not reported research results. Edition 20260903-v1. Page updated 2026-09-03.

  • forall x: Calgary

    Open textbook for further study of formal logic. Used to cross-check scope and terminology; these lessons and exercises are newly authored, not a translation of its chapters.

  • Organizing Instruction and Study to Improve Student Learning

    IES practice guide informing worked examples, retrieval, and concrete/abstract connections. It has not evaluated this course.

  • Carnap

    A separate open-source platform for more extensive formal-logic exercises and proof work.

Found an ambiguous example or a reasoning error? Include the lesson and exercise number when reporting it. [email protected]

How do I retain independent judgment when using AI here?

Keep your own answer before consulting an AI candidate. Check sources, calculations, inference and conditions; explain adoption or rejection. Then solve a new-context task independently and apply the checks to this lesson.

Practice the verification workflow and keep a record

My learning status

Mark statuses manually; visits do not establish mastery. Languages share statuses while lessons keep their own answers. This backup contains statuses only, not answers or notes.

View all statuses

Continue learning

Learning archive, reviews and full backup · Explore courses