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 b c u v l k. (exists mdr_gap_bound. mdr_gap_bound + (k) = (l)) -> (forall mdr_i_source mdr_a_source. (exists mdr_gap_sourceb. mdr_gap_sourceb + S (mdr_i_source) = (l)) -> (((exists ff_h_mdr_sourceo. ff_h_mdr_sourceo + S (mdr_a_source) = S ((S (mdr_i_source)) * c)) /\ exists ff_q_mdr_sourceo. b = ff_q_mdr_sourceo * S ((S (mdr_i_source)) * c) + (mdr_a_source))) -> (((exists ff_h_mdr_sourcen. ff_h_mdr_sourcen + S (mdr_a_source) = S ((S (mdr_i_source)) * v)) /\ exists ff_q_mdr_sourcen. u = ff_q_mdr_sourcen * S ((S (mdr_i_source)) * v) + (mdr_a_source)))) -> (forall mdr_i_short mdr_a_short. (exists mdr_gap_shortb. mdr_gap_shortb + S (mdr_i_short) = (k)) -> (((exists ff_h_mdr_shorto. ff_h_mdr_shorto + S (mdr_a_short) = S ((S (mdr_i_short)) * c)) /\ exists ff_q_mdr_shorto. b = ff_q_mdr_shorto * S ((S (mdr_i_short)) * c) + (mdr_a_short))) -> (((exists ff_h_mdr_shortn. ff_h_mdr_shortn + S (mdr_a_short) = S ((S (mdr_i_short)) * v)) /\ exists ff_q_mdr_shortn. u = ff_q_mdr_shortn * S ((S (mdr_i_short)) * v) + (mdr_a_short))))Constructive proof overview
Generated structural guide
An exact preserved beta prefix restricts to every constructively bounded shorter prefix.
The unchanged tactic script uses 1 declared prerequisite and contains 22 exact native proof lines.
Alpha v34 checked-use · first admitted v27 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
lt_of_lt_of_le Stable theorem; checked-use authorizedDirect 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
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–10
02Fix variables and assumptionsL11–12
03Use earlier factsL13–22
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original exact command ledger · 22 lines
- 0001
intro b - 0002
intro c - 0003
intro u - 0004
intro v - 0005
intro l - 0006
intro k - 0007
intro hk - 0008
intro hprefix - 0009
intro i - 0010
intro a - 0011
intro hi - 0012
intro ha - 0013
specialize hprefix (i) - 0014
specialize hprefix (a) - 0015
apply hprefix - 0016
specialize lt_of_lt_of_le (i) - 0017
specialize lt_of_lt_of_le (k) - 0018
specialize lt_of_lt_of_le (l) - 0019
apply lt_of_lt_of_le - 0020
exact hi - 0021
exact hk - 0022
exact ha