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
∀ p. ∀ r. ∀ x. ∀ y. Dvd(p,r · r + 1) → ModEq(p,r · x + y,0) → Dvd(p,x · x + y · y)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 p r x y. (exists ftcn_factor_root. (r * r + 1) = (p) * ftcn_factor_root) -> (exists ftcn_left_opposite_linear ftcn_right_opposite_linear. (r * x + y) + (p) * ftcn_left_opposite_linear = (0) + (p) * ftcn_right_opposite_linear) -> (exists ftcn_factor_norm. (x * x + y * y) = (p) * ftcn_factor_norm)Proof neighborhood
Direct theorem prerequisites
TS0016 balanced_zero_sum_implies_squared_congruence TS0017 negative_one_congruent_square_norm_multipleDirect 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
02Use earlier factsL7–16
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L7
specialize negative_one_congruent_square_norm_multiple p - L8
specialize negative_one_congruent_square_norm_multiple r - L9
specialize negative_one_congruent_square_norm_multiple x - L10
specialize negative_one_congruent_square_norm_multiple y - L11
apply negative_one_congruent_square_norm_multiple - L12
exact hroot - L13
specialize balanced_zero_sum_implies_squared_congruence p - L14
specialize balanced_zero_sum_implies_squared_congruence (r * x) - L15
specialize balanced_zero_sum_implies_squared_congruence y - L16
apply balanced_zero_sum_implies_squared_congruence
03Use earlier factsL17–17
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L17
exact hopposite
Original defined command ledger · 17 lines
- 0001
intro p - 0002
intro r - 0003
intro x - 0004
intro y - 0005
intro hroot - 0006
intro hopposite - 0007
specialize negative_one_congruent_square_norm_multiple p - 0008
specialize negative_one_congruent_square_norm_multiple r - 0009
specialize negative_one_congruent_square_norm_multiple x - 0010
specialize negative_one_congruent_square_norm_multiple y - 0011
apply negative_one_congruent_square_norm_multiple - 0012
exact hroot - 0013
specialize balanced_zero_sum_implies_squared_congruence p - 0014
specialize balanced_zero_sum_implies_squared_congruence (r * x) - 0015
specialize balanced_zero_sum_implies_squared_congruence y - 0016
apply balanced_zero_sum_implies_squared_congruence - 0017
exact hopposite