Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
A genuine divisor mask has S n entries, indexed zero through n, and forces its zeroth entry to zero regardless of F(0). Möbius values remain positive-domain only. This family constructs divisor sums and Möbius tables; cancellation and the full G007 endpoint are separately proved later in the same release.
Exact theorem in conservative defined notation
∀ F. ∀ G. ∀ n. ∀ d. ∀ a. ∀ b. ArithPositiveEqual(F,G,n) → Le(d,n) → DivisorMaskEntry(F,n,d,a) → DivisorMaskEntry(G,n,d,b) → a = b
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 51 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–10
02Separate the logical casesL11–18
03Use earlier factsL19–26
04Separate the logical casesL27–29
05Use earlier factsL30–32
06Construct an explicit witnessL33–33
Supply the displayed value, then prove that it has the required property.
- L33
exists x
07Use earlier factsL34–34
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L34
exact ha_left_right_witness_left
08Separate the logical casesL35–41
09Use earlier factsL42–44
10Construct an explicit witnessL45–45
Supply the displayed value, then prove that it has the required property.
- L45
exists x
11Use earlier factsL46–46
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L46
exact hb_left_right_witness_left
12Separate the logical casesL47–47
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L47
cases hb_right
13Calculate and transport equalitiesL48–48
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L48
trans 0
14Use earlier factsL49–49
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L49
exact ha_right_right
15Calculate and transport equalitiesL50–50
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L50
symm
16Use earlier factsL51–51
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L51
exact hb_right_right
Original defined command ledger · 51 lines
- 0001
intro F - 0002
intro G - 0003
intro n - 0004
intro d - 0005
intro a - 0006
intro b - 0007
intro he - 0008
intro hdn - 0009
intro ha - 0010
intro hb - 0011
cases ha - 0012
cases ha_left - 0013
cases ha_left_right - 0014
cases ha_left_right_witness - 0015
cases hb - 0016
cases hb_left - 0017
cases hb_left_right - 0018
cases hb_left_right_witness - 0019
specialize he (d) - 0020
specialize he (a) - 0021
specialize he (b) - 0022
apply he - 0023
exact ha_left_left - 0024
exact hdn - 0025
exact ha_left_right_witness_right - 0026
exact hb_left_right_witness_right - 0027
cases hb_right - 0028
exfalso - 0029
cases hb_right_left - 0030
apply ha_left_left - 0031
exact hb_right_left_left - 0032
apply hb_right_left_right - 0033
exists x - 0034
exact ha_left_right_witness_left - 0035
cases ha_right - 0036
cases hb - 0037
cases hb_left - 0038
cases hb_left_right - 0039
cases hb_left_right_witness - 0040
exfalso - 0041
cases ha_right_left - 0042
apply hb_left_left - 0043
exact ha_right_left_left - 0044
apply ha_right_left_right - 0045
exists x - 0046
exact hb_left_right_witness_left - 0047
cases hb_right - 0048
trans 0 - 0049
exact ha_right_right - 0050
symm - 0051
exact hb_right_right