Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
Signed one is code 2. Positive-only table graphs preserve arbitrary zeroth values, including N=0. The unit and divisor-sum identities are proved, never embedded in definitions. The separate inverse family proves the general unit-at-one criterion; multiplicative-function closure remains open.
Exact theorem in conservative defined notation
∀ N. ∀ E. ∀ n. ∀ z. KroneckerDeltaTable(N,E) → ¬n = 0 → ¬n = 1 → Le(n,N) → ArithAt(E,n,z) → z = 0
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 20 original proof lines are preserved. Only local proposition formulas are abbreviated; every abbreviation has an exact binder-safe expansion check. The linked exact edition contains the unchanged replay 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–9
02Separate the logical casesL10–10
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L10
cases he
03Establish hvL11–17
04Separate the logical casesL18–18
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L18
cases hv
Original defined command ledger · 20 lines
- 0001
intro N - 0002
intro E - 0003
intro n - 0004
intro z - 0005
intro he - 0006
intro hn - 0007
intro hnotone - 0008
intro hb - 0009
intro hz - 0010
cases he - 0011
have hv : (((n)=1 -> (z)=2) /\ (~((n)=1) -> (z)=0)) - 0012
specialize he_right (n) - 0013
specialize he_right (z) - 0014
apply he_right - 0015
exact hn - 0016
exact hb - 0017
exact hz - 0018
cases hv - 0019
apply hv_right - 0020
exact hnotone