BT000X

le_succ_self

Stable checked-use theorem · independently kernel verified

Every natural number is below its successor.

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 n. n <= S n

Structural proof guide

Every natural number is below its successor.

Direct prerequisites: zero_add, add_succ_left. The authored body proceeds by direct introduction and elimination.

Proof neighborhood

Direct dependencies

Direct dependents

Formal native tactic body

Dependencies are hypotheses of the historical Alpha-v12 body receipt. The complete historical Alpha-v18 proof bundle independently checks every dependency; current Alpha v25 preserves that checked theorem use without changing Stable membership.

Read the argument

Proof checkpoints

3 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–1

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

  1. L1
    intro n
02Construct an explicit witnessL2–2

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

  1. L2
    exists 1
03Calculate and transport equalitiesL3–3

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

  1. L3
    simp [add_succ_left, zero_add]

Library-wide reading audit

Original exact command ledger · 3 lines
  1. 0001intro n
  2. 0002exists 1
  3. 0003simp [add_succ_left, zero_add]