Skip to main content
Humanities LibreTexts

Section 06: Proof strategy

  • Page ID
    1069
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \) \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)\(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\) \(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\)\(\newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    There is no simple recipe for proofs, and there is no substitute for practice. Here, though, are some rules of thumb and strategies to keep in mind.

    Work backwards from what you want. The ultimate goal is to derive the conclusion. Look at the conclusion and ask what the introduction rule is for its main logical operator. This gives you an idea of what should happen just before the last line of the proof. Then you can treat this line as if it were your goal. Ask what you could do to derive this new goal. For example: If your conclusion is a conditional \(\mathcal{A}\) → \(\mathcal{B}\), plan to use the →I rule. This requires starting a subproof in which you assume \(\mathcal{A}\). In the subproof, you want to derive \(\mathcal{B}\).

    Work forwards from what you have. When you are starting a proof, look at the premises; later, look at the sentences that you have derived so far. Think about the elimination rules for the main operators of these sentences. These will tell you what your options are.

    For example: If you have ∀\(x\)\(\mathcal{A}\), think about instantiating it for any constant that might be helpful. If you have ∃\(x\)\(\mathcal{A}\) and intend to use the ∃E rule, then you should assume \(\mathcal{A}\)[\(c\)|\(x\)] for some \(c\) that is not in use and then derive a conclusion that does not contain \(c\).

    For a short proof, you might be able to eliminate the premises and introduce the conclusion. A long proof is formally just a number of short proofs linked together, so you can fill the gap by alternately working back from the conclusion and forward from the premises.

    Change what you are looking at. Replacement rules can often make your life easier. If a proof seems impossible, try out some different substitutions.

    For example: It is often difficult to prove a disjunction using the basic rules. If you want to show \(\mathcal{A}\)∨\(\mathcal{B}\), it is often easier to show ¬\(\mathcal{A}\) → \(\mathcal{B}\) and use the MC rule.

    Showing ¬∃\(x\)\(\mathcal{A}\) can also be hard, and it is often easier to show ∀\(x\)¬\(\mathcal{A}\) and use the QN rule.

    Some replacement rules should become second nature. If you see a negated disjunction, for instance, you should immediately think of DeMorgan’s rule.

    Do not forget indirect proof. If you cannot find a way to show something directly, try assuming its negation.

    Remember that most proofs can be done either indirectly or directly. One way might be easier— or perhaps one sparks your imagination more than the other— but either one is formally legitimate.

    Repeat as necessary. Once you have decided how you might be able to get to the conclusion, ask what you might be able to do with the premises. Then consider the target sentences again and ask how you might reach them.

    Persist. Try different things. If one approach fails, then try something else.


    This page titled Section 06: Proof strategy is shared under a CC BY-SA license and was authored, remixed, and/or curated by P.D. Magnus (Fecundity) .

    • Was this article helpful?