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.
Historical partial components only: this chapter proves exact natural polynomial Taylor remainders, bounded corrections, and one-step divisibility lifts. G095 is now closed in the separate Alpha-v27 hensel-lifting branch for integer polynomials, unrestricted input roots, unique canonical representatives, and every positive prime power. Full G095 proof · Alpha v27
Exact theorem in conservative defined notation
∀ a. ∀ b. ∀ c. a + (b + c) = b + (a + c)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete unchanged native tactic proof
All 11 lines are the exact independently kernel-checked original script.
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
02Calculate and transport equalitiesL4–5
03Use earlier factsL6–6
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L6
apply add_assoc
04Calculate and transport equalitiesL7–8
05Use earlier factsL9–9
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L9
apply add_comm
06Calculate and transport equalitiesL10–10
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L10
refl
07Use earlier factsL11–11
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L11
apply add_assoc