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 K. (exists mdr_gap_restriction_bound. mdr_gap_restriction_bound + (K) = (L)) -> (forall ics_index_equality_full ics_value0_equality_full ics_value1_equality_full ics_value2_equality_full ics_value3_equality_full. (exists ics_gap_equality_full_bound. ics_gap_equality_full_bound + S (ics_index_equality_full) = (L)) -> (((exists fs_h_ics_equality_full_at0. fs_h_ics_equality_full_at0 + S (ics_value0_equality_full) = S ((S (ics_index_equality_full)) * ac)) /\ exists fs_q_ics_equality_full_at0. ab = fs_q_ics_equality_full_at0 * S ((S (ics_index_equality_full)) * ac) + (ics_value0_equality_full))) -> (((exists fs_h_ics_equality_full_at1. fs_h_ics_equality_full_at1 + S (ics_value1_equality_full) = S ((S (ics_index_equality_full)) * bc)) /\ exists fs_q_ics_equality_full_at1. bb = fs_q_ics_equality_full_at1 * S ((S (ics_index_equality_full)) * bc) + (ics_value1_equality_full))) -> (((exists fs_h_ics_equality_full_at2. fs_h_ics_equality_full_at2 + S (ics_value2_equality_full) = S ((S (ics_index_equality_full)) * ec)) /\ exists fs_q_ics_equality_full_at2. eb = fs_q_ics_equality_full_at2 * S ((S (ics_index_equality_full)) * ec) + (ics_value2_equality_full))) -> (((exists fs_h_ics_equality_full_at3. fs_h_ics_equality_full_at3 + S (ics_value3_equality_full) = S ((S (ics_index_equality_full)) * fc)) /\ exists fs_q_ics_equality_full_at3. fb = fs_q_ics_equality_full_at3 * S ((S (ics_index_equality_full)) * fc) + (ics_value3_equality_full))) -> ics_value0_equality_full + ics_value3_equality_full = ics_value2_equality_full + ics_value1_equality_full) -> (forall ics_index_equality_prefix ics_value0_equality_prefix ics_value1_equality_prefix ics_value2_equality_prefix ics_value3_equality_prefix. (exists ics_gap_equality_prefix_bound. ics_gap_equality_prefix_bound + S (ics_index_equality_prefix) = (K)) -> (((exists fs_h_ics_equality_prefix_at0. fs_h_ics_equality_prefix_at0 + S (ics_value0_equality_prefix) = S ((S (ics_index_equality_prefix)) * ac)) /\ exists fs_q_ics_equality_prefix_at0. ab = fs_q_ics_equality_prefix_at0 * S ((S (ics_index_equality_prefix)) * ac) + (ics_value0_equality_prefix))) -> (((exists fs_h_ics_equality_prefix_at1. fs_h_ics_equality_prefix_at1 + S (ics_value1_equality_prefix) = S ((S (ics_index_equality_prefix)) * bc)) /\ exists fs_q_ics_equality_prefix_at1. bb = fs_q_ics_equality_prefix_at1 * S ((S (ics_index_equality_prefix)) * bc) + (ics_value1_equality_prefix))) -> (((exists fs_h_ics_equality_prefix_at2. fs_h_ics_equality_prefix_at2 + S (ics_value2_equality_prefix) = S ((S (ics_index_equality_prefix)) * ec)) /\ exists fs_q_ics_equality_prefix_at2. eb = fs_q_ics_equality_prefix_at2 * S ((S (ics_index_equality_prefix)) * ec) + (ics_value2_equality_prefix))) -> (((exists fs_h_ics_equality_prefix_at3. fs_h_ics_equality_prefix_at3 + S (ics_value3_equality_prefix) = S ((S (ics_index_equality_prefix)) * fc)) /\ exists fs_q_ics_equality_prefix_at3. fb = fs_q_ics_equality_prefix_at3 * S ((S (ics_index_equality_prefix)) * fc) + (ics_value3_equality_prefix))) -> ics_value0_equality_prefix + ics_value3_equality_prefix = ics_value2_equality_prefix + ics_value1_equality_prefix)Constructive proof overview
Generated structural guide
Actual signed-integer equality restricts to every smaller finite prefix, without requiring equality of positive or negative components.
The unchanged tactic script uses 1 declared prerequisite and contains 38 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–20
03Fix variables and assumptionsL21–22
04Use earlier factsL23–32
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original exact command ledger · 38 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 K - 0011
intro hbound - 0012
intro hequal - 0013
intro i - 0014
intro a - 0015
intro b - 0016
intro c - 0017
intro d - 0018
intro hi - 0019
intro ha - 0020
intro hb - 0021
intro hc - 0022
intro hd - 0023
specialize hequal (i) - 0024
specialize hequal (a) - 0025
specialize hequal (b) - 0026
specialize hequal (c) - 0027
specialize hequal (d) - 0028
apply hequal - 0029
specialize lt_of_lt_of_le (i) - 0030
specialize lt_of_lt_of_le (K) - 0031
specialize lt_of_lt_of_le (L) - 0032
apply lt_of_lt_of_le - 0033
exact hi - 0034
exact hbound - 0035
exact ha - 0036
exact hb - 0037
exact hc - 0038
exact hd