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 a b h. ((((~((a) = 0) /\ (~((b) = 0) /\ (~((h) = 0) /\ ((a) * (a) * (a) * (a) + (b) * (b) * (b) * (b) = (h) * (h)))))) /\ (forall pff_divisor_swap_source. (exists pff_left_swap_source. (a) = pff_divisor_swap_source * pff_left_swap_source) -> (exists pff_right_swap_source. (b) = pff_divisor_swap_source * pff_right_swap_source) -> pff_divisor_swap_source = 1))) -> ((((~((b) = 0) /\ (~((a) = 0) /\ (~((h) = 0) /\ ((b) * (b) * (b) * (b) + (a) * (a) * (a) * (a) = (h) * (h)))))) /\ (forall pff_divisor_swap_result. (exists pff_left_swap_result. (b) = pff_divisor_swap_result * pff_left_swap_result) -> (exists pff_right_swap_result. (a) = pff_divisor_swap_result * pff_right_swap_result) -> pff_divisor_swap_result = 1)))Constructive proof overview
Generated structural guide
Swapping the positive fourth-power bases preserves the primitive counterexample relation.
The unchanged tactic script uses 2 declared prerequisites and contains 20 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
add_comm Stable theorem; checked-use authorized coprime_symm 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.
01Fix variables and assumptionsL1–4
02Separate the logical casesL5–10
03Use earlier factsL11–11
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L11
exact hprimitive_left_right_left
04Separate the logical casesL12–12
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L12
split
05Use earlier factsL13–13
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L13
exact hprimitive_left_left
06Separate the logical casesL14–14
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L14
split
07Use earlier factsL15–15
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L15
exact hprimitive_left_right_right_left
08Calculate and transport equalitiesL16–16
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L16
trans a * a * a * a + b * b * b * b
Original exact command ledger · 20 lines
- 0001
intro a - 0002
intro b - 0003
intro h - 0004
intro hprimitive - 0005
cases hprimitive - 0006
cases hprimitive_left - 0007
cases hprimitive_left_right - 0008
cases hprimitive_left_right_right - 0009
split - 0010
split - 0011
exact hprimitive_left_right_left - 0012
split - 0013
exact hprimitive_left_left - 0014
split - 0015
exact hprimitive_left_right_right_left - 0016
trans a * a * a * a + b * b * b * b - 0017
apply add_comm - 0018
exact hprimitive_left_right_right_right - 0019
apply coprime_symm - 0020
exact hprimitive_right