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 b c pb pc nb nc l. (forall ics_index_zero_target ics_value0_zero_target ics_value1_zero_target. (exists ics_gap_zero_target_bound. ics_gap_zero_target_bound + S (ics_index_zero_target) = (l)) -> (((exists fs_h_ics_zero_target_at0. fs_h_ics_zero_target_at0 + S (ics_value0_zero_target) = S ((S (ics_index_zero_target)) * pc)) /\ exists fs_q_ics_zero_target_at0. pb = fs_q_ics_zero_target_at0 * S ((S (ics_index_zero_target)) * pc) + (ics_value0_zero_target))) -> (((exists fs_h_ics_zero_target_at1. fs_h_ics_zero_target_at1 + S (ics_value1_zero_target) = S ((S (ics_index_zero_target)) * nc)) /\ exists fs_q_ics_zero_target_at1. nb = fs_q_ics_zero_target_at1 * S ((S (ics_index_zero_target)) * nc) + (ics_value1_zero_target))) -> ics_value0_zero_target = ics_value1_zero_target) -> (forall ics_index_zero_same_target ics_value0_zero_same_target ics_value1_zero_same_target ics_value2_zero_same_target ics_value3_zero_same_target. (exists ics_gap_zero_same_target_bound. ics_gap_zero_same_target_bound + S (ics_index_zero_same_target) = (l)) -> (((exists fs_h_ics_zero_same_target_at0. fs_h_ics_zero_same_target_at0 + S (ics_value0_zero_same_target) = S ((S (ics_index_zero_same_target)) * c)) /\ exists fs_q_ics_zero_same_target_at0. b = fs_q_ics_zero_same_target_at0 * S ((S (ics_index_zero_same_target)) * c) + (ics_value0_zero_same_target))) -> (((exists fs_h_ics_zero_same_target_at1. fs_h_ics_zero_same_target_at1 + S (ics_value1_zero_same_target) = S ((S (ics_index_zero_same_target)) * c)) /\ exists fs_q_ics_zero_same_target_at1. b = fs_q_ics_zero_same_target_at1 * S ((S (ics_index_zero_same_target)) * c) + (ics_value1_zero_same_target))) -> (((exists fs_h_ics_zero_same_target_at2. fs_h_ics_zero_same_target_at2 + S (ics_value2_zero_same_target) = S ((S (ics_index_zero_same_target)) * pc)) /\ exists fs_q_ics_zero_same_target_at2. pb = fs_q_ics_zero_same_target_at2 * S ((S (ics_index_zero_same_target)) * pc) + (ics_value2_zero_same_target))) -> (((exists fs_h_ics_zero_same_target_at3. fs_h_ics_zero_same_target_at3 + S (ics_value3_zero_same_target) = S ((S (ics_index_zero_same_target)) * nc)) /\ exists fs_q_ics_zero_same_target_at3. nb = fs_q_ics_zero_same_target_at3 * S ((S (ics_index_zero_same_target)) * nc) + (ics_value3_zero_same_target))) -> ics_value0_zero_same_target + ics_value3_zero_same_target = ics_value2_zero_same_target + ics_value1_zero_same_target)Constructive proof overview
Generated structural guide
An equal-component product represents every actual zero vector, including all noncanonical zero pair encodings.
The unchanged tactic script uses 2 declared prerequisites 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
beta_at_unique Stable theorem; checked-use authorized add_comm 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–18
03Establish hsameL19–27
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta at unique.
04Establish hzL28–37
05Use earlier factsL38–38
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L38
apply add_comm
Original exact command ledger · 38 lines
- 0001
intro b - 0002
intro c - 0003
intro pb - 0004
intro pc - 0005
intro nb - 0006
intro nc - 0007
intro l - 0008
intro hzero - 0009
intro i - 0010
intro u - 0011
intro v - 0012
intro p - 0013
intro n - 0014
intro hi - 0015
intro hu - 0016
intro hv - 0017
intro hp - 0018
intro hn - 0019
have hsame : u = v - 0020
specialize beta_at_unique (b) - 0021
specialize beta_at_unique (c) - 0022
specialize beta_at_unique (i) - 0023
specialize beta_at_unique (u) - 0024
specialize beta_at_unique (v) - 0025
apply beta_at_unique - 0026
exact hu - 0027
exact hv - 0028
have hz : p = n - 0029
specialize hzero (i) - 0030
specialize hzero (p) - 0031
specialize hzero (n) - 0032
apply hzero - 0033
exact hi - 0034
exact hp - 0035
exact hn - 0036
rewrite hsame - 0037
rewrite hz - 0038
apply add_comm