PA002J

le_add_left

Stable checked-use theorem · independently closed

Adding on the left produces an explicit order witness.

Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved. Exact original first-admission records.

Exact expanded PA statement

forall a b. exists k. k + a = b + a

Structural proof guide

Generated structural guide

Adding on the left produces an explicit order witness.

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.

Read the argument

Proof checkpoints

4 script commands · 3 reading checkpoints · 0 local claims

This is a reading aid, not a new proof or a proof-tree certificate. Checkpoint groups are consecutive commands, not inferred branch boundaries. Every step links to the preserved script.

01Fix variables and assumptionsL1–2

Work with arbitrary variables or the premises of the current implication.

  1. L1
    intro a
  2. L2
    intro b
02Construct an explicit witnessL3–3

Supply the displayed value, then prove that it has the required property.

  1. L3
    exists b
03Calculate and transport equalitiesL4–4

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L4
    refl

Library-wide reading audit

Original exact command ledger · 4 lines
  1. 0001intro a
  2. 0002intro b
  3. 0003exists b
  4. 0004refl