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 ab ac bb bc eb ec fb fc l. (forall ics_index_equal_source ics_value0_equal_source ics_value1_equal_source ics_value2_equal_source ics_value3_equal_source. (exists ics_gap_equal_source_bound. ics_gap_equal_source_bound + S (ics_index_equal_source) = (l)) -> (((exists fs_h_ics_equal_source_at0. fs_h_ics_equal_source_at0 + S (ics_value0_equal_source) = S ((S (ics_index_equal_source)) * ac)) /\ exists fs_q_ics_equal_source_at0. ab = fs_q_ics_equal_source_at0 * S ((S (ics_index_equal_source)) * ac) + (ics_value0_equal_source))) -> (((exists fs_h_ics_equal_source_at1. fs_h_ics_equal_source_at1 + S (ics_value1_equal_source) = S ((S (ics_index_equal_source)) * bc)) /\ exists fs_q_ics_equal_source_at1. bb = fs_q_ics_equal_source_at1 * S ((S (ics_index_equal_source)) * bc) + (ics_value1_equal_source))) -> (((exists fs_h_ics_equal_source_at2. fs_h_ics_equal_source_at2 + S (ics_value2_equal_source) = S ((S (ics_index_equal_source)) * ec)) /\ exists fs_q_ics_equal_source_at2. eb = fs_q_ics_equal_source_at2 * S ((S (ics_index_equal_source)) * ec) + (ics_value2_equal_source))) -> (((exists fs_h_ics_equal_source_at3. fs_h_ics_equal_source_at3 + S (ics_value3_equal_source) = S ((S (ics_index_equal_source)) * fc)) /\ exists fs_q_ics_equal_source_at3. fb = fs_q_ics_equal_source_at3 * S ((S (ics_index_equal_source)) * fc) + (ics_value3_equal_source))) -> ics_value0_equal_source + ics_value3_equal_source = ics_value2_equal_source + ics_value1_equal_source) -> (forall ics_index_equal_reverse ics_value0_equal_reverse ics_value1_equal_reverse ics_value2_equal_reverse ics_value3_equal_reverse. (exists ics_gap_equal_reverse_bound. ics_gap_equal_reverse_bound + S (ics_index_equal_reverse) = (l)) -> (((exists fs_h_ics_equal_reverse_at0. fs_h_ics_equal_reverse_at0 + S (ics_value0_equal_reverse) = S ((S (ics_index_equal_reverse)) * ec)) /\ exists fs_q_ics_equal_reverse_at0. eb = fs_q_ics_equal_reverse_at0 * S ((S (ics_index_equal_reverse)) * ec) + (ics_value0_equal_reverse))) -> (((exists fs_h_ics_equal_reverse_at1. fs_h_ics_equal_reverse_at1 + S (ics_value1_equal_reverse) = S ((S (ics_index_equal_reverse)) * fc)) /\ exists fs_q_ics_equal_reverse_at1. fb = fs_q_ics_equal_reverse_at1 * S ((S (ics_index_equal_reverse)) * fc) + (ics_value1_equal_reverse))) -> (((exists fs_h_ics_equal_reverse_at2. fs_h_ics_equal_reverse_at2 + S (ics_value2_equal_reverse) = S ((S (ics_index_equal_reverse)) * ac)) /\ exists fs_q_ics_equal_reverse_at2. ab = fs_q_ics_equal_reverse_at2 * S ((S (ics_index_equal_reverse)) * ac) + (ics_value2_equal_reverse))) -> (((exists fs_h_ics_equal_reverse_at3. fs_h_ics_equal_reverse_at3 + S (ics_value3_equal_reverse) = S ((S (ics_index_equal_reverse)) * bc)) /\ exists fs_q_ics_equal_reverse_at3. bb = fs_q_ics_equal_reverse_at3 * S ((S (ics_index_equal_reverse)) * bc) + (ics_value3_equal_reverse))) -> ics_value0_equal_reverse + ics_value3_equal_reverse = ics_value2_equal_reverse + ics_value1_equal_reverse)Constructive proof overview
Generated structural guide
Signed-integer vector equality is symmetric at the actual decoded-entry level.
The unchanged tactic script uses 1 declared prerequisite and contains 34 exact native proof lines.
Alpha v34 checked-use · first admitted v27 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
eq_symm 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–20
03Use earlier factsL21–30
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original exact command ledger · 34 lines
- 0001
intro ab - 0002
intro ac - 0003
intro bb - 0004
intro bc - 0005
intro eb - 0006
intro ec - 0007
intro fb - 0008
intro fc - 0009
intro l - 0010
intro hequal - 0011
intro i - 0012
intro a - 0013
intro b - 0014
intro c - 0015
intro d - 0016
intro hi - 0017
intro ha - 0018
intro hb - 0019
intro hc - 0020
intro hd - 0021
specialize eq_symm (c + b) - 0022
specialize eq_symm (a + d) - 0023
apply eq_symm - 0024
specialize hequal (i) - 0025
specialize hequal (c) - 0026
specialize hequal (d) - 0027
specialize hequal (a) - 0028
specialize hequal (b) - 0029
apply hequal - 0030
exact hi - 0031
exact hc - 0032
exact hd - 0033
exact ha - 0034
exact hb