Exact expanded PA statement
forall b c n. (exists u v. (((exists h. h + S 1 = S ((S 0) * v)) /\ exists q. u = q * S ((S 0) * v) + 1) /\ (((exists h. h + S n = S ((S 0) * v)) /\ exists q. u = q * S ((S 0) * v) + n) /\ forall i. (exists h. h + S i = 0) -> exists p r s. (((exists h. h + S p = S ((S i) * c)) /\ exists q. b = q * S ((S i) * c) + p) /\ (((exists h. h + S r = S ((S i) * v)) /\ exists q. u = q * S ((S i) * v) + r) /\ (((exists h. h + S s = S ((S S i) * v)) /\ exists q. u = q * S ((S S i) * v) + s) /\ s = r * p)))))) -> n = 1Structural proof guide
Generated structural guide
The product of an empty decoded prefix is one.
Use the direct prerequisites beta_at_unique as previously established PA formulas.
The proof proceeds by case analysis (4).
Referenced ingredients
Proof neighborhood
Direct dependencies
Direct dependents
PA004B pow_zero PA0066 factorial_zero PA007I beta_sign_factor_product_power PA007N beta_product_pointwise_mul_exact PA007Q beta_product_pointwise_scale_mod PA007X beta_product_permutation_invariant PA0081 beta_product_pointwise_coprime PA00A0 beta_adjacent_target_pairs_product_power PA00B9 beta_adjacent_unit_pairs_product_one PA00BG beta_range_two_product_is_factorial_succFormal native tactic body
Dependencies are introduced as named hypotheses before line 1. Linked names are exact direct references. This Stable checked-use theorem is independently kernel-checked when replayed.
- 0001
intro b - 0002
intro c - 0003
intro n - 0004
intro hproduct - 0005
cases hproduct - 0006
cases hproduct_witness - 0007
cases hproduct_witness_witness - 0008
cases hproduct_witness_witness_right - 0009
specialize beta_at_unique x - 0010
specialize beta_at_unique x1 - 0011
specialize beta_at_unique 0 - 0012
specialize beta_at_unique n - 0013
specialize beta_at_unique 1 - 0014
apply beta_at_unique - 0015
exact hproduct_witness_witness_right_left - 0016
exact hproduct_witness_witness_left