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 first-order arithmetic statement
forall k q. (exists hgcrt_mod_left_pth_negative hgcrt_mod_right_pth_negative. (q + k * q) + (S k) * hgcrt_mod_left_pth_negative = 0 + (S k) * hgcrt_mod_right_pth_negative)Constructive proof overview
Generated structural guide
The predecessor of every positive modulus gives a witnessed subtraction-free negative residue.
The unchanged tactic script uses 2 declared prerequisites and contains 9 exact native proof lines.
Alpha v34 checked-use · first admitted v25 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
mod_eq_predecessor_cancel Stable theorem; checked-use authorized zero_add Stable theorem; checked-use authorizedDirect dependents
Formal native tactic body
Dependencies are introduced as named hypotheses before line 1. Local theorem links identify exact declared prerequisites. This exact body belongs to a complete independently kernel-checked constructive proof bundle and has Alpha checked-use authority; it does not imply Stable membership.
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.
01Fix variables and assumptionsL1–2
02Use earlier factsL3–5
Original exact command ledger · 9 lines
Separate complete second-wave branches: Full G095 proof · Alpha v27.