Exact expanded PA statement
forall a e. exists n. (exists ff_b_x ff_c_x. ((forall ff_i_x_repeat. (exists ff_lt_x_repeat_bound. ff_lt_x_repeat_bound + S ff_i_x_repeat = e) -> (((exists ff_h_x_repeat_decoded. ff_h_x_repeat_decoded + S (a) = S ((S (ff_i_x_repeat)) * ff_c_x)) /\ exists ff_q_x_repeat_decoded. ff_b_x = ff_q_x_repeat_decoded * S ((S (ff_i_x_repeat)) * ff_c_x) + (a)))) /\ (exists ff_u_x_product ff_v_x_product. ((((exists ff_h_x_product_start. ff_h_x_product_start + S (1) = S ((S (0)) * ff_v_x_product)) /\ exists ff_q_x_product_start. ff_u_x_product = ff_q_x_product_start * S ((S (0)) * ff_v_x_product) + (1))) /\ ((((exists ff_h_x_product_terminal. ff_h_x_product_terminal + S (n) = S ((S (e)) * ff_v_x_product)) /\ exists ff_q_x_product_terminal. ff_u_x_product = ff_q_x_product_terminal * S ((S (e)) * ff_v_x_product) + (n))) /\ forall ff_i_x_product. (exists ff_lt_x_product_bound. ff_lt_x_product_bound + S ff_i_x_product = e) -> exists ff_p_x_product ff_r_x_product ff_s_x_product. ((((exists ff_h_x_product_factor. ff_h_x_product_factor + S (ff_p_x_product) = S ((S (ff_i_x_product)) * ff_c_x)) /\ exists ff_q_x_product_factor. ff_b_x = ff_q_x_product_factor * S ((S (ff_i_x_product)) * ff_c_x) + (ff_p_x_product))) /\ ((((exists ff_h_x_product_partial. ff_h_x_product_partial + S (ff_r_x_product) = S ((S (ff_i_x_product)) * ff_v_x_product)) /\ exists ff_q_x_product_partial. ff_u_x_product = ff_q_x_product_partial * S ((S (ff_i_x_product)) * ff_v_x_product) + (ff_r_x_product))) /\ ((((exists ff_h_x_product_successor. ff_h_x_product_successor + S (ff_s_x_product) = S ((S (S ff_i_x_product)) * ff_v_x_product)) /\ exists ff_q_x_product_successor. ff_u_x_product = ff_q_x_product_successor * S ((S (S ff_i_x_product)) * ff_v_x_product) + (ff_s_x_product))) /\ ff_s_x_product = ff_r_x_product * ff_p_x_product))))))))Structural proof guide
Every base and exponent have a relational finite-product power.
Direct prerequisites: beta_repeat_exists, beta_product_exists. The authored body proceeds by case analysis (5), intermediate claims (1).
Proof neighborhood
Direct dependencies
Direct dependents
BT00Q3 power_divides_decidable BT00Q4 power_divides_zero BT00QK power_divides_exponent_antitone BT00QL power_divides_add_mul BT00QM power_divides_successor_of_cofactor BT00QQ power_valuation_mul_successor_not_divides BT00S0 prime_power_quotient_prefix_exists BT00S5 pow_successor_compose BT00VV primorial_le_four_pow_bounded BT00X3 bertrand_hj_envelope_thirty_two BT00X7 bertrand_main_inequality_factorized BT00XJ pow_le_pow_of_exponent_le BT00Y6 central_binom_prime_square_tail_exponent_not_two_le BT00YE central_binom_prime_valuation_zero_two_thirds_range BT00YI central_binom_prime_above_floor_sqrt_valuation_le_one BT00YN prime_contribution_choice_exists BT0115 bertrand_eventually_closed_upperFormal native tactic body
Dependencies are hypotheses of this body receipt. The focused endpoint audits separately check the complete empty-context certificates.
- 0001
intro a - 0002
intro e - 0003
have hrepeat : exists b c. (forall i. (exists h. h + S i = e) -> ((exists h. h + S a = S ((S i) * c)) /\ exists q. b = q * S ((S i) * c) + a)) - 0004
specialize beta_repeat_exists a - 0005
specialize beta_repeat_exists e - 0006
exact beta_repeat_exists - 0007
cases hrepeat - 0008
cases hrepeat_witness - 0009
specialize beta_product_exists x - 0010
specialize beta_product_exists x1 - 0011
specialize beta_product_exists e - 0012
cases beta_product_exists - 0013
cases beta_product_exists_witness - 0014
cases beta_product_exists_witness_witness - 0015
exists x2 - 0016
exists x - 0017
exists x1 - 0018
split - 0019
exact hrepeat_witness_witness - 0020
exists x3 - 0021
exists x4 - 0022
exact beta_product_exists_witness_witness_witness