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.
Statement with defined notation
∀ p. ∀ x. ∀ y. ∀ q. ∀ r. ∀ t. x · x = p · q + t → y · y = p · r + t → ModEq(p,x · x,y · y)Every purple notation token opens its conservative definition. This reading surface never changes the unchanged intuitionistic kernel or confers checked-use authority.
Definitions used by this theorem
In the theorem statement
In local proof propositions
Exact expanded first-order statement
forall p x y q r t. x * x = p * q + t -> y * y = p * r + t -> (exists fsri_left_equal_remainders fsri_right_equal_remainders. (x * x) + (p) * fsri_left_equal_remainders = (y * y) + (p) * fsri_right_equal_remainders)Proof neighborhood
Direct theorem prerequisites
Direct theorem dependents
Definition-aware tactic body
Only propositions whose conservative expansion has been checked for exact first-order equivalence are compacted. Every changed line retains its immutable exact replay command.
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–8
02Construct an explicit witnessL9–10
03Calculate and transport equalitiesL11–15
04Use earlier factsL16–16
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L16
apply add_assoc
05Calculate and transport equalitiesL17–18
06Use earlier factsL19–19
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L19
apply add_comm
07Calculate and transport equalitiesL20–20
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L20
refl
08Use earlier factsL21–21
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L21
apply add_assoc
Original defined command ledger · 21 lines
- 0001
intro p - 0002
intro x - 0003
intro y - 0004
intro q - 0005
intro r - 0006
intro t - 0007
intro hx - 0008
intro hy - 0009
exists r - 0010
exists q - 0011
rewrite hx - 0012
rewrite hy - 0013
simp [add_assoc, add_comm] - 0014
trans (t + p * r) + p * q - 0015
symm - 0016
apply add_assoc - 0017
trans (p * r + t) + p * q - 0018
congr - 0019
apply add_comm - 0020
refl - 0021
apply add_assoc