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 k a e. (((exists fsd_center_bound_fssq_orientation. fsd_center_bound_fssq_orientation + (e + e) = k) /\ ((exists fsd_center_lower_fssq_orientation. a = k * fsd_center_lower_fssq_orientation + e) \/ (exists fsd_center_upper_fssq_orientation. a + e = k * fsd_center_upper_fssq_orientation)))) -> ((exists ftcn_left_fssq_orientation_positive ftcn_right_fssq_orientation_positive. (a) + (k) * ftcn_left_fssq_orientation_positive = (e) + (k) * ftcn_right_fssq_orientation_positive) \/ (exists ftcn_left_fssq_orientation_negative ftcn_right_fssq_orientation_negative. (a + e) + (k) * ftcn_left_fssq_orientation_negative = (0) + (k) * ftcn_right_fssq_orientation_negative))Constructive proof overview
Generated structural guide
Each centered remainder constructively supplies its positive congruence or its opposite signed congruence.
The unchanged tactic script uses 2 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
FS0059 four_square_signed_lower_remainder_congruent multiple_implies_balanced_zero_congruence Alpha 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–4
02Separate the logical casesL5–8
03Use earlier factsL9–14
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L9
specialize four_square_signed_lower_remainder_congruent k - L10
specialize four_square_signed_lower_remainder_congruent a - L11
specialize four_square_signed_lower_remainder_congruent e - L12
specialize four_square_signed_lower_remainder_congruent x - L13
apply four_square_signed_lower_remainder_congruent - L14
exact hcenter_right_left_witness
04Separate the logical casesL15–16
05Use earlier factsL17–19
06Construct an explicit witnessL20–20
Supply the displayed value, then prove that it has the required property.
- L20
exists x
07Use earlier factsL21–21
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L21
exact hcenter_right_right_witness
Original exact command ledger · 21 lines
- 0001
intro k - 0002
intro a - 0003
intro e - 0004
intro hcenter - 0005
cases hcenter - 0006
cases hcenter_right - 0007
cases hcenter_right_left - 0008
left - 0009
specialize four_square_signed_lower_remainder_congruent k - 0010
specialize four_square_signed_lower_remainder_congruent a - 0011
specialize four_square_signed_lower_remainder_congruent e - 0012
specialize four_square_signed_lower_remainder_congruent x - 0013
apply four_square_signed_lower_remainder_congruent - 0014
exact hcenter_right_left_witness - 0015
cases hcenter_right_right - 0016
right - 0017
specialize multiple_implies_balanced_zero_congruence k - 0018
specialize multiple_implies_balanced_zero_congruence (a + e) - 0019
apply multiple_implies_balanced_zero_congruence - 0020
exists x - 0021
exact hcenter_right_right_witness