Exact expanded PA statement
forall N c b e k P z. (forall t. (exists h. S t + S h = S N) -> exists q. c = S t * q) -> (exists h. h + S k = N) -> ~(P = 0) -> (forall i. (exists h. h + S i = k) -> exists q. P = S ((S i) * c) * q) -> (forall i a. (exists h. h + S i = k) -> ((exists h. h + S a = S ((S i) * e)) /\ exists q. b = q * S ((S i) * e) + a) -> exists u v. z + S ((S i) * c) * u = a + S ((S i) * c) * v) -> (forall j. (exists g. g + k = j) -> (exists h. h + j = N) -> forall d. (exists u. P = d * u) -> (exists v. S ((S j) * c) = d * v) -> d = 1) -> exists z2. (~(P * S ((S k) * c) = 0) /\ ((forall i. (exists h. h + S i = S k) -> exists q. P * S ((S k) * c) = S ((S i) * c) * q) /\ ((forall i a. (exists h. h + S i = S k) -> ((exists h. h + S a = S ((S i) * e)) /\ exists q. b = q * S ((S i) * e) + a) -> exists u v. z2 + S ((S i) * c) * u = a + S ((S i) * c) * v) /\ forall j. (exists g. g + S k = j) -> (exists h. h + j = N) -> forall d. (exists u. P * S ((S k) * c) = d * u) -> (exists v. S ((S j) * c) = d * v) -> d = 1)))Structural proof guide
Generated structural guide
Combine modulus-product and cross-base congruence updates for an exclusive prefix.
Use the direct prerequisites beta_exclusive_accumulated_product_step, beta_exclusive_recode_congruence_step as previously established PA formulas.
The proof proceeds by case analysis (3), intermediate claims (2).
Referenced ingredients
Proof neighborhood
Direct dependencies
Direct dependents
Formal 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 N - 0002
intro c - 0003
intro b - 0004
intro e - 0005
intro k - 0006
intro P - 0007
intro z - 0008
intro hcm - 0009
intro hkN - 0010
intro hP - 0011
intro hdiv - 0012
intro hcong - 0013
intro hfuture - 0014
have hproduct : (~(P * S ((S k) * c) = 0) /\ ((forall i. (exists h. h + S i = S k) -> exists q. P * S ((S k) * c) = S ((S i) * c) * q) /\ forall j. (exists g. g + S k = j) -> (exists h. h + j = N) -> forall d. (exists u. P * S ((S k) * c) = d * u) -> (exists v. S ((S j) * c) = d * v) -> d = 1)) - 0015
specialize beta_exclusive_accumulated_product_step N - 0016
specialize beta_exclusive_accumulated_product_step c - 0017
specialize beta_exclusive_accumulated_product_step k - 0018
specialize beta_exclusive_accumulated_product_step P - 0019
apply beta_exclusive_accumulated_product_step - 0020
exact hcm - 0021
exact hkN - 0022
exact hP - 0023
exact hdiv - 0024
exact hfuture - 0025
have hcodes : exists z2. forall i a. (exists h. h + S i = S k) -> ((exists h. h + S a = S ((S i) * e)) /\ exists q. b = q * S ((S i) * e) + a) -> exists u v. z2 + S ((S i) * c) * u = a + S ((S i) * c) * v - 0026
specialize beta_exclusive_recode_congruence_step N - 0027
specialize beta_exclusive_recode_congruence_step c - 0028
specialize beta_exclusive_recode_congruence_step b - 0029
specialize beta_exclusive_recode_congruence_step e - 0030
specialize beta_exclusive_recode_congruence_step k - 0031
specialize beta_exclusive_recode_congruence_step P - 0032
specialize beta_exclusive_recode_congruence_step z - 0033
apply beta_exclusive_recode_congruence_step - 0034
exact hkN - 0035
exact hP - 0036
exact hdiv - 0037
exact hcong - 0038
exact hfuture - 0039
cases hcodes - 0040
cases hproduct - 0041
cases hproduct_right - 0042
exists x - 0043
split - 0044
exact hproduct_left - 0045
split - 0046
exact hproduct_right_left - 0047
split - 0048
exact hcodes_witness - 0049
exact hproduct_right_right