Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved. Exact original first-admission records.
Exact expanded first-order arithmetic statement
forall i. ~(exists ge_gap_empty_search. ge_gap_empty_search + S (i) = (0))Constructive proof overview
Generated structural guide
The empty search interval has no index, proved in the original natural arithmetic.
The unchanged tactic script uses 1 declared prerequisite and contains 9 exact native proof lines.
Alpha v34 checked-use · first admitted v30 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
succ_ne_zero Stable theorem; checked-use authorizedDirect dependents
GF0075 gaussian_factor_search_coordinate_row GF0076 gaussian_factor_search_coordinate_rectangle GF0086 gaussian_product_empty_exists GF0092 gaussian_unit_empty_factorization GF00A0 gaussian_product_replace_balance GF00A7 gaussian_factor_empty_matching GF00AF gaussian_irreducible_products_associate_uniqueFormal native tactic body
Dependencies are introduced as named hypotheses before line 1. Local theorem links identify exact declared prerequisites. This exact body belongs to a complete independently kernel-checked constructive proof bundle and has Alpha checked-use authority; it does not imply Stable membership.
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–2
02Separate the logical casesL3–3
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L3
cases h