LU000Y

lucas_add_positive_index_strict

Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable

Adding a witnessed positive natural strictly increases a natural value.

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 first-order arithmetic statement

forall p j. ~(j = 0) -> (exists lcv_gap_positive_add. lcv_gap_positive_add + S (p) = (p + j))

Constructive proof overview

Generated structural guide

Adding a witnessed positive natural strictly increases a natural value.

The unchanged tactic script uses 3 declared prerequisites and contains 11 exact native proof lines.

dependency-curried kernel-checked theorem body; Alpha enrollment and checked-use authority follow separately sealed release evidence; Stable membership remains unchanged

Historical empty-context replay experiment only; that experiment persisted no certificate and granted no release authority. Current checked use follows separately sealed, independently verified proof bundles; there is no Stable promotion.

Proof neighborhood

Direct dependencies

nonzero_is_succ Stable theorem; checked-use authorized add_comm Stable theorem; checked-use authorized add_succ_left Stable theorem; checked-use authorized

Direct dependents

Formal native tactic body

Dependencies are introduced as named hypotheses before line 1. Local theorem links identify exact declared prerequisites. This exact body belongs to a complete independently kernel-checked constructive proof bundle and has Alpha checked-use authority; it does not imply Stable membership.

Read the argument

Proof checkpoints

11 script commands · 5 reading checkpoints · 1 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–3

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

  1. L1
    intro p
  2. L2
    intro j
  3. L3
    intro hpositive
02Establish hsuccessorL4–7

Establish this local claim before using it. It is not an additional assumption. The following proof commands apply nonzero is succ.

  1. L4
    have hsuccessor : exists k. j = S k
  2. L5
    specialize nonzero_is_succ j
  3. L6
    apply nonzero_is_succ
  4. L7
    exact hpositive
03Separate the logical casesL8–8

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L8
    cases hsuccessor
04Construct an explicit witnessL9–9

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

  1. L9
    exists x
05Calculate and transport equalitiesL10–11

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

  1. L10
    rewrite hsuccessor_witness
  2. L11
    simp [add_comm, add_succ_left]

Library-wide reading audit

Original exact command ledger · 11 lines
  1. 0001intro p
  2. 0002intro j
  3. 0003intro hpositive
  4. 0004have hsuccessor : exists k. j = S k
  5. 0005specialize nonzero_is_succ j
  6. 0006apply nonzero_is_succ
  7. 0007exact hpositive
  8. 0008cases hsuccessor
  9. 0009exists x
  10. 0010rewrite hsuccessor_witness
  11. 0011simp [add_comm, add_succ_left]