Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved. Exact original first-admission records.
Exact expanded PA statement
forall p a x y. ((((~(x = 0) /\ (exists esi_strict_gap_symmetric_source_left_bound. esi_strict_gap_symmetric_source_left_bound + S x = p))) /\ (((~(y = 0) /\ (exists esi_strict_gap_symmetric_source_right_bound. esi_strict_gap_symmetric_source_right_bound + S y = p))) /\ (exists esi_mod_left_symmetric_source_mod esi_mod_right_symmetric_source_mod. (x * y) + p * esi_mod_left_symmetric_source_mod = (a) + p * esi_mod_right_symmetric_source_mod)))) -> ((((~(y = 0) /\ (exists esi_strict_gap_symmetric_target_left_bound. esi_strict_gap_symmetric_target_left_bound + S y = p))) /\ (((~(x = 0) /\ (exists esi_strict_gap_symmetric_target_right_bound. esi_strict_gap_symmetric_target_right_bound + S x = p))) /\ (exists esi_mod_left_symmetric_target_mod esi_mod_right_symmetric_target_mod. (y * x) + p * esi_mod_left_symmetric_target_mod = (a) + p * esi_mod_right_symmetric_target_mod))))Structural proof guide
Generated structural guide
The scaled-inverse relation is symmetric.
Use the direct prerequisites mul_comm as previously established PA formulas.
The proof proceeds by case analysis (4), 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-v25 checked-use theorem is independently kernel-checked when replayed; it is not a Stable theorem.
Read the argument
Proof checkpoints
This is a reading aid, not a new proof or a proof-tree certificate. Checkpoint groups are consecutive commands, not inferred branch boundaries. Every step links to the preserved script.
Named ingredients (1)
01Fix variables and assumptionsL1–5
02Separate the logical casesL6–11
03Use earlier factsL12–13
04Separate the logical casesL14–15
05Use earlier factsL16–17
Original exact command ledger · 21 lines
- 0001
intro p - 0002
intro a - 0003
intro x - 0004
intro y - 0005
intro hxy - 0006
cases hxy - 0007
cases hxy_left - 0008
cases hxy_right - 0009
cases hxy_right_left - 0010
split - 0011
split - 0012
exact hxy_right_left_left - 0013
exact hxy_right_left_right - 0014
split - 0015
split - 0016
exact hxy_left_left - 0017
exact hxy_left_right - 0018
have hcomm : x * y = y * x - 0019
apply mul_comm - 0020
rewrite hcomm at hxy_right_right - 0021
exact hxy_right_right