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
∀ a. ∀ m. ∀ n. Coprime(m,n) → m · m = n · n + a · a → PrimitivePythagorean(a,n,m)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 a m n. (forall pff_divisor_ffd_nested_parameters. (exists pff_left_ffd_nested_parameters. (m) = pff_divisor_ffd_nested_parameters * pff_left_ffd_nested_parameters) -> (exists pff_right_ffd_nested_parameters. (n) = pff_divisor_ffd_nested_parameters * pff_right_ffd_nested_parameters) -> pff_divisor_ffd_nested_parameters = 1) -> m * m = n * n + a * a -> ((((a) * (a) + (n) * (n) = (m) * (m)) /\ (forall pff_divisor_ffd_nested_result. (exists pff_left_ffd_nested_result. (a) = pff_divisor_ffd_nested_result * pff_left_ffd_nested_result) -> (exists pff_right_ffd_nested_result. (n) = pff_divisor_ffd_nested_result * pff_right_ffd_nested_result) -> pff_divisor_ffd_nested_result = 1)))Proof neighborhood
Direct theorem prerequisites
PF000Q pythagorean_square_gap_coprime_second_parameter crt_coprime_divisor_pair · Alpha closed mul_one · Stable closed add_comm · Stable closedDirect 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 (1)
01Fix variables and assumptionsL1–5
02Establish hsquareL6–12
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply pythagorean square gap coprime second parameter.
- L6
have hsquare : Coprime(a · a,n)Definitions: Coprime(a · a,n)Original native command in the exact edition - L7
specialize pythagorean_square_gap_coprime_second_parameter (m) - L8
specialize pythagorean_square_gap_coprime_second_parameter (n) - L9
specialize pythagorean_square_gap_coprime_second_parameter (a * a) - L10
apply pythagorean_square_gap_coprime_second_parameter - L11
exact hgap - L12
exact hcoprime
03Separate the logical casesL13–13
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L13
split
04Calculate and transport equalitiesL14–14
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L14
trans n * n + a * a
05Use earlier factsL15–15
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L15
apply add_comm
06Calculate and transport equalitiesL16–16
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L16
symm
07Use earlier factsL17–23
Instantiate or apply named facts and discharge the corresponding proof obligations.
08Construct an explicit witnessL24–24
Supply the displayed value, then prove that it has the required property.
- L24
exists a
09Calculate and transport equalitiesL25–25
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L25
refl
10Construct an explicit witnessL26–26
Supply the displayed value, then prove that it has the required property.
- L26
exists 1
11Calculate and transport equalitiesL27–27
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L27
symm
12Use earlier factsL28–28
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L28
apply mul_one
Original defined command ledger · 28 lines
- 0001
intro a - 0002
intro m - 0003
intro n - 0004
intro hcoprime - 0005
intro hgap - 0006
have hsquare : Coprime(a · a,n)Exact native replay line
have hsquare : forall pff_divisor_ffd_nested_square. (exists pff_left_ffd_nested_square. (a * a) = pff_divisor_ffd_nested_square * pff_left_ffd_nested_square) -> (exists pff_right_ffd_nested_square. (n) = pff_divisor_ffd_nested_square * pff_right_ffd_nested_square) -> pff_divisor_ffd_nested_square = 1 - 0007
specialize pythagorean_square_gap_coprime_second_parameter (m) - 0008
specialize pythagorean_square_gap_coprime_second_parameter (n) - 0009
specialize pythagorean_square_gap_coprime_second_parameter (a * a) - 0010
apply pythagorean_square_gap_coprime_second_parameter - 0011
exact hgap - 0012
exact hcoprime - 0013
split - 0014
trans n * n + a * a - 0015
apply add_comm - 0016
symm - 0017
exact hgap - 0018
specialize crt_coprime_divisor_pair (a * a) - 0019
specialize crt_coprime_divisor_pair (n) - 0020
specialize crt_coprime_divisor_pair (a) - 0021
specialize crt_coprime_divisor_pair (n) - 0022
apply crt_coprime_divisor_pair - 0023
exact hsquare - 0024
exists a - 0025
refl - 0026
exists 1 - 0027
symm - 0028
apply mul_one