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 r x. (r * r + 1) * (x * x) = (r * x) * (r * x) + x * xConstructive proof overview
Generated structural guide
Distributivity identifies the scaled negative-one polynomial with the linear square plus its coordinate square.
The unchanged tactic script uses 4 declared prerequisites and contains 29 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_mul Stable theorem; checked-use authorized one_mul Stable theorem; checked-use authorized mul_assoc Stable theorem; checked-use authorized mul_comm 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–2
02Use earlier factsL3–5
03Calculate and transport equalitiesL6–6
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L6
rewrite add_mul
04Use earlier factsL7–7
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L7
specialize one_mul (x * x)
05Calculate and transport equalitiesL8–10
06Use earlier factsL11–11
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L11
apply mul_assoc
07Calculate and transport equalitiesL12–15
08Use earlier factsL16–16
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L16
apply mul_assoc
09Calculate and transport equalitiesL17–20
10Use earlier factsL21–21
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L21
apply mul_comm
11Calculate and transport equalitiesL22–25
12Use earlier factsL26–26
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L26
apply mul_assoc
13Calculate and transport equalitiesL27–27
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L27
symm
14Use earlier factsL28–28
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L28
apply mul_assoc
15Calculate and transport equalitiesL29–29
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L29
refl
Original exact command ledger · 29 lines
- 0001
intro r - 0002
intro x - 0003
specialize add_mul (r * r) - 0004
specialize add_mul 1 - 0005
specialize add_mul (x * x) - 0006
rewrite add_mul - 0007
specialize one_mul (x * x) - 0008
rewrite one_mul - 0009
congr - 0010
trans r * (r * (x * x)) - 0011
apply mul_assoc - 0012
trans r * ((r * x) * x) - 0013
congr - 0014
refl - 0015
symm - 0016
apply mul_assoc - 0017
trans r * ((x * r) * x) - 0018
congr - 0019
refl - 0020
congr - 0021
apply mul_comm - 0022
refl - 0023
trans r * (x * (r * x)) - 0024
congr - 0025
refl - 0026
apply mul_assoc - 0027
symm - 0028
apply mul_assoc - 0029
refl