Exact expanded PA statement
forall a e n. e = 0 -> (exists ff_b_z ff_c_z. ((forall ff_i_z_repeat. (exists ff_lt_z_repeat_bound. ff_lt_z_repeat_bound + S ff_i_z_repeat = e) -> (((exists ff_h_z_repeat_decoded. ff_h_z_repeat_decoded + S (a) = S ((S (ff_i_z_repeat)) * ff_c_z)) /\ exists ff_q_z_repeat_decoded. ff_b_z = ff_q_z_repeat_decoded * S ((S (ff_i_z_repeat)) * ff_c_z) + (a)))) /\ (exists ff_u_z_product ff_v_z_product. ((((exists ff_h_z_product_start. ff_h_z_product_start + S (1) = S ((S (0)) * ff_v_z_product)) /\ exists ff_q_z_product_start. ff_u_z_product = ff_q_z_product_start * S ((S (0)) * ff_v_z_product) + (1))) /\ ((((exists ff_h_z_product_terminal. ff_h_z_product_terminal + S (n) = S ((S (e)) * ff_v_z_product)) /\ exists ff_q_z_product_terminal. ff_u_z_product = ff_q_z_product_terminal * S ((S (e)) * ff_v_z_product) + (n))) /\ forall ff_i_z_product. (exists ff_lt_z_product_bound. ff_lt_z_product_bound + S ff_i_z_product = e) -> exists ff_p_z_product ff_r_z_product ff_s_z_product. ((((exists ff_h_z_product_factor. ff_h_z_product_factor + S (ff_p_z_product) = S ((S (ff_i_z_product)) * ff_c_z)) /\ exists ff_q_z_product_factor. ff_b_z = ff_q_z_product_factor * S ((S (ff_i_z_product)) * ff_c_z) + (ff_p_z_product))) /\ ((((exists ff_h_z_product_partial. ff_h_z_product_partial + S (ff_r_z_product) = S ((S (ff_i_z_product)) * ff_v_z_product)) /\ exists ff_q_z_product_partial. ff_u_z_product = ff_q_z_product_partial * S ((S (ff_i_z_product)) * ff_v_z_product) + (ff_r_z_product))) /\ ((((exists ff_h_z_product_successor. ff_h_z_product_successor + S (ff_s_z_product) = S ((S (S ff_i_z_product)) * ff_v_z_product)) /\ exists ff_q_z_product_successor. ff_u_z_product = ff_q_z_product_successor * S ((S (S ff_i_z_product)) * ff_v_z_product) + (ff_s_z_product))) /\ ff_s_z_product = ff_r_z_product * ff_p_z_product)))))))) -> n = 1Structural proof guide
The relational zeroth power is one.
Direct prerequisites: beta_product_zero. The authored body proceeds by case analysis (3), equality transport (4).
Proof neighborhood
Direct dependencies
Direct dependents
BT0093 pow_one_from_zero_successor BT009X pow_add BT00PY pow_base_monotone BT00Q0 one_le_pow BT00Q4 power_divides_zero BT00QV pow_mul_base BT00SM pow_mul_exp_from_total BT00VM central_binom_strong_upper_of_laws BT00VV primorial_le_four_pow_bounded BT00W4 pow_three_five_le_pow_four_four_from_total BT00Y5 central_binom_prime_power_contribution_le_double BT00YM no_bertrand_central_prime_contribution_ranges BT00YU coprime_power_right BT00YV coprime_powersFormal 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
intro n - 0004
intro he - 0005
intro hpow - 0006
rewrite he at hpow - 0007
rewrite he at hpow - 0008
rewrite he at hpow - 0009
rewrite he at hpow - 0010
cases hpow - 0011
cases hpow_witness - 0012
cases hpow_witness_witness - 0013
specialize beta_product_zero x - 0014
specialize beta_product_zero x1 - 0015
specialize beta_product_zero n - 0016
apply beta_product_zero - 0017
exact hpow_witness_witness_right