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 b c a l sl. sl = S l -> (forall ff_i_before. (exists ff_lt_before_bound. ff_lt_before_bound + S ff_i_before = l) -> (((exists ff_h_before_decoded. ff_h_before_decoded + S (a) = S ((S (ff_i_before)) * c)) /\ exists ff_q_before_decoded. b = ff_q_before_decoded * S ((S (ff_i_before)) * c) + (a)))) -> exists z d. (forall ff_i_after. (exists ff_lt_after_bound. ff_lt_after_bound + S ff_i_after = sl) -> (((exists ff_h_after_decoded. ff_h_after_decoded + S (a) = S ((S (ff_i_after)) * d)) /\ exists ff_q_after_decoded. z = ff_q_after_decoded * S ((S (ff_i_after)) * d) + (a))))Structural proof guide
Recode a constant prefix and append one more copy of its value.
Direct prerequisites: beta_prefix_extend, le_of_succ_le_succ, le_eq_or_lt. The authored body proceeds by case analysis (4), intermediate claims (2), equality transport (3).
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
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.
Named ingredients (3)
01Fix variables and assumptionsL1–7
02Use earlier factsL8–11
03Separate the logical casesL12–14
04Construct an explicit witnessL15–16
05Fix variables and assumptionsL17–18
06Calculate and transport equalitiesL19–19
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L19
rewrite hsl at hi
07Establish hilL20–24
08Establish hsplitL25–29
09Separate the logical casesL30–30
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L30
cases hsplit
10Calculate and transport equalitiesL31–32
11Use earlier factsL33–40
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original exact command ledger · 40 lines
- 0001
intro b - 0002
intro c - 0003
intro a - 0004
intro l - 0005
intro sl - 0006
intro hsl - 0007
intro hrepeat - 0008
specialize beta_prefix_extend l - 0009
specialize beta_prefix_extend b - 0010
specialize beta_prefix_extend c - 0011
specialize beta_prefix_extend a - 0012
cases beta_prefix_extend - 0013
cases beta_prefix_extend_witness - 0014
cases beta_prefix_extend_witness_witness - 0015
exists x - 0016
exists x1 - 0017
intro i - 0018
intro hi - 0019
rewrite hsl at hi - 0020
have hil : exists h. h + i = l - 0021
specialize le_of_succ_le_succ i - 0022
specialize le_of_succ_le_succ l - 0023
apply le_of_succ_le_succ - 0024
exact hi - 0025
have hsplit : i = l \/ exists h. h + S i = l - 0026
specialize le_eq_or_lt i - 0027
specialize le_eq_or_lt l - 0028
apply le_eq_or_lt - 0029
exact hil - 0030
cases hsplit - 0031
rewrite hsplit_left - 0032
rewrite hsplit_left - 0033
exact beta_prefix_extend_witness_witness_left - 0034
specialize beta_prefix_extend_witness_witness_right i - 0035
specialize beta_prefix_extend_witness_witness_right a - 0036
apply beta_prefix_extend_witness_witness_right - 0037
exact hsplit_right - 0038
specialize hrepeat i - 0039
apply hrepeat - 0040
exact hsplit_right