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 x y u U p n q m c d. ((x) + ((n) * (u) + (m) * (U)) = (y) + ((p) * (u) + (q) * (U))) -> p = n + c -> m = q + d -> (x) + (d) * (U) = (y) + (c) * (u)Constructive proof overview
Generated structural guide
Cancelling the common nonnegative coordinate representatives yields the actual pn signed linear combination.
The unchanged tactic script uses 5 declared prerequisites and contains 24 exact native proof lines.
Alpha v34 checked-use · first admitted v29 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
add_right_cancel Stable theorem; checked-use authorized add_mul Stable theorem; checked-use authorized add_assoc Stable theorem; checked-use authorized add_comm Stable theorem; checked-use authorized four_square_add_swap_right_tail Alpha 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–10
02Fix variables and assumptionsL11–13
03Use earlier factsL14–17
04Calculate and transport equalitiesL18–21
05Use earlier factsL22–22
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L22
exact h
Original exact command ledger · 24 lines
- 0001
intro x - 0002
intro y - 0003
intro u - 0004
intro U - 0005
intro p - 0006
intro n - 0007
intro q - 0008
intro m - 0009
intro c - 0010
intro d - 0011
intro h - 0012
intro hp - 0013
intro hq - 0014
specialize add_right_cancel ((x) + (d) * (U)) - 0015
specialize add_right_cancel ((y) + (c) * (u)) - 0016
specialize add_right_cancel (n * u + q * U) - 0017
apply add_right_cancel - 0018
trans x + (n * u + m * U) - 0019
rewrite hq - 0020
simp [add_mul, add_assoc, add_comm, four_square_add_swap_right_tail] - 0021
trans y + (p * u + q * U) - 0022
exact h - 0023
rewrite hp - 0024
simp [add_mul, add_assoc, add_comm, four_square_add_swap_right_tail]