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. ∀ z. KroneckerDeltaTable(N,E) → Lt(0,N) → ArithAt(E,1,z) → z = 2
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 19 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–6
02Separate the logical casesL7–7
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L7
cases he
03Establish hvL8–16
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply he right.
04Separate the logical casesL17–17
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L17
cases hv
05Use earlier factsL18–18
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L18
apply hv_left
06Calculate and transport equalitiesL19–19
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L19
refl
Original defined command ledger · 19 lines
- 0001
intro N - 0002
intro E - 0003
intro z - 0004
intro he - 0005
intro hb - 0006
intro hz - 0007
cases he - 0008
have hv : (((1)=1 -> (z)=2) /\ (~((1)=1) -> (z)=0)) - 0009
specialize he_right (1) - 0010
specialize he_right (z) - 0011
apply he_right - 0012
intro hn - 0013
apply PA1 - 0014
exact hn - 0015
exact hb - 0016
exact hz - 0017
cases hv - 0018
apply hv_left - 0019
refl