Skip to content
BetterDL

Algebraic proof

Also called: Boolean proof, proof, proof using the laws, algebraic manipulation

Showing two Boolean expressions are equal by rewriting one into the other, one step at a time, with a named law justifying each step.

An algebraic proof transforms one side of an equation into the other using only the laws of boolean algebra. Each line is equal to the one before, so the first and last lines are equal.

Good habits:

  • One law per step, and write its name next to the step.
  • Work from the more complicated side toward the simpler one; it is easier to remove things than to invent them.
  • Keep brackets until a law tells you to remove them.
  • Use reverse steps when needed. Sometimes you must make an expression bigger first, for example writing A as (identity) so you can factor.

Compared with perfect induction, algebra scales to any number of variables and shows why something is true. Its risk is a wrong step, so a quick row check at the end is wise.

Proofs are also how new rules are justified. The absorption law, the redundant literal rule and the consensus theorem can all be proved from the basic laws.

Worked examples

Example

Proving absorption

Prove = A.

  1. 1.

    = (identity, used in reverse).

  2. 2.

    = (distributive: factor out A).

  3. 3.

    = (null: = 1).

  4. 4.

    = A (identity).

Example

Proving the redundant literal rule

Prove = .

  1. 1.

    = (distributive, OR over AND).

  2. 2.

    = (complement).

  3. 3.

    = (identity).

Common mistakes

  • Doing two or three laws in one line without naming them. It hides mistakes.

  • Using a rule that is not a Boolean law, such as cancelling a term from both sides.

  • Working on both sides at once and meeting in the middle carelessly. Transform one side, or make sure every step is reversible.

Practice Algebraic proof

Interactive questions with instant feedback and a worked solution for every wrong answer.

Learn it step by step

Algebraic proof is taught in Boolean Algebra.