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 a h e m r d s. (exists ff_power_binary_previous_power. ((exists ff_b_binary_previous_power_value ff_c_binary_previous_power_value. ((forall ff_i_binary_previous_power_value_repeat. (exists ff_lt_binary_previous_power_value_repeat_bound. ff_lt_binary_previous_power_value_repeat_bound + S ff_i_binary_previous_power_value_repeat = h) -> (((exists ff_h_binary_previous_power_value_repeat_decoded. ff_h_binary_previous_power_value_repeat_decoded + S (a) = S ((S (ff_i_binary_previous_power_value_repeat)) * ff_c_binary_previous_power_value)) /\ exists ff_q_binary_previous_power_value_repeat_decoded. ff_b_binary_previous_power_value = ff_q_binary_previous_power_value_repeat_decoded * S ((S (ff_i_binary_previous_power_value_repeat)) * ff_c_binary_previous_power_value) + (a)))) /\ (exists ff_u_binary_previous_power_value_product ff_v_binary_previous_power_value_product. ((((exists ff_h_binary_previous_power_value_product_start. ff_h_binary_previous_power_value_product_start + S (1) = S ((S (0)) * ff_v_binary_previous_power_value_product)) /\ exists ff_q_binary_previous_power_value_product_start. ff_u_binary_previous_power_value_product = ff_q_binary_previous_power_value_product_start * S ((S (0)) * ff_v_binary_previous_power_value_product) + (1))) /\ ((((exists ff_h_binary_previous_power_value_product_terminal. ff_h_binary_previous_power_value_product_terminal + S (ff_power_binary_previous_power) = S ((S (h)) * ff_v_binary_previous_power_value_product)) /\ exists ff_q_binary_previous_power_value_product_terminal. ff_u_binary_previous_power_value_product = ff_q_binary_previous_power_value_product_terminal * S ((S (h)) * ff_v_binary_previous_power_value_product) + (ff_power_binary_previous_power))) /\ forall ff_i_binary_previous_power_value_product. (exists ff_lt_binary_previous_power_value_product_bound. ff_lt_binary_previous_power_value_product_bound + S ff_i_binary_previous_power_value_product = h) -> exists ff_p_binary_previous_power_value_product ff_r_binary_previous_power_value_product ff_s_binary_previous_power_value_product. ((((exists ff_h_binary_previous_power_value_product_factor. ff_h_binary_previous_power_value_product_factor + S (ff_p_binary_previous_power_value_product) = S ((S (ff_i_binary_previous_power_value_product)) * ff_c_binary_previous_power_value)) /\ exists ff_q_binary_previous_power_value_product_factor. ff_b_binary_previous_power_value = ff_q_binary_previous_power_value_product_factor * S ((S (ff_i_binary_previous_power_value_product)) * ff_c_binary_previous_power_value) + (ff_p_binary_previous_power_value_product))) /\ ((((exists ff_h_binary_previous_power_value_product_partial. ff_h_binary_previous_power_value_product_partial + S (ff_r_binary_previous_power_value_product) = S ((S (ff_i_binary_previous_power_value_product)) * ff_v_binary_previous_power_value_product)) /\ exists ff_q_binary_previous_power_value_product_partial. ff_u_binary_previous_power_value_product = ff_q_binary_previous_power_value_product_partial * S ((S (ff_i_binary_previous_power_value_product)) * ff_v_binary_previous_power_value_product) + (ff_r_binary_previous_power_value_product))) /\ ((((exists ff_h_binary_previous_power_value_product_successor. ff_h_binary_previous_power_value_product_successor + S (ff_s_binary_previous_power_value_product) = S ((S (S ff_i_binary_previous_power_value_product)) * ff_v_binary_previous_power_value_product)) /\ exists ff_q_binary_previous_power_value_product_successor. ff_u_binary_previous_power_value_product = ff_q_binary_previous_power_value_product_successor * S ((S (S ff_i_binary_previous_power_value_product)) * ff_v_binary_previous_power_value_product) + (ff_s_binary_previous_power_value_product))) /\ ff_s_binary_previous_power_value_product = ff_r_binary_previous_power_value_product * ff_p_binary_previous_power_value_product)))))))) /\ (((exists ff_gap_binary_previous_power_residue. ff_gap_binary_previous_power_residue + S (r) = m) /\ (exists ff_left_binary_previous_power_residue_congruence ff_right_binary_previous_power_residue_congruence. (ff_power_binary_previous_power) + m * ff_left_binary_previous_power_residue_congruence = (r) + m * ff_right_binary_previous_power_residue_congruence))))) -> ((((d = 0) \/ (d = 1)) /\ e = (h + h) + d)) -> ((((d = 0) /\ (((exists ff_gap_binary_step_square. ff_gap_binary_step_square + S (s) = m) /\ (exists ff_left_binary_step_square_congruence ff_right_binary_step_square_congruence. (r * r) + m * ff_left_binary_step_square_congruence = (s) + m * ff_right_binary_step_square_congruence)))) \/ ((d = 1) /\ (((exists ff_gap_binary_step_multiply. ff_gap_binary_step_multiply + S (s) = m) /\ (exists ff_left_binary_step_multiply_congruence ff_right_binary_step_multiply_congruence. ((r * r) * a) + m * ff_left_binary_step_multiply_congruence = (s) + m * ff_right_binary_step_multiply_congruence)))))) -> (exists ff_power_binary_current_power. ((exists ff_b_binary_current_power_value ff_c_binary_current_power_value. ((forall ff_i_binary_current_power_value_repeat. (exists ff_lt_binary_current_power_value_repeat_bound. ff_lt_binary_current_power_value_repeat_bound + S ff_i_binary_current_power_value_repeat = e) -> (((exists ff_h_binary_current_power_value_repeat_decoded. ff_h_binary_current_power_value_repeat_decoded + S (a) = S ((S (ff_i_binary_current_power_value_repeat)) * ff_c_binary_current_power_value)) /\ exists ff_q_binary_current_power_value_repeat_decoded. ff_b_binary_current_power_value = ff_q_binary_current_power_value_repeat_decoded * S ((S (ff_i_binary_current_power_value_repeat)) * ff_c_binary_current_power_value) + (a)))) /\ (exists ff_u_binary_current_power_value_product ff_v_binary_current_power_value_product. ((((exists ff_h_binary_current_power_value_product_start. ff_h_binary_current_power_value_product_start + S (1) = S ((S (0)) * ff_v_binary_current_power_value_product)) /\ exists ff_q_binary_current_power_value_product_start. ff_u_binary_current_power_value_product = ff_q_binary_current_power_value_product_start * S ((S (0)) * ff_v_binary_current_power_value_product) + (1))) /\ ((((exists ff_h_binary_current_power_value_product_terminal. ff_h_binary_current_power_value_product_terminal + S (ff_power_binary_current_power) = S ((S (e)) * ff_v_binary_current_power_value_product)) /\ exists ff_q_binary_current_power_value_product_terminal. ff_u_binary_current_power_value_product = ff_q_binary_current_power_value_product_terminal * S ((S (e)) * ff_v_binary_current_power_value_product) + (ff_power_binary_current_power))) /\ forall ff_i_binary_current_power_value_product. (exists ff_lt_binary_current_power_value_product_bound. ff_lt_binary_current_power_value_product_bound + S ff_i_binary_current_power_value_product = e) -> exists ff_p_binary_current_power_value_product ff_r_binary_current_power_value_product ff_s_binary_current_power_value_product. ((((exists ff_h_binary_current_power_value_product_factor. ff_h_binary_current_power_value_product_factor + S (ff_p_binary_current_power_value_product) = S ((S (ff_i_binary_current_power_value_product)) * ff_c_binary_current_power_value)) /\ exists ff_q_binary_current_power_value_product_factor. ff_b_binary_current_power_value = ff_q_binary_current_power_value_product_factor * S ((S (ff_i_binary_current_power_value_product)) * ff_c_binary_current_power_value) + (ff_p_binary_current_power_value_product))) /\ ((((exists ff_h_binary_current_power_value_product_partial. ff_h_binary_current_power_value_product_partial + S (ff_r_binary_current_power_value_product) = S ((S (ff_i_binary_current_power_value_product)) * ff_v_binary_current_power_value_product)) /\ exists ff_q_binary_current_power_value_product_partial. ff_u_binary_current_power_value_product = ff_q_binary_current_power_value_product_partial * S ((S (ff_i_binary_current_power_value_product)) * ff_v_binary_current_power_value_product) + (ff_r_binary_current_power_value_product))) /\ ((((exists ff_h_binary_current_power_value_product_successor. ff_h_binary_current_power_value_product_successor + S (ff_s_binary_current_power_value_product) = S ((S (S ff_i_binary_current_power_value_product)) * ff_v_binary_current_power_value_product)) /\ exists ff_q_binary_current_power_value_product_successor. ff_u_binary_current_power_value_product = ff_q_binary_current_power_value_product_successor * S ((S (S ff_i_binary_current_power_value_product)) * ff_v_binary_current_power_value_product) + (ff_s_binary_current_power_value_product))) /\ ff_s_binary_current_power_value_product = ff_r_binary_current_power_value_product * ff_p_binary_current_power_value_product)))))))) /\ (((exists ff_gap_binary_current_power_residue. ff_gap_binary_current_power_residue + S (s) = m) /\ (exists ff_left_binary_current_power_residue_congruence ff_right_binary_current_power_residue_congruence. (ff_power_binary_current_power) + m * ff_left_binary_current_power_residue_congruence = (s) + m * ff_right_binary_current_power_residue_congruence)))))Constructive proof overview
Generated structural guide
Every actual zero-or-one modular transition preserves the matching binary-prefix power.
The unchanged tactic script uses 3 declared prerequisites and contains 60 exact native proof lines.
Alpha v34 checked-use · first admitted v22 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
BE0007 binary_execution_even_power_invariant BE0008 binary_execution_odd_power_invariant succ_ne_zero 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.
Named ingredients (2)
01Fix variables and assumptionsL1–10
02Separate the logical casesL11–12
03Calculate and transport equalitiesL13–14
04Separate the logical casesL15–16
05Establish hevenL17–26
Establish this local claim before using it. It is not an additional assumption.
- L17
have heven : e = h + h - L18
trans (h + h) + 0 - L19
exact hsplit_right - L20
simp - L21
specialize binary_execution_even_power_invariant a - L22
specialize binary_execution_even_power_invariant h - L23
specialize binary_execution_even_power_invariant e - L24
specialize binary_execution_even_power_invariant m - L25
specialize binary_execution_even_power_invariant r - L26
specialize binary_execution_even_power_invariant s
06Use earlier factsL27–30
07Separate the logical casesL31–31
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L31
cases hstep_right
08Calculate and transport equalitiesL32–32
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L32
rewrite hsplit_left_left at hstep_right_left
09Separate the logical casesL33–33
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L33
exfalso
10Use earlier factsL34–35
11Calculate and transport equalitiesL36–36
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L36
symm
12Use earlier factsL37–37
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L37
exact hstep_right_left
13Calculate and transport equalitiesL38–39
14Separate the logical casesL40–42
15Use earlier factsL43–45
16Separate the logical casesL46–46
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L46
cases hstep_right
17Establish hoddL47–56
Establish this local claim before using it. It is not an additional assumption.
- L47
have hodd : e = S (h + h) - L48
trans (h + h) + 1 - L49
exact hsplit_right - L50
simp - L51
specialize binary_execution_odd_power_invariant a - L52
specialize binary_execution_odd_power_invariant h - L53
specialize binary_execution_odd_power_invariant e - L54
specialize binary_execution_odd_power_invariant m - L55
specialize binary_execution_odd_power_invariant r - L56
specialize binary_execution_odd_power_invariant s
Original exact command ledger · 60 lines
- 0001
intro a - 0002
intro h - 0003
intro e - 0004
intro m - 0005
intro r - 0006
intro d - 0007
intro s - 0008
intro hpower - 0009
intro hsplit - 0010
intro hstep - 0011
cases hsplit - 0012
cases hsplit_left - 0013
rewrite hsplit_left_left at hsplit_right - 0014
rewrite hsplit_left_left at hstep - 0015
cases hstep - 0016
cases hstep_left - 0017
have heven : e = h + h - 0018
trans (h + h) + 0 - 0019
exact hsplit_right - 0020
simp - 0021
specialize binary_execution_even_power_invariant a - 0022
specialize binary_execution_even_power_invariant h - 0023
specialize binary_execution_even_power_invariant e - 0024
specialize binary_execution_even_power_invariant m - 0025
specialize binary_execution_even_power_invariant r - 0026
specialize binary_execution_even_power_invariant s - 0027
apply binary_execution_even_power_invariant - 0028
exact heven - 0029
exact hpower - 0030
exact hstep_left_right - 0031
cases hstep_right - 0032
rewrite hsplit_left_left at hstep_right_left - 0033
exfalso - 0034
specialize succ_ne_zero 0 - 0035
apply succ_ne_zero - 0036
symm - 0037
exact hstep_right_left - 0038
rewrite hsplit_left_right at hsplit_right - 0039
rewrite hsplit_left_right at hstep - 0040
cases hstep - 0041
cases hstep_left - 0042
exfalso - 0043
specialize succ_ne_zero 0 - 0044
apply succ_ne_zero - 0045
exact hstep_left_left - 0046
cases hstep_right - 0047
have hodd : e = S (h + h) - 0048
trans (h + h) + 1 - 0049
exact hsplit_right - 0050
simp - 0051
specialize binary_execution_odd_power_invariant a - 0052
specialize binary_execution_odd_power_invariant h - 0053
specialize binary_execution_odd_power_invariant e - 0054
specialize binary_execution_odd_power_invariant m - 0055
specialize binary_execution_odd_power_invariant r - 0056
specialize binary_execution_odd_power_invariant s - 0057
apply binary_execution_odd_power_invariant - 0058
exact hodd - 0059
exact hpower - 0060
exact hstep_right_right