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
∀ k. ∀ r. ∀ a. ∀ b. ∀ c. ∀ d. k · r = a · a + b · b + c · c + d · d → ModEq(k,a · a + b · b + c · c + d · d,0)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 r a b c d. k * r = a * a + b * b + c * c + d * d -> (exists ftcn_left_case_norm_zero ftcn_right_case_norm_zero. (a * a + b * b + c * c + d * d) + (k) * ftcn_left_case_norm_zero = (0) + (k) * ftcn_right_case_norm_zero)Proof neighborhood
Direct theorem prerequisites
Direct theorem dependents
FS004Q four_square_signed_orientation_mask_00 FS004R four_square_signed_orientation_mask_01 FS004S four_square_signed_orientation_mask_02 FS004T four_square_signed_orientation_mask_03 FS004U four_square_signed_orientation_mask_04 FS004V four_square_signed_orientation_mask_05 FS004W four_square_signed_orientation_mask_06 FS004X four_square_signed_orientation_mask_07 FS004Y four_square_signed_orientation_mask_08 FS004Z four_square_signed_orientation_mask_09 FS0050 four_square_signed_orientation_mask_10 FS0051 four_square_signed_orientation_mask_11 FS0052 four_square_signed_orientation_mask_12 FS0053 four_square_signed_orientation_mask_13 FS0054 four_square_signed_orientation_mask_14 FS0055 four_square_signed_orientation_mask_15Definition-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–7
02Use earlier factsL8–10
03Construct an explicit witnessL11–11
Supply the displayed value, then prove that it has the required property.
- L11
exists r
04Calculate and transport equalitiesL12–12
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L12
symm
05Use earlier factsL13–13
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L13
exact hnorm
Original defined command ledger · 13 lines
- 0001
intro k - 0002
intro r - 0003
intro a - 0004
intro b - 0005
intro c - 0006
intro d - 0007
intro hnorm - 0008
specialize multiple_implies_balanced_zero_congruence k - 0009
specialize multiple_implies_balanced_zero_congruence (a * a + b * b + c * c + d * d) - 0010
apply multiple_implies_balanced_zero_congruence - 0011
exists r - 0012
symm - 0013
exact hnorm