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 db dc eb ec fb fc pb pc nb nc l. (forall ff_index_mcp_add_ics_add_components_p ff_left_mcp_add_ics_add_components_p ff_right_mcp_add_ics_add_components_p ff_target_mcp_add_ics_add_components_p. (exists mcp_gap_ics_add_components_p_bound. mcp_gap_ics_add_components_p_bound + S (ff_index_mcp_add_ics_add_components_p) = (l)) -> (((exists fs_h_mcp_ics_add_components_p_left. fs_h_mcp_ics_add_components_p_left + S (ff_left_mcp_add_ics_add_components_p) = S ((S (ff_index_mcp_add_ics_add_components_p)) * ac)) /\ exists fs_q_mcp_ics_add_components_p_left. ab = fs_q_mcp_ics_add_components_p_left * S ((S (ff_index_mcp_add_ics_add_components_p)) * ac) + (ff_left_mcp_add_ics_add_components_p))) -> (((exists fs_h_mcp_ics_add_components_p_right. fs_h_mcp_ics_add_components_p_right + S (ff_right_mcp_add_ics_add_components_p) = S ((S (ff_index_mcp_add_ics_add_components_p)) * ec)) /\ exists fs_q_mcp_ics_add_components_p_right. eb = fs_q_mcp_ics_add_components_p_right * S ((S (ff_index_mcp_add_ics_add_components_p)) * ec) + (ff_right_mcp_add_ics_add_components_p))) -> (((exists fs_h_mcp_ics_add_components_p_target. fs_h_mcp_ics_add_components_p_target + S (ff_target_mcp_add_ics_add_components_p) = S ((S (ff_index_mcp_add_ics_add_components_p)) * pc)) /\ exists fs_q_mcp_ics_add_components_p_target. pb = fs_q_mcp_ics_add_components_p_target * S ((S (ff_index_mcp_add_ics_add_components_p)) * pc) + (ff_target_mcp_add_ics_add_components_p))) -> ff_target_mcp_add_ics_add_components_p = ff_left_mcp_add_ics_add_components_p + ff_right_mcp_add_ics_add_components_p) -> (forall ff_index_mcp_add_ics_add_components_n ff_left_mcp_add_ics_add_components_n ff_right_mcp_add_ics_add_components_n ff_target_mcp_add_ics_add_components_n. (exists mcp_gap_ics_add_components_n_bound. mcp_gap_ics_add_components_n_bound + S (ff_index_mcp_add_ics_add_components_n) = (l)) -> (((exists fs_h_mcp_ics_add_components_n_left. fs_h_mcp_ics_add_components_n_left + S (ff_left_mcp_add_ics_add_components_n) = S ((S (ff_index_mcp_add_ics_add_components_n)) * dc)) /\ exists fs_q_mcp_ics_add_components_n_left. db = fs_q_mcp_ics_add_components_n_left * S ((S (ff_index_mcp_add_ics_add_components_n)) * dc) + (ff_left_mcp_add_ics_add_components_n))) -> (((exists fs_h_mcp_ics_add_components_n_right. fs_h_mcp_ics_add_components_n_right + S (ff_right_mcp_add_ics_add_components_n) = S ((S (ff_index_mcp_add_ics_add_components_n)) * fc)) /\ exists fs_q_mcp_ics_add_components_n_right. fb = fs_q_mcp_ics_add_components_n_right * S ((S (ff_index_mcp_add_ics_add_components_n)) * fc) + (ff_right_mcp_add_ics_add_components_n))) -> (((exists fs_h_mcp_ics_add_components_n_target. fs_h_mcp_ics_add_components_n_target + S (ff_target_mcp_add_ics_add_components_n) = S ((S (ff_index_mcp_add_ics_add_components_n)) * nc)) /\ exists fs_q_mcp_ics_add_components_n_target. nb = fs_q_mcp_ics_add_components_n_target * S ((S (ff_index_mcp_add_ics_add_components_n)) * nc) + (ff_target_mcp_add_ics_add_components_n))) -> ff_target_mcp_add_ics_add_components_n = ff_left_mcp_add_ics_add_components_n + ff_right_mcp_add_ics_add_components_n) -> (forall ics_index_add_components_result ics_value0_add_components_result ics_value1_add_components_result ics_value2_add_components_result ics_value3_add_components_result ics_value4_add_components_result ics_value5_add_components_result. (exists ics_gap_add_components_result_bound. ics_gap_add_components_result_bound + S (ics_index_add_components_result) = (l)) -> (((exists fs_h_ics_add_components_result_at0. fs_h_ics_add_components_result_at0 + S (ics_value0_add_components_result) = S ((S (ics_index_add_components_result)) * ac)) /\ exists fs_q_ics_add_components_result_at0. ab = fs_q_ics_add_components_result_at0 * S ((S (ics_index_add_components_result)) * ac) + (ics_value0_add_components_result))) -> (((exists fs_h_ics_add_components_result_at1. fs_h_ics_add_components_result_at1 + S (ics_value1_add_components_result) = S ((S (ics_index_add_components_result)) * dc)) /\ exists fs_q_ics_add_components_result_at1. db = fs_q_ics_add_components_result_at1 * S ((S (ics_index_add_components_result)) * dc) + (ics_value1_add_components_result))) -> (((exists fs_h_ics_add_components_result_at2. fs_h_ics_add_components_result_at2 + S (ics_value2_add_components_result) = S ((S (ics_index_add_components_result)) * ec)) /\ exists fs_q_ics_add_components_result_at2. eb = fs_q_ics_add_components_result_at2 * S ((S (ics_index_add_components_result)) * ec) + (ics_value2_add_components_result))) -> (((exists fs_h_ics_add_components_result_at3. fs_h_ics_add_components_result_at3 + S (ics_value3_add_components_result) = S ((S (ics_index_add_components_result)) * fc)) /\ exists fs_q_ics_add_components_result_at3. fb = fs_q_ics_add_components_result_at3 * S ((S (ics_index_add_components_result)) * fc) + (ics_value3_add_components_result))) -> (((exists fs_h_ics_add_components_result_at4. fs_h_ics_add_components_result_at4 + S (ics_value4_add_components_result) = S ((S (ics_index_add_components_result)) * pc)) /\ exists fs_q_ics_add_components_result_at4. pb = fs_q_ics_add_components_result_at4 * S ((S (ics_index_add_components_result)) * pc) + (ics_value4_add_components_result))) -> (((exists fs_h_ics_add_components_result_at5. fs_h_ics_add_components_result_at5 + S (ics_value5_add_components_result) = S ((S (ics_index_add_components_result)) * nc)) /\ exists fs_q_ics_add_components_result_at5. nb = fs_q_ics_add_components_result_at5 * S ((S (ics_index_add_components_result)) * nc) + (ics_value5_add_components_result))) -> ics_value4_add_components_result + (ics_value1_add_components_result + ics_value3_add_components_result) = (ics_value0_add_components_result + ics_value2_add_components_result) + ics_value5_add_components_result)Constructive proof overview
Generated structural guide
Actual coded component sums yield integer-vector addition without requiring canonical representatives.
The unchanged tactic script uses 0 declared prerequisites and contains 52 exact native proof lines.
Alpha v34 checked-use · first admitted v27 · 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–20
03Fix variables and assumptionsL21–29
04Establish hpL30–39
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply hpositive.
05Establish hnL40–49
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply hnegative.
Original exact command ledger · 52 lines
- 0001
intro ab - 0002
intro ac - 0003
intro db - 0004
intro dc - 0005
intro eb - 0006
intro ec - 0007
intro fb - 0008
intro fc - 0009
intro pb - 0010
intro pc - 0011
intro nb - 0012
intro nc - 0013
intro l - 0014
intro hpositive - 0015
intro hnegative - 0016
intro i - 0017
intro a - 0018
intro b - 0019
intro c - 0020
intro d - 0021
intro e - 0022
intro f - 0023
intro hi - 0024
intro ha - 0025
intro hb - 0026
intro hc - 0027
intro hd - 0028
intro he - 0029
intro hf - 0030
have hp : e = a + c - 0031
specialize hpositive (i) - 0032
specialize hpositive (a) - 0033
specialize hpositive (c) - 0034
specialize hpositive (e) - 0035
apply hpositive - 0036
exact hi - 0037
exact ha - 0038
exact hc - 0039
exact he - 0040
have hn : f = b + d - 0041
specialize hnegative (i) - 0042
specialize hnegative (b) - 0043
specialize hnegative (d) - 0044
specialize hnegative (f) - 0045
apply hnegative - 0046
exact hi - 0047
exact hb - 0048
exact hd - 0049
exact hf - 0050
rewrite hp - 0051
rewrite hn - 0052
refl