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 x y. ~(x = 0 /\ y = 0) -> (exists ftcn_strict_prime_positive. ftcn_strict_prime_positive + S (0) = (x * x + y * y))Constructive proof overview
Generated structural guide
A natural coordinate pair not identically zero has a witnessed strictly positive two-square norm.
The unchanged tactic script uses 4 declared prerequisites and contains 38 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
zero_or_succ Stable theorem; checked-use authorized add_eq_zero_left Stable theorem; checked-use authorized add_eq_zero_right Stable theorem; checked-use authorized mul_eq_zero 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–3
02Use earlier factsL4–4
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L4
specialize zero_or_succ (x * x + y * y)
03Separate the logical casesL5–6
04Use earlier factsL7–7
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L7
apply hnonzero
05Separate the logical casesL8–8
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L8
split
06Establish hxL9–13
07Establish hxsplitL14–18
08Separate the logical casesL19–19
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L19
cases hxsplit
09Use earlier factsL20–21
10Establish hyL22–26
11Establish hysplitL27–31
12Separate the logical casesL32–32
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L32
cases hysplit
13Use earlier factsL33–34
14Separate the logical casesL35–35
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L35
cases zero_or_succ_right
15Construct an explicit witnessL36–36
Supply the displayed value, then prove that it has the required property.
- L36
exists x1
Original exact command ledger · 38 lines
- 0001
intro x - 0002
intro y - 0003
intro hnonzero - 0004
specialize zero_or_succ (x * x + y * y) - 0005
cases zero_or_succ - 0006
exfalso - 0007
apply hnonzero - 0008
split - 0009
have hx : x * x = 0 - 0010
specialize add_eq_zero_left (x * x) - 0011
specialize add_eq_zero_left (y * y) - 0012
apply add_eq_zero_left - 0013
exact zero_or_succ_left - 0014
have hxsplit : x = 0 \/ x = 0 - 0015
specialize mul_eq_zero x - 0016
specialize mul_eq_zero x - 0017
apply mul_eq_zero - 0018
exact hx - 0019
cases hxsplit - 0020
exact hxsplit_left - 0021
exact hxsplit_right - 0022
have hy : y * y = 0 - 0023
specialize add_eq_zero_right (x * x) - 0024
specialize add_eq_zero_right (y * y) - 0025
apply add_eq_zero_right - 0026
exact zero_or_succ_left - 0027
have hysplit : y = 0 \/ y = 0 - 0028
specialize mul_eq_zero y - 0029
specialize mul_eq_zero y - 0030
apply mul_eq_zero - 0031
exact hy - 0032
cases hysplit - 0033
exact hysplit_left - 0034
exact hysplit_right - 0035
cases zero_or_succ_right - 0036
exists x1 - 0037
rewrite zero_or_succ_right_witness - 0038
simp