PA000H

mul_comm

Stable checked-use theorem · independently closed

Multiplication is commutative.

Exact expanded PA statement

forall n m. n * m = m * n

Structural proof guide

Generated structural guide

Multiplication is commutative.

Use the direct prerequisites mul_zero_left, mul_succ_left as previously established PA formulas.

The proof proceeds by structural induction (1), certified simplification (2).

Referenced ingredients

Proof neighborhood

Direct dependencies

Direct dependents

Formal native tactic body

Dependencies are introduced as named hypotheses before line 1. Linked names are exact direct references. This Stable checked-use theorem is independently kernel-checked when replayed.

  1. 0001intro n
  2. 0002induction m
  3. 0003simp [mul_zero_left]
  4. 0004simp [IH, mul_succ_left]