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 expanded first-order arithmetic statement
forall b c L t B C i a. (((forall pfp_repeat_index_shift_paddingzeros. (exists pfa_gap_shift_paddingzerosindex. pfa_gap_shift_paddingzerosindex + S (pfp_repeat_index_shift_paddingzeros) = (t)) -> (((exists ff_h_pfp_shift_paddingzerosentry. ff_h_pfp_shift_paddingzerosentry + S (0) = S ((S (pfp_repeat_index_shift_paddingzeros)) * C)) /\ exists ff_q_pfp_shift_paddingzerosentry. B = ff_q_pfp_shift_paddingzerosentry * S ((S (pfp_repeat_index_shift_paddingzeros)) * C) + (0)))) /\ ((forall pfrep_index_shift_padding pfrep_value_shift_padding. (exists pfa_gap_shift_paddingbound. pfa_gap_shift_paddingbound + S (pfrep_index_shift_padding) = (L)) -> (((exists ff_h_pfp_shift_paddinginput. ff_h_pfp_shift_paddinginput + S (pfrep_value_shift_padding) = S ((S (pfrep_index_shift_padding)) * c)) /\ exists ff_q_pfp_shift_paddinginput. b = ff_q_pfp_shift_paddinginput * S ((S (pfrep_index_shift_padding)) * c) + (pfrep_value_shift_padding))) -> (((exists ff_h_pfp_shift_paddingoutput. ff_h_pfp_shift_paddingoutput + S (pfrep_value_shift_padding) = S ((S ((t)+pfrep_index_shift_padding)) * C)) /\ exists ff_q_pfp_shift_paddingoutput. B = ff_q_pfp_shift_paddingoutput * S ((S ((t)+pfrep_index_shift_padding)) * C) + (pfrep_value_shift_padding))))))) -> ((((exists pfa_gap_shift_originalinside. pfa_gap_shift_originalinside + S (i) = (L)) /\ ((((exists ff_h_pfp_shift_originalentry. ff_h_pfp_shift_originalentry + S (a) = S ((S (i)) * c)) /\ exists ff_q_pfp_shift_originalentry. b = ff_q_pfp_shift_originalentry * S ((S (i)) * c) + (a)))))) \/ (((exists pfc_gap_shift_originaloutside. pfc_gap_shift_originaloutside+(L)=(i)) /\ (((a)=0))))) -> ((((exists pfa_gap_shift_resultinside. pfa_gap_shift_resultinside + S (t+i) = (t+L)) /\ ((((exists ff_h_pfp_shift_resultentry. ff_h_pfp_shift_resultentry + S (a) = S ((S (t+i)) * C)) /\ exists ff_q_pfp_shift_resultentry. B = ff_q_pfp_shift_resultentry * S ((S (t+i)) * C) + (a)))))) \/ (((exists pfc_gap_shift_resultoutside. pfc_gap_shift_resultoutside+(t+L)=(t+i)) /\ (((a)=0)))))Constructive proof overview
Generated structural guide
Leading-zero padding preserves every shifted zero-extended coefficient, including indices outside the original finite prefix.
The unchanged tactic script uses 2 declared prerequisites and contains 34 exact native proof lines.
Alpha v34 checked-use · first admitted v33 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
matrix_recursive_lt_add_left Alpha theorem; checked-use authorized add_le_add_left Alpha 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
02Separate the logical casesL11–15
03Use earlier factsL16–25
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L16
specialize matrix_recursive_lt_add_left (i) - L17
specialize matrix_recursive_lt_add_left (L) - L18
specialize matrix_recursive_lt_add_left (t) - L19
apply matrix_recursive_lt_add_left - L20
exact hvalue_left_left - L21
specialize hpad_right (i) - L22
specialize hpad_right (a) - L23
apply hpad_right - L24
exact hvalue_left_left - L25
exact hvalue_left_right
04Separate the logical casesL26–28
Original exact command ledger · 34 lines
- 0001
intro b - 0002
intro c - 0003
intro L - 0004
intro t - 0005
intro B - 0006
intro C - 0007
intro i - 0008
intro a - 0009
intro hpad - 0010
intro hvalue - 0011
cases hpad - 0012
cases hvalue - 0013
cases hvalue_left - 0014
left - 0015
split - 0016
specialize matrix_recursive_lt_add_left (i) - 0017
specialize matrix_recursive_lt_add_left (L) - 0018
specialize matrix_recursive_lt_add_left (t) - 0019
apply matrix_recursive_lt_add_left - 0020
exact hvalue_left_left - 0021
specialize hpad_right (i) - 0022
specialize hpad_right (a) - 0023
apply hpad_right - 0024
exact hvalue_left_left - 0025
exact hvalue_left_right - 0026
cases hvalue_right - 0027
right - 0028
split - 0029
specialize add_le_add_left (L) - 0030
specialize add_le_add_left (i) - 0031
specialize add_le_add_left (t) - 0032
apply add_le_add_left - 0033
exact hvalue_right_left - 0034
exact hvalue_right_right