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.
Statement with defined notation
∀ p. ∀ s. Prime(p) → ¬p = s · sEvery purple notation token opens its conservative definition. This reading surface never changes the unchanged intuitionistic kernel or confers checked-use authority.
Definitions used by this theorem
In the theorem statement
In local proof propositions
Exact expanded first-order statement
forall p s. ((~(p = 1) /\ forall frm_prime_left_ftsp_prime frm_prime_right_ftsp_prime. p = frm_prime_left_ftsp_prime * frm_prime_right_ftsp_prime -> frm_prime_left_ftsp_prime = 1 \/ frm_prime_right_ftsp_prime = 1)) -> ~(p = s * s)Proof neighborhood
Direct theorem prerequisites
Direct theorem dependents
Definition-aware tactic body
Only propositions whose conservative expansion has been checked for exact first-order equivalence are compacted. Every changed line retains its immutable exact replay command.
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–4
02Separate the logical casesL5–5
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L5
cases hprime
03Establish hfactorL6–10
04Separate the logical casesL11–11
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L11
cases hfactor
05Use earlier factsL12–12
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L12
apply hprime_left
06Calculate and transport equalitiesL13–16
07Use earlier factsL17–17
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L17
apply hprime_left
Original defined command ledger · 21 lines
- 0001
intro p - 0002
intro s - 0003
intro hprime - 0004
intro hsquare - 0005
cases hprime - 0006
have hfactor : s = 1 \/ s = 1 - 0007
specialize hprime_right s - 0008
specialize hprime_right s - 0009
apply hprime_right - 0010
exact hsquare - 0011
cases hfactor - 0012
apply hprime_left - 0013
rewrite hsquare - 0014
rewrite hfactor_left - 0015
rewrite hfactor_left - 0016
norm_num - 0017
apply hprime_left - 0018
rewrite hsquare - 0019
rewrite hfactor_right - 0020
rewrite hfactor_right - 0021
norm_num