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
∀ a. ∀ b. ∀ c. ∀ d. ModEq(2,a · a + b · b + c · c + d · d,a + b + c + d)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 a b c d. (exists fsps_u_norm fsps_v_norm. (a * a + b * b + c * c + d * d) + 2 * fsps_u_norm = (a + b + c + d) + 2 * fsps_v_norm)Proof neighborhood
Direct theorem prerequisites
FS003S four_square_parity_triple_mod_two_sum FS003Q four_square_parity_square_mod_two_self mod_eq_add · Stable closedDirect 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.
Named ingredients (2)
01Fix variables and assumptionsL1–4
02Use earlier factsL5–12
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original defined command ledger · 12 lines
- 0001
intro a - 0002
intro b - 0003
intro c - 0004
intro d - 0005
specialize mod_eq_add 2 - 0006
specialize mod_eq_add (a * a + b * b + c * c) - 0007
specialize mod_eq_add (a + b + c) - 0008
specialize mod_eq_add (d * d) - 0009
specialize mod_eq_add d - 0010
apply mod_eq_add - 0011
apply four_square_parity_triple_mod_two_sum - 0012
apply four_square_parity_square_mod_two_self