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 d A B H h. ~(d = 0) -> h = (d * d) * H -> h * h = ((d * d) * (d * d)) * ((A * A) * (A * A) + (B * B) * (B * B)) -> A * A * A * A + B * B * B * B = H * HConstructive proof overview
Generated structural guide
Cancelling the positive fourth-power scale returns an actual smaller-scale fourth-power counterexample equation.
The unchanged tactic script uses 4 declared prerequisites and contains 37 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
PF0025 fermat_four_square_nonzero four_square_product_square Alpha theorem; checked-use authorized mul_left_cancel_nonzero Stable theorem; checked-use authorized fourth_power_regroup 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–8
02Establish hdsquareL9–14
03Establish hdfourthL15–20
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply fermat four square nonzero.
04Establish hnormL21–30
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply mul left cancel nonzero.
- L21
have hnorm : (A * A) * (A * A) + (B * B) * (B * B) = H * H - L22
specialize mul_left_cancel_nonzero ((d * d) * (d * d)) - L23
specialize mul_left_cancel_nonzero ((A * A) * (A * A) + (B * B) * (B * B)) - L24
specialize mul_left_cancel_nonzero (H * H) - L25
apply mul_left_cancel_nonzero - L26
exact hdfourth - L27
trans h * h - L28
symm - L29
exact hequation - L30
rewrite hh
05Calculate and transport equalitiesL31–31
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L31
rewrite hh
06Use earlier factsL32–32
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L32
apply four_square_product_square
07Calculate and transport equalitiesL33–34
Original exact command ledger · 37 lines
- 0001
intro d - 0002
intro A - 0003
intro B - 0004
intro H - 0005
intro h - 0006
intro hd - 0007
intro hh - 0008
intro hequation - 0009
have hdsquare : ~(d * d = 0) - 0010
intro hzero - 0011
specialize fermat_four_square_nonzero (d) - 0012
apply fermat_four_square_nonzero - 0013
exact hd - 0014
exact hzero - 0015
have hdfourth : ~((d * d) * (d * d) = 0) - 0016
intro hzero - 0017
specialize fermat_four_square_nonzero (d * d) - 0018
apply fermat_four_square_nonzero - 0019
exact hdsquare - 0020
exact hzero - 0021
have hnorm : (A * A) * (A * A) + (B * B) * (B * B) = H * H - 0022
specialize mul_left_cancel_nonzero ((d * d) * (d * d)) - 0023
specialize mul_left_cancel_nonzero ((A * A) * (A * A) + (B * B) * (B * B)) - 0024
specialize mul_left_cancel_nonzero (H * H) - 0025
apply mul_left_cancel_nonzero - 0026
exact hdfourth - 0027
trans h * h - 0028
symm - 0029
exact hequation - 0030
rewrite hh - 0031
rewrite hh - 0032
apply four_square_product_square - 0033
trans (A * A) * (A * A) + (B * B) * (B * B) - 0034
congr - 0035
apply fourth_power_regroup - 0036
apply fourth_power_regroup - 0037
exact hnorm