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 m a q. (exists hgcrt_mod_left_hpl_mod hgcrt_mod_right_hpl_mod. (a + q) + m * hgcrt_mod_left_hpl_mod = 0 + m * hgcrt_mod_right_hpl_mod) -> (exists hgcrt_mod_left_hpl_mod hgcrt_mod_right_hpl_mod. q + m * hgcrt_mod_left_hpl_mod = 0 + m * hgcrt_mod_right_hpl_mod) -> (exists hgcrt_mod_left_hpl_mod hgcrt_mod_right_hpl_mod. a + m * hgcrt_mod_left_hpl_mod = 0 + m * hgcrt_mod_right_hpl_mod)Constructive proof overview
Generated structural guide
A known zero-congruent summand can be cancelled without subtraction.
The unchanged tactic script uses 4 declared prerequisites and contains 24 exact native proof lines.
Alpha v34 checked-use · first admitted v27 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
mod_eq_add_cancel_right Alpha theorem; checked-use authorized mod_eq_trans Stable theorem; checked-use authorized mod_eq_symm 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–5
02Use earlier factsL6–15
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L6
specialize mod_eq_add_cancel_right m - L7
specialize mod_eq_add_cancel_right a - L8
specialize mod_eq_add_cancel_right 0 - L9
specialize mod_eq_add_cancel_right q - L10
apply mod_eq_add_cancel_right - L11
specialize mod_eq_trans m - L12
specialize mod_eq_trans (a + q) - L13
specialize mod_eq_trans 0 - L14
specialize mod_eq_trans (0 + q) - L15
apply mod_eq_trans
03Use earlier factsL16–16
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L16
exact hsum
04Establish heqL17–24
Original exact command ledger · 24 lines
- 0001
intro m - 0002
intro a - 0003
intro q - 0004
intro hsum - 0005
intro hq - 0006
specialize mod_eq_add_cancel_right m - 0007
specialize mod_eq_add_cancel_right a - 0008
specialize mod_eq_add_cancel_right 0 - 0009
specialize mod_eq_add_cancel_right q - 0010
apply mod_eq_add_cancel_right - 0011
specialize mod_eq_trans m - 0012
specialize mod_eq_trans (a + q) - 0013
specialize mod_eq_trans 0 - 0014
specialize mod_eq_trans (0 + q) - 0015
apply mod_eq_trans - 0016
exact hsum - 0017
have heq : 0 + q = q - 0018
apply zero_add - 0019
rewrite heq - 0020
specialize mod_eq_symm m - 0021
specialize mod_eq_symm q - 0022
specialize mod_eq_symm 0 - 0023
apply mod_eq_symm - 0024
exact hq