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 h e H E k j s u U v V. (forall cfc_index_state_transport cfc_value_state_transport. (exists cfba_gap_state_transportbound. cfba_gap_state_transportbound + S (cfc_index_state_transport) = (k)) -> (((exists ff_h_state_transportsource. ff_h_state_transportsource + S (cfc_value_state_transport) = S ((S (cfc_index_state_transport)) * e)) /\ exists ff_q_state_transportsource. h = ff_q_state_transportsource * S ((S (cfc_index_state_transport)) * e) + (cfc_value_state_transport))) -> (((exists ff_h_state_transporttarget. ff_h_state_transporttarget + S (cfc_value_state_transport) = S ((S (cfc_index_state_transport)) * E)) /\ exists ff_q_state_transporttarget. H = ff_q_state_transporttarget * S ((S (cfc_index_state_transport)) * E) + (cfc_value_state_transport)))) -> (exists cfba_gap_state_transport_index. cfba_gap_state_transport_index + S (j) = (k)) -> (exists cfc_state_state_transport_source. ((exists cfc_left_state_transport_sourcecode cfc_right_state_transport_sourcecode cfc_matrix_state_transport_sourcecode. ((cfc_left_state_transport_sourcecode = ((u) + (U)) * S ((u) + (U)) + ((U) + (U))) /\ ((cfc_right_state_transport_sourcecode = ((v) + (V)) * S ((v) + (V)) + ((V) + (V))) /\ ((cfc_matrix_state_transport_sourcecode = ((cfc_left_state_transport_sourcecode) + (cfc_right_state_transport_sourcecode)) * S ((cfc_left_state_transport_sourcecode) + (cfc_right_state_transport_sourcecode)) + ((cfc_right_state_transport_sourcecode) + (cfc_right_state_transport_sourcecode))) /\ ((cfc_state_state_transport_source) = ((s) + (cfc_matrix_state_transport_sourcecode)) * S ((s) + (cfc_matrix_state_transport_sourcecode)) + ((cfc_matrix_state_transport_sourcecode) + (cfc_matrix_state_transport_sourcecode))))))) /\ (((exists ff_h_state_transport_sourceentry. ff_h_state_transport_sourceentry + S (cfc_state_state_transport_source) = S ((S (j)) * e)) /\ exists ff_q_state_transport_sourceentry. h = ff_q_state_transport_sourceentry * S ((S (j)) * e) + (cfc_state_state_transport_source))))) -> (exists cfc_state_state_transport_target. ((exists cfc_left_state_transport_targetcode cfc_right_state_transport_targetcode cfc_matrix_state_transport_targetcode. ((cfc_left_state_transport_targetcode = ((u) + (U)) * S ((u) + (U)) + ((U) + (U))) /\ ((cfc_right_state_transport_targetcode = ((v) + (V)) * S ((v) + (V)) + ((V) + (V))) /\ ((cfc_matrix_state_transport_targetcode = ((cfc_left_state_transport_targetcode) + (cfc_right_state_transport_targetcode)) * S ((cfc_left_state_transport_targetcode) + (cfc_right_state_transport_targetcode)) + ((cfc_right_state_transport_targetcode) + (cfc_right_state_transport_targetcode))) /\ ((cfc_state_state_transport_target) = ((s) + (cfc_matrix_state_transport_targetcode)) * S ((s) + (cfc_matrix_state_transport_targetcode)) + ((cfc_matrix_state_transport_targetcode) + (cfc_matrix_state_transport_targetcode))))))) /\ (((exists ff_h_state_transport_targetentry. ff_h_state_transport_targetentry + S (cfc_state_state_transport_target) = S ((S (j)) * E)) /\ exists ff_q_state_transport_targetentry. H = ff_q_state_transport_targetentry * S ((S (j)) * E) + (cfc_state_state_transport_target)))))Constructive proof overview
Generated structural guide
Ordinary beta-prefix extension preserves every actually decoded matrix coordinate at all retained indices.
The unchanged tactic script uses 0 declared prerequisites and contains 24 exact native proof lines.
Alpha v34 checked-use · first admitted v29 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
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
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–14
03Separate the logical casesL15–16
04Construct an explicit witnessL17–17
Supply the displayed value, then prove that it has the required property.
- L17
exists x
05Separate the logical casesL18–18
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L18
split
Original exact command ledger · 24 lines
- 0001
intro h - 0002
intro e - 0003
intro H - 0004
intro E - 0005
intro k - 0006
intro j - 0007
intro s - 0008
intro u - 0009
intro U - 0010
intro v - 0011
intro V - 0012
intro hp - 0013
intro hj - 0014
intro ha - 0015
cases ha - 0016
cases ha_witness - 0017
exists x - 0018
split - 0019
exact ha_witness_left - 0020
specialize hp (j) - 0021
specialize hp (x) - 0022
apply hp - 0023
exact hj - 0024
exact ha_witness_right