PA00AJ

inverse_index_symmetric

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

The bounded inverse-index relation is symmetric.

Exact expanded PA statement

forall p n i j. (((exists wip_strict_gap_symmetric_source_left_bound. wip_strict_gap_symmetric_source_left_bound + S i = n) /\ ((exists wip_strict_gap_symmetric_source_right_bound. wip_strict_gap_symmetric_source_right_bound + S j = n) /\ (exists wip_mod_left_symmetric_source_inverse wip_mod_right_symmetric_source_inverse. (S i) * S j + p * wip_mod_left_symmetric_source_inverse = 1 + p * wip_mod_right_symmetric_source_inverse)))) -> (((exists wip_strict_gap_symmetric_target_left_bound. wip_strict_gap_symmetric_target_left_bound + S j = n) /\ ((exists wip_strict_gap_symmetric_target_right_bound. wip_strict_gap_symmetric_target_right_bound + S i = n) /\ (exists wip_mod_left_symmetric_target_inverse wip_mod_right_symmetric_target_inverse. (S j) * S i + p * wip_mod_left_symmetric_target_inverse = 1 + p * wip_mod_right_symmetric_target_inverse))))

Structural proof guide

Generated structural guide

The bounded inverse-index relation is symmetric.

Use the direct prerequisites mul_comm as previously established PA formulas.

The proof proceeds by case analysis (2), intermediate claims (1), equality transport (1).

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 n
  3. 0003intro i
  4. 0004intro j
  5. 0005intro hij
  6. 0006cases hij
  7. 0007cases hij_right
  8. 0008split
  9. 0009exact hij_right_left
  10. 0010split
  11. 0011exact hij_left
  12. 0012have hcomm : (S i) * S j = (S j) * S i
  13. 0013apply mul_comm
  14. 0014rewrite hcomm at hij_right_right
  15. 0015exact hij_right_right