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 p n. ~(p = 0) -> exists q d. (((n) = (p) * (q) + (d)) /\ (exists ldc_lt_native_bound. ldc_lt_native_bound + S (d) = p))Constructive proof overview
Generated structural guide
Every natural value has an actual quotient and strictly bounded base-p digit for every nonzero base.
The unchanged tactic script uses 1 declared prerequisite and contains 7 exact native proof lines.
dependency-curried kernel-checked theorem body; Alpha enrollment and checked-use authority follow separately sealed release evidence; Stable membership remains unchanged
Proof neighborhood
Direct dependencies
division_remainder_exists Stable theorem; checked-use authorizedDirect dependents
Formal native tactic body
Dependencies are introduced as named hypotheses before line 1. Local theorem links identify exact declared prerequisites. This dependency-curried candidate body does not grant checked theorem use or 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.