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
forall k u v w x. ((k * u) * (k * u) + (k * v) * (k * v) + (k * w) * (k * w) + (k * x) * (k * x)) = (k * k) * (u * u + v * v + w * w + x * x)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 k u v w x. ((k * u) * (k * u) + (k * v) * (k * v) + (k * w) * (k * w) + (k * x) * (k * x)) = (k * k) * (u * u + v * v + w * w + x * x)Proof neighborhood
Direct theorem prerequisites
FS000E four_square_product_square mul_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 (1)
01Fix variables and assumptionsL1–5
02Calculate and transport equalitiesL6–9
03Use earlier factsL10–13
Original defined command ledger · 15 lines
- 0001
intro k - 0002
intro u - 0003
intro v - 0004
intro w - 0005
intro x - 0006
trans (k * k) * (u * u) + (k * k) * (v * v) + (k * k) * (w * w) + (k * k) * (x * x) - 0007
congr - 0008
congr - 0009
congr - 0010
apply four_square_product_square - 0011
apply four_square_product_square - 0012
apply four_square_product_square - 0013
apply four_square_product_square - 0014
symm - 0015
simp [mul_add]