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. ∀ F. ∀ G. KroneckerDeltaTable(N,F) → KroneckerDeltaTable(N,G) → ArithPositiveEqual(F,G,N)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 47 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–5
02Separate the logical casesL6–7
03Fix variables and assumptionsL8–14
04Establish hfaL15–21
05Establish hgbL22–28
06Separate the logical casesL29–30
07Establish hcL31–34
08Separate the logical casesL35–35
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L35
cases hc
09Calculate and transport equalitiesL36–36
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L36
trans 2
10Use earlier factsL37–38
11Calculate and transport equalitiesL39–39
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L39
symm
12Use earlier factsL40–41
13Calculate and transport equalitiesL42–42
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L42
trans 0
14Use earlier factsL43–44
15Calculate and transport equalitiesL45–45
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L45
symm
Original defined command ledger · 47 lines
- 0001
intro N - 0002
intro F - 0003
intro G - 0004
intro hf - 0005
intro hg - 0006
cases hf - 0007
cases hg - 0008
intro i - 0009
intro a - 0010
intro b - 0011
intro hi - 0012
intro hb - 0013
intro ha - 0014
intro hbv - 0015
have hfa : (((i)=1 -> (a)=2) /\ (~((i)=1) -> (a)=0)) - 0016
specialize hf_right (i) - 0017
specialize hf_right (a) - 0018
apply hf_right - 0019
exact hi - 0020
exact hb - 0021
exact ha - 0022
have hgb : (((i)=1 -> (b)=2) /\ (~((i)=1) -> (b)=0)) - 0023
specialize hg_right (i) - 0024
specialize hg_right (b) - 0025
apply hg_right - 0026
exact hi - 0027
exact hb - 0028
exact hbv - 0029
cases hfa - 0030
cases hgb - 0031
have hc : i=1 \/ ~(i=1) - 0032
specialize eq_decidable (i) - 0033
specialize eq_decidable (1) - 0034
apply eq_decidable - 0035
cases hc - 0036
trans 2 - 0037
apply hfa_left - 0038
exact hc_left - 0039
symm - 0040
apply hgb_left - 0041
exact hc_left - 0042
trans 0 - 0043
apply hfa_right - 0044
exact hc_right - 0045
symm - 0046
apply hgb_right - 0047
exact hc_right