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.
Exact expanded first-order arithmetic statement
(forall fsl_prime_universal. ((~(fsl_prime_universal = 1) /\ forall frm_prime_left_fsl_all_universal frm_prime_right_fsl_all_universal. fsl_prime_universal = frm_prime_left_fsl_all_universal * frm_prime_right_fsl_all_universal -> frm_prime_left_fsl_all_universal = 1 \/ frm_prime_right_fsl_all_universal = 1)) -> (exists fsl_a_all_universal fsl_b_all_universal fsl_c_all_universal fsl_d_all_universal. (fsl_prime_universal) = fsl_a_all_universal * fsl_a_all_universal + fsl_b_all_universal * fsl_b_all_universal + fsl_c_all_universal * fsl_c_all_universal + fsl_d_all_universal * fsl_d_all_universal)) -> forall n. (exists fsl_a_value fsl_b_value fsl_c_value fsl_d_value. (n) = fsl_a_value * fsl_a_value + fsl_b_value * fsl_b_value + fsl_c_value * fsl_c_value + fsl_d_value * fsl_d_value)Constructive proof overview
Generated structural guide
All-natural Lagrange, including zero, follows constructively from the explicit universal prime-representation premise.
The unchanged tactic script uses 3 declared prerequisites and contains 18 exact native proof lines.
dependency-curried kernel-checked theorem body; Alpha enrollment and checked-use authority follow separately sealed release evidence; Stable membership remains unchanged
Proof neighborhood
Direct dependencies
eq_decidable Stable theorem; checked-use authorized le_refl Stable theorem; checked-use authorized FS003I four_square_lagrange_bounded_from_primesDirect dependents
Formal native tactic body
Dependencies are introduced as named hypotheses before line 1. Local theorem links identify exact declared prerequisites. This exact body belongs to a complete independently kernel-checked constructive proof bundle and has Alpha checked-use authority; it does not imply Stable membership.
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–2
02Use earlier factsL3–4
03Separate the logical casesL5–5
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L5
cases eq_decidable
04Construct an explicit witnessL6–9
05Calculate and transport equalitiesL10–11
06Use earlier factsL12–18
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original exact command ledger · 18 lines
- 0001
intro hprimes - 0002
intro n - 0003
specialize eq_decidable n - 0004
specialize eq_decidable 0 - 0005
cases eq_decidable - 0006
exists 0 - 0007
exists 0 - 0008
exists 0 - 0009
exists 0 - 0010
rewrite eq_decidable_left - 0011
norm_num - 0012
specialize four_square_lagrange_bounded_from_primes n - 0013
specialize four_square_lagrange_bounded_from_primes n - 0014
apply four_square_lagrange_bounded_from_primes - 0015
specialize le_refl n - 0016
exact le_refl - 0017
exact eq_decidable_right - 0018
exact hprimes