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 m n d. m * m = n * n + d -> (forall pff_divisor_primitive_parameters. (exists pff_left_primitive_parameters. (m) = pff_divisor_primitive_parameters * pff_left_primitive_parameters) -> (exists pff_right_primitive_parameters. (n) = pff_divisor_primitive_parameters * pff_right_primitive_parameters) -> pff_divisor_primitive_parameters = 1) -> ((((exists pp_even_primitive_parameters_first_even. (m) = 2 * pp_even_primitive_parameters_first_even) /\ (exists pp_odd_primitive_parameters_second_odd. (n) = 2 * pp_odd_primitive_parameters_second_odd + 1)) \/ ((exists pp_odd_primitive_parameters_first_odd. (m) = 2 * pp_odd_primitive_parameters_first_odd + 1) /\ (exists pp_even_primitive_parameters_second_even. (n) = 2 * pp_even_primitive_parameters_second_even)))) -> ((((2 * (m * n)) * (2 * (m * n)) + (d) * (d) = (m * m + n * n) * (m * m + n * n)) /\ (forall pff_divisor_euclidean_swapped. (exists pff_left_euclidean_swapped. (2 * (m * n)) = pff_divisor_euclidean_swapped * pff_left_euclidean_swapped) -> (exists pff_right_euclidean_swapped. (d) = pff_divisor_euclidean_swapped * pff_right_euclidean_swapped) -> pff_divisor_euclidean_swapped = 1)))Constructive proof overview
Generated structural guide
The complete forward primitive Euclid constructor is valid in either leg orientation.
The unchanged tactic script uses 2 declared prerequisites and contains 17 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
Direct 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 (2)
01Fix variables and assumptionsL1–6
02Use earlier factsL7–16
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L7
specialize pythagorean_primitive_leg_swap d - L8
specialize pythagorean_primitive_leg_swap (2 * (m * n)) - L9
specialize pythagorean_primitive_leg_swap (m * m + n * n) - L10
apply pythagorean_primitive_leg_swap - L11
specialize pythagorean_primitive_euclidean_constructor m - L12
specialize pythagorean_primitive_euclidean_constructor n - L13
specialize pythagorean_primitive_euclidean_constructor d - L14
apply pythagorean_primitive_euclidean_constructor - L15
exact hgap - L16
exact hcoprime
03Use earlier factsL17–17
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L17
exact hopposite
Original exact command ledger · 17 lines
- 0001
intro m - 0002
intro n - 0003
intro d - 0004
intro hgap - 0005
intro hcoprime - 0006
intro hopposite - 0007
specialize pythagorean_primitive_leg_swap d - 0008
specialize pythagorean_primitive_leg_swap (2 * (m * n)) - 0009
specialize pythagorean_primitive_leg_swap (m * m + n * n) - 0010
apply pythagorean_primitive_leg_swap - 0011
specialize pythagorean_primitive_euclidean_constructor m - 0012
specialize pythagorean_primitive_euclidean_constructor n - 0013
specialize pythagorean_primitive_euclidean_constructor d - 0014
apply pythagorean_primitive_euclidean_constructor - 0015
exact hgap - 0016
exact hcoprime - 0017
exact hopposite