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 p x y d. y = x + d -> (exists fsri_left_ordered_squares fsri_right_ordered_squares. (x * x) + (p) * fsri_left_ordered_squares = (y * y) + (p) * fsri_right_ordered_squares) -> (exists fsri_factor_ordered_factor. (d * (y + x)) = (p) * fsri_factor_ordered_factor)Constructive proof overview
Generated structural guide
Congruent ordered squares force the prime modulus to divide the product of their gap and coordinate sum.
The unchanged tactic script uses 3 declared prerequisites and contains 21 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
FS0047 four_square_ordered_square_difference_factor add_comm Stable theorem; checked-use authorized mod_eq_ordered_gap_multiple Stable theorem; checked-use authorizedDirect 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–6
02Establish hidentityL7–16
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply four square ordered square difference factor.
- L7
have hidentity : x * x + d * (y + x) = y * y - L8
specialize four_square_ordered_square_difference_factor x - L9
specialize four_square_ordered_square_difference_factor y - L10
specialize four_square_ordered_square_difference_factor d - L11
apply four_square_ordered_square_difference_factor - L12
exact horder - L13
specialize mod_eq_ordered_gap_multiple p - L14
specialize mod_eq_ordered_gap_multiple (d * (y + x)) - L15
specialize mod_eq_ordered_gap_multiple (x * x) - L16
specialize mod_eq_ordered_gap_multiple (y * y)
03Use earlier factsL17–17
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L17
apply mod_eq_ordered_gap_multiple
04Calculate and transport equalitiesL18–18
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L18
trans x * x + d * (y + x)
Original exact command ledger · 21 lines
- 0001
intro p - 0002
intro x - 0003
intro y - 0004
intro d - 0005
intro horder - 0006
intro hmod - 0007
have hidentity : x * x + d * (y + x) = y * y - 0008
specialize four_square_ordered_square_difference_factor x - 0009
specialize four_square_ordered_square_difference_factor y - 0010
specialize four_square_ordered_square_difference_factor d - 0011
apply four_square_ordered_square_difference_factor - 0012
exact horder - 0013
specialize mod_eq_ordered_gap_multiple p - 0014
specialize mod_eq_ordered_gap_multiple (d * (y + x)) - 0015
specialize mod_eq_ordered_gap_multiple (x * x) - 0016
specialize mod_eq_ordered_gap_multiple (y * y) - 0017
apply mod_eq_ordered_gap_multiple - 0018
trans x * x + d * (y + x) - 0019
apply add_comm - 0020
exact hidentity - 0021
exact hmod