Exact expanded PA statement
forall p n k b c. p = S n -> n = S k -> (forall wip_index_zero_prefix. (exists wip_gap_zero_prefix_prefix_bound. wip_gap_zero_prefix_prefix_bound + S wip_index_zero_prefix = n) -> exists wip_mate_zero_prefix. ((((exists wip_beta_height_zero_prefix_decoded. wip_beta_height_zero_prefix_decoded + S (wip_mate_zero_prefix) = S ((S (wip_index_zero_prefix)) * c)) /\ exists wip_beta_quotient_zero_prefix_decoded. b = wip_beta_quotient_zero_prefix_decoded * S ((S (wip_index_zero_prefix)) * c) + (wip_mate_zero_prefix))) /\ ((exists wip_gap_zero_prefix_inverse_index_bound. wip_gap_zero_prefix_inverse_index_bound + S wip_index_zero_prefix = n) /\ ((exists wip_gap_zero_prefix_inverse_mate_bound. wip_gap_zero_prefix_inverse_mate_bound + S wip_mate_zero_prefix = n) /\ (exists wip_mod_left_zero_prefix_inverse_mod wip_mod_right_zero_prefix_inverse_mod. ((S wip_index_zero_prefix) * S wip_mate_zero_prefix) + p * wip_mod_left_zero_prefix_inverse_mod = 1 + p * wip_mod_right_zero_prefix_inverse_mod))))) -> (((exists wie_beta_height_zero_result. wie_beta_height_zero_result + S (0) = S ((S (0)) * c)) /\ exists wie_beta_quotient_zero_result. b = wie_beta_quotient_zero_result * S ((S (0)) * c) + (0)))Structural proof guide
Generated structural guide
The zero index, representing residue one, is fixed by the full inverse prefix.
Use the direct prerequisites mod_eq_refl, one_mul, inverse_prefix_extensional as previously established PA formulas.
The proof proceeds by intermediate claims (4), equality transport (4).
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 Alpha-v16 checked-use theorem is independently kernel-checked when replayed; it is not a Stable theorem.
- 0001
intro p - 0002
intro n - 0003
intro k - 0004
intro b - 0005
intro c - 0006
intro hpn - 0007
intro hnk - 0008
intro hprefix - 0009
have hzero_bound : exists wie_strict_gap_zero_bound. wie_strict_gap_zero_bound + S 0 = n - 0010
rewrite hnk - 0011
exists k - 0012
rewrite PA4 - 0013
rewrite PA3 - 0014
refl - 0015
have hzero_refl : exists wie_mod_left_zero_refl wie_mod_right_zero_refl. (1) + p * wie_mod_left_zero_refl = (1) + p * wie_mod_right_zero_refl - 0016
specialize mod_eq_refl p - 0017
specialize mod_eq_refl 1 - 0018
exact mod_eq_refl - 0019
have hzero_mod : exists wie_mod_left_zero wie_mod_right_zero. ((S 0) * S 0) + p * wie_mod_left_zero = (1) + p * wie_mod_right_zero - 0020
specialize one_mul 1 - 0021
rewrite one_mul - 0022
exact hzero_refl - 0023
have hzero_relation : (exists wie_strict_gap_zero_relation_index_bound. wie_strict_gap_zero_relation_index_bound + S 0 = n) /\ ((exists wie_strict_gap_zero_relation_mate_bound. wie_strict_gap_zero_relation_mate_bound + S 0 = n) /\ (exists wie_mod_left_zero_relation_mod wie_mod_right_zero_relation_mod. ((S 0) * S 0) + p * wie_mod_left_zero_relation_mod = (1) + p * wie_mod_right_zero_relation_mod)) - 0024
split - 0025
exact hzero_bound - 0026
split - 0027
exact hzero_bound - 0028
exact hzero_mod - 0029
specialize inverse_prefix_extensional p - 0030
specialize inverse_prefix_extensional n - 0031
specialize inverse_prefix_extensional b - 0032
specialize inverse_prefix_extensional c - 0033
specialize inverse_prefix_extensional n - 0034
specialize inverse_prefix_extensional 0 - 0035
specialize inverse_prefix_extensional 0 - 0036
apply inverse_prefix_extensional - 0037
exact hpn - 0038
exact hprefix - 0039
exact hzero_bound - 0040
exact hzero_relation