PA008T

prime_scaled_inverse_prefix_exists

Alpha v16 checked-use theorem · independently closed; not Stable

A prime predecessor interval has a full beta-coded scaled-inverse map.

Exact expanded PA statement

forall p a n. p = S n -> ((~(p = 1) /\ forall esi_prime_left_esip_full_prime esi_prime_right_esip_full_prime. p = esi_prime_left_esip_full_prime * esi_prime_right_esip_full_prime -> esi_prime_left_esip_full_prime = 1 \/ esi_prime_right_esip_full_prime = 1)) -> ~(a = 0) -> (exists esip_gap_full_target_bound. esip_gap_full_target_bound + S (a) = p) -> exists b c. (forall esip_index_full_result. (exists esip_gap_full_result_prefix_bound. esip_gap_full_result_prefix_bound + S (esip_index_full_result) = n) -> exists esip_mate_full_result. ((((exists ff_h_esip_full_result_entry. ff_h_esip_full_result_entry + S (esip_mate_full_result) = S ((S (esip_index_full_result)) * c)) /\ exists ff_q_esip_full_result_entry. b = ff_q_esip_full_result_entry * S ((S (esip_index_full_result)) * c) + (esip_mate_full_result))) /\ ((exists esip_gap_full_result_relation_index_bound. esip_gap_full_result_relation_index_bound + S (esip_index_full_result) = n) /\ ((((~((S esip_index_full_result) = 0) /\ (exists esip_gap_full_result_relation_scaled_left_bound. esip_gap_full_result_relation_scaled_left_bound + S (S esip_index_full_result) = p))) /\ (((~(esip_mate_full_result = 0) /\ (exists esip_gap_full_result_relation_scaled_right_bound. esip_gap_full_result_relation_scaled_right_bound + S (esip_mate_full_result) = p))) /\ (exists esi_mod_left_full_result_relation_scaled_mod esi_mod_right_full_result_relation_scaled_mod. ((S esip_index_full_result) * esip_mate_full_result) + p * esi_mod_left_full_result_relation_scaled_mod = (a) + p * esi_mod_right_full_result_relation_scaled_mod)))))))

Structural proof guide

Generated structural guide

A prime predecessor interval has a full beta-coded scaled-inverse map.

Use the direct prerequisites le_refl, prime_scaled_inverse_prefix_exists_bounded as previously established PA formulas.

The proof proceeds by direct introduction and elimination.

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.

  1. 0001intro p
  2. 0002intro a
  3. 0003intro n
  4. 0004intro hpn
  5. 0005intro hp
  6. 0006intro ha0
  7. 0007intro hap
  8. 0008specialize prime_scaled_inverse_prefix_exists_bounded p
  9. 0009specialize prime_scaled_inverse_prefix_exists_bounded a
  10. 0010specialize prime_scaled_inverse_prefix_exists_bounded n
  11. 0011specialize prime_scaled_inverse_prefix_exists_bounded n
  12. 0012apply prime_scaled_inverse_prefix_exists_bounded
  13. 0013exact hpn
  14. 0014exact hp
  15. 0015exact ha0
  16. 0016exact hap
  17. 0017specialize le_refl n
  18. 0018exact le_refl