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. ∀ a. ∀ e. ∀ q. a + e = k · q → ModEq(k,a · a,e · e)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 a e q. a + e = k * q -> (exists ftcn_left_fssq_opposite_square ftcn_right_fssq_opposite_square. (a * a) + (k) * ftcn_left_fssq_opposite_square = (e * e) + (k) * ftcn_right_fssq_opposite_square)Proof neighborhood
Direct theorem prerequisites
Direct 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.
01Fix variables and assumptionsL1–5
02Establish hzeroL6–9
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply multiple implies balanced zero congruence.
- L6
have hzero : ModEq(k,a + e,0)Definitions: ModEq(k,a + e,0)Original native command in the exact edition - L7
specialize multiple_implies_balanced_zero_congruence k - L8
specialize multiple_implies_balanced_zero_congruence (a + e) - L9
apply multiple_implies_balanced_zero_congruence
03Construct an explicit witnessL10–10
Supply the displayed value, then prove that it has the required property.
- L10
exists q
04Use earlier factsL11–16
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original defined command ledger · 16 lines
- 0001
intro k - 0002
intro a - 0003
intro e - 0004
intro q - 0005
intro hrepresentation - 0006
have hzero : ModEq(k,a + e,0)Exact native replay line
have hzero : exists ftcn_left_fssq_opposite_zero ftcn_right_fssq_opposite_zero. (a + e) + (k) * ftcn_left_fssq_opposite_zero = (0) + (k) * ftcn_right_fssq_opposite_zero - 0007
specialize multiple_implies_balanced_zero_congruence k - 0008
specialize multiple_implies_balanced_zero_congruence (a + e) - 0009
apply multiple_implies_balanced_zero_congruence - 0010
exists q - 0011
exact hrepresentation - 0012
specialize balanced_zero_sum_implies_squared_congruence k - 0013
specialize balanced_zero_sum_implies_squared_congruence a - 0014
specialize balanced_zero_sum_implies_squared_congruence e - 0015
apply balanced_zero_sum_implies_squared_congruence - 0016
exact hzero