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. (~((p) = 1) /\ forall pvs_left_odd_prime pvs_right_odd_prime. (p) = pvs_left_odd_prime * pvs_right_odd_prime -> pvs_left_odd_prime = 1 \/ pvs_right_odd_prime = 1) -> ~(p = 2) -> ~(exists olte_factor_two. (2) = (p) * olte_factor_two)Constructive proof overview
Generated structural guide
Two is a nondivisor unit for every prime explicitly different from two.
The unchanged tactic script uses 2 declared prerequisites and contains 11 exact native proof lines.
Alpha v34 checked-use · first admitted v29 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
prime_divisor_of_prime_forces_equality Alpha theorem; checked-use authorized prime_two 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 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.