PA006J

add_congr

Stable checked-use theorem · independently closed

Addition preserves equality in both arguments.

Exact expanded PA statement

forall a b c d. a = b -> c = d -> a + c = b + d

Structural proof guide

Generated structural guide

Addition preserves equality in both arguments.

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

The proof proceeds by direct introduction and elimination.

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. 0001intro a
  2. 0002intro b
  3. 0003intro c
  4. 0004intro d
  5. 0005intro hab
  6. 0006intro hcd
  7. 0007congr
  8. 0008exact hab
  9. 0009exact hcd