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. ∀ n. ∀ l. ∀ M. ∀ d. DivisorMask(F,n,l,M) → Le(d,l) → d = 0 ∨ ¬Dvd(d,n) → ArithAt(M,d,0)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 32 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–9
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L9
cases hm
03Establish huL10–16
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply divisor signed table lookup.
- L10
have hu : ∃ u. ArithAt(M,d,u)Definitions: ArithAt(M,d,u)Original native command in the exact edition - L11
specialize divisor_signed_table_lookup (l) - L12
specialize divisor_signed_table_lookup (M) - L13
specialize divisor_signed_table_lookup (d) - L14
apply divisor_signed_table_lookup - L15
exact hm_left - L16
exact hbound
04Separate the logical casesL17–17
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L17
cases hu
05Establish heqL18–27
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply divisor mask entry omitted value.
- L18
have heq : x=0 - L19
specialize divisor_mask_entry_omitted_value (F) - L20
specialize divisor_mask_entry_omitted_value (n) - L21
specialize divisor_mask_entry_omitted_value (d) - L22
specialize divisor_mask_entry_omitted_value (x) - L23
apply divisor_mask_entry_omitted_value - L24
exact hc - L25
specialize hm_right (d) - L26
specialize hm_right (x) - L27
apply hm_right
06Use earlier factsL28–29
07Calculate and transport equalitiesL30–31
08Use earlier factsL32–32
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L32
exact hu_witness
Original defined command ledger · 32 lines
- 0001
intro F - 0002
intro n - 0003
intro l - 0004
intro M - 0005
intro d - 0006
intro hm - 0007
intro hbound - 0008
intro hc - 0009
cases hm - 0010
have hu : ∃ u. ArithAt(M,d,u) - 0011
specialize divisor_signed_table_lookup (l) - 0012
specialize divisor_signed_table_lookup (M) - 0013
specialize divisor_signed_table_lookup (d) - 0014
apply divisor_signed_table_lookup - 0015
exact hm_left - 0016
exact hbound - 0017
cases hu - 0018
have heq : x=0 - 0019
specialize divisor_mask_entry_omitted_value (F) - 0020
specialize divisor_mask_entry_omitted_value (n) - 0021
specialize divisor_mask_entry_omitted_value (d) - 0022
specialize divisor_mask_entry_omitted_value (x) - 0023
apply divisor_mask_entry_omitted_value - 0024
exact hc - 0025
specialize hm_right (d) - 0026
specialize hm_right (x) - 0027
apply hm_right - 0028
exact hbound - 0029
exact hu_witness - 0030
rewrite heq at hu_witness - 0031
rewrite heq at hu_witness - 0032
exact hu_witness