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 PA statement
forall n a b. n = a * b -> ~(a = 1) -> ~(b = 1) -> ((~(n = 1) /\ forall bpr_left_bb8fnfp_prime bpr_right_bb8fnfp_prime. n = bpr_left_bb8fnfp_prime * bpr_right_bb8fnfp_prime -> bpr_left_bb8fnfp_prime = 1 \/ bpr_right_bb8fnfp_prime = 1)) -> falseStructural proof guide
A displayed nontrivial factorization refutes primality.
Direct prerequisites: none. The authored body proceeds by case analysis (2), intermediate claims (1).
Proof neighborhood
Direct dependencies
Direct dependents
Formal native tactic body
Dependencies are hypotheses of the historical Alpha-v12 body receipt. The complete historical Alpha-v18 proof bundle independently checks every dependency; current Alpha v25 preserves that checked theorem use without changing 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–7
02Separate the logical casesL8–8
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L8
cases hprime
03Use earlier factsL9–10
04Establish hunitL11–13
05Separate the logical casesL14–14
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L14
cases hunit
Original exact command ledger · 18 lines
- 0001
intro n - 0002
intro a - 0003
intro b - 0004
intro hfactor - 0005
intro ha - 0006
intro hb - 0007
intro hprime - 0008
cases hprime - 0009
specialize hprime_right a - 0010
specialize hprime_right b - 0011
have hunit : a = 1 \/ b = 1 - 0012
apply hprime_right - 0013
exact hfactor - 0014
cases hunit - 0015
apply ha - 0016
exact hunit_left - 0017
apply hb - 0018
exact hunit_right