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 PA statement
forall a e n. e = 2 -> (exists ff_b_two ff_c_two. ((forall ff_i_two_repeat. (exists ff_lt_two_repeat_bound. ff_lt_two_repeat_bound + S ff_i_two_repeat = e) -> (((exists ff_h_two_repeat_decoded. ff_h_two_repeat_decoded + S (a) = S ((S (ff_i_two_repeat)) * ff_c_two)) /\ exists ff_q_two_repeat_decoded. ff_b_two = ff_q_two_repeat_decoded * S ((S (ff_i_two_repeat)) * ff_c_two) + (a)))) /\ (exists ff_u_two_product ff_v_two_product. ((((exists ff_h_two_product_start. ff_h_two_product_start + S (1) = S ((S (0)) * ff_v_two_product)) /\ exists ff_q_two_product_start. ff_u_two_product = ff_q_two_product_start * S ((S (0)) * ff_v_two_product) + (1))) /\ ((((exists ff_h_two_product_terminal. ff_h_two_product_terminal + S (n) = S ((S (e)) * ff_v_two_product)) /\ exists ff_q_two_product_terminal. ff_u_two_product = ff_q_two_product_terminal * S ((S (e)) * ff_v_two_product) + (n))) /\ forall ff_i_two_product. (exists ff_lt_two_product_bound. ff_lt_two_product_bound + S ff_i_two_product = e) -> exists ff_p_two_product ff_r_two_product ff_s_two_product. ((((exists ff_h_two_product_factor. ff_h_two_product_factor + S (ff_p_two_product) = S ((S (ff_i_two_product)) * ff_c_two)) /\ exists ff_q_two_product_factor. ff_b_two = ff_q_two_product_factor * S ((S (ff_i_two_product)) * ff_c_two) + (ff_p_two_product))) /\ ((((exists ff_h_two_product_partial. ff_h_two_product_partial + S (ff_r_two_product) = S ((S (ff_i_two_product)) * ff_v_two_product)) /\ exists ff_q_two_product_partial. ff_u_two_product = ff_q_two_product_partial * S ((S (ff_i_two_product)) * ff_v_two_product) + (ff_r_two_product))) /\ ((((exists ff_h_two_product_successor. ff_h_two_product_successor + S (ff_s_two_product) = S ((S (S ff_i_two_product)) * ff_v_two_product)) /\ exists ff_q_two_product_successor. ff_u_two_product = ff_q_two_product_successor * S ((S (S ff_i_two_product)) * ff_v_two_product) + (ff_s_two_product))) /\ ff_s_two_product = ff_r_two_product * ff_p_two_product)))))))) -> n = a * aStructural proof guide
The relational second power is exactly the square.
Direct prerequisites: pow_two_from_one_successor. The authored body proceeds by direct introduction and elimination.
Proof neighborhood
Direct dependencies
Direct dependents
BT00QW pow_two_base_two_value_four BT00U1 pow_four_four_exact BT00W5 pow_eleven_two_le_pow_two_seven_from_total BT00WO pow_thirty_six_double_block_eq_pow_six_four_block_from_total BT00X4 bertrand_floor_power_product_le_h_from_total BT00YA prime_square_tail_of_two_three_range BT00YH floor_sqrt_above_root_power_two_strictFormal native tactic body
Dependencies are hypotheses of the historical Alpha-v12 body receipt. The complete historical Alpha-v18 proof bundle independently checks every dependency; current Alpha v25 preserves that checked theorem use without changing 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 (1)
01Fix variables and assumptionsL1–5
02Use earlier factsL6–10
03Calculate and transport equalitiesL11–11
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L11
refl
Original exact command ledger · 13 lines
- 0001
intro a - 0002
intro e - 0003
intro n - 0004
intro he - 0005
intro hpow - 0006
specialize pow_two_from_one_successor a - 0007
specialize pow_two_from_one_successor 1 - 0008
specialize pow_two_from_one_successor e - 0009
specialize pow_two_from_one_successor n - 0010
apply pow_two_from_one_successor - 0011
refl - 0012
exact he - 0013
exact hpow