Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
The input n is positive. Signed code 2 denotes +1, so the actual sum is +1 at n=1 and zero for n>1. The positive-values result permits arbitrary F(0), which the divisor mask excludes. Prime-square multiples contribute zero. Full G007 inversion is established in its separate family.
Exact theorem in conservative defined notation
∀ n. ∀ p. ∀ d. ∀ e. ∀ f. Prime(p) → DivisorPrimeToggle(n,p,d,e) → DivisorPrimeToggle(n,p,d,f) → e = f
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 48 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.
Named ingredients (1)
01Fix variables and assumptionsL1–8
02Separate the logical casesL9–14
03Use earlier factsL15–19
Instantiate or apply named facts and discharge the corresponding proof obligations.
04Fix variables and assumptionsL20–20
Work with arbitrary variables or the premises of the current implication.
- L20
intro hzero
05Use earlier factsL21–26
06Separate the logical casesL27–29
07Use earlier factsL30–33
08Separate the logical casesL34–39
09Use earlier factsL40–43
10Separate the logical casesL44–44
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L44
cases hf_right
11Calculate and transport equalitiesL45–45
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L45
trans d
12Use earlier factsL46–46
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L46
exact he_right_right
13Calculate and transport equalitiesL47–47
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L47
symm
14Use earlier factsL48–48
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L48
exact hf_right_right
Original defined command ledger · 48 lines
- 0001
intro n - 0002
intro p - 0003
intro d - 0004
intro e - 0005
intro f - 0006
intro hp - 0007
intro he - 0008
intro hf - 0009
cases he - 0010
cases he_left - 0011
cases he_left_right - 0012
cases hf - 0013
cases hf_left - 0014
cases hf_left_right - 0015
specialize prime_factor_toggle_functional (p) - 0016
specialize prime_factor_toggle_functional (d) - 0017
specialize prime_factor_toggle_functional (e) - 0018
specialize prime_factor_toggle_functional (f) - 0019
apply prime_factor_toggle_functional - 0020
intro hzero - 0021
specialize prime_nonzero (p) - 0022
apply prime_nonzero - 0023
exact hp - 0024
exact hzero - 0025
exact he_left_right_right - 0026
exact hf_left_right_right - 0027
cases hf_right - 0028
exfalso - 0029
cases hf_right_left - 0030
apply he_left_left - 0031
exact hf_right_left_left - 0032
apply hf_right_left_right - 0033
exact he_left_right_left - 0034
cases he_right - 0035
cases hf - 0036
cases hf_left - 0037
cases hf_left_right - 0038
exfalso - 0039
cases he_right_left - 0040
apply hf_left_left - 0041
exact he_right_left_left - 0042
apply he_right_left_right - 0043
exact hf_left_right_left - 0044
cases hf_right - 0045
trans d - 0046
exact he_right_right - 0047
symm - 0048
exact hf_right_right