PA0001

zero_add

Stable checked-use theorem · independently closed

Zero is a left identity for addition; unlike PA3, this needs induction.

Exact expanded PA statement

forall n. 0 + n = n

Structural proof guide

Generated structural guide

Zero is a left identity for addition; unlike PA3, this needs induction.

This root lemma is proved directly from the PA rules and the hypotheses introduced by its statement.

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

Referenced ingredients

none

Proof neighborhood

Direct dependencies

none

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. 0001induction n
  2. 0002simp
  3. 0003simp [IH]