Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
Every grid, slice, row sum and intermediate table is constructed. Retained cells have witnessed n=(a*e)*c and value F(a)*(H(e)*G(c)). The flat endpoint is unused. Table associativity includes N=0 and compares only positive values, not encodings. Full G009 remains broader.
Exact theorem in conservative defined notation
∀ F. ∀ G. ∀ H. ∀ n. ∀ a. ∀ e. ∀ z. a = 0 ∨ ¬Dvd(a,n) → DirichletGridEntry(F,G,H,n,a,e,z) → z = 0
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 30 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–9
02Use earlier factsL10–17
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L10
specialize dirichlet_grid_entry_omitted_value (F) - L11
specialize dirichlet_grid_entry_omitted_value (G) - L12
specialize dirichlet_grid_entry_omitted_value (H) - L13
specialize dirichlet_grid_entry_omitted_value (n) - L14
specialize dirichlet_grid_entry_omitted_value (a) - L15
specialize dirichlet_grid_entry_omitted_value (e) - L16
specialize dirichlet_grid_entry_omitted_value (z) - L17
apply dirichlet_grid_entry_omitted_value
03Separate the logical casesL18–19
04Use earlier factsL20–20
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L20
exact ho_left
05Separate the logical casesL21–22
06Fix variables and assumptionsL23–23
Work with arbitrary variables or the premises of the current implication.
- L23
intro hdiv
07Separate the logical casesL24–24
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L24
cases hdiv
08Use earlier factsL25–25
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L25
apply ho_right
09Construct an explicit witnessL26–26
Supply the displayed value, then prove that it has the required property.
- L26
exists e*x
10Calculate and transport equalitiesL27–27
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L27
trans (a*e)*x
Original defined command ledger · 30 lines
- 0001
intro F - 0002
intro G - 0003
intro H - 0004
intro n - 0005
intro a - 0006
intro e - 0007
intro z - 0008
intro ho - 0009
intro hz - 0010
specialize dirichlet_grid_entry_omitted_value (F) - 0011
specialize dirichlet_grid_entry_omitted_value (G) - 0012
specialize dirichlet_grid_entry_omitted_value (H) - 0013
specialize dirichlet_grid_entry_omitted_value (n) - 0014
specialize dirichlet_grid_entry_omitted_value (a) - 0015
specialize dirichlet_grid_entry_omitted_value (e) - 0016
specialize dirichlet_grid_entry_omitted_value (z) - 0017
apply dirichlet_grid_entry_omitted_value - 0018
cases ho - 0019
left - 0020
exact ho_left - 0021
right - 0022
right - 0023
intro hdiv - 0024
cases hdiv - 0025
apply ho_right - 0026
exists e*x - 0027
trans (a*e)*x - 0028
exact hdiv_witness - 0029
apply mul_assoc - 0030
exact hz