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 a b c d e f. exists u v w x. (a * a + b * b + c * c + d * d) * (e * e + f * f) = u * u + v * v + w * w + x * xEvery 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 e f. exists u v w x. (a * a + b * b + c * c + d * d) * (e * e + f * f) = u * u + v * v + w * w + x * xProof neighborhood
Direct theorem prerequisites
FS000H four_square_absolute_difference_total FS000I four_square_two_square_factor_identity add_assoc · 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–6
02Establish hfirstL7–8
03Separate the logical casesL9–9
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L9
cases hfirst
04Establish hsecondL10–11
05Separate the logical casesL12–12
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L12
cases hsecond
06Construct an explicit witnessL13–16
07Calculate and transport equalitiesL17–17
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L17
trans ((a * e + b * f) * (a * e + b * f) + x * x) + ((c * e + d * f) * (c * e + d * f) + x1 * x1)
08Use earlier factsL18–20
09Calculate and transport equalitiesL21–21
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L21
symm
10Use earlier factsL22–22
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L22
apply add_assoc
Original defined command ledger · 22 lines
- 0001
intro a - 0002
intro b - 0003
intro c - 0004
intro d - 0005
intro e - 0006
intro f - 0007
have hfirst : exists m. (a * f = b * e + m \/ b * e = a * f + m) - 0008
apply four_square_absolute_difference_total - 0009
cases hfirst - 0010
have hsecond : exists n. (c * f = d * e + n \/ d * e = c * f + n) - 0011
apply four_square_absolute_difference_total - 0012
cases hsecond - 0013
exists a * e + b * f - 0014
exists x - 0015
exists c * e + d * f - 0016
exists x1 - 0017
trans ((a * e + b * f) * (a * e + b * f) + x * x) + ((c * e + d * f) * (c * e + d * f) + x1 * x1) - 0018
apply four_square_two_square_factor_identity - 0019
exact hfirst_witness - 0020
exact hsecond_witness - 0021
symm - 0022
apply add_assoc