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.
This is a shared constructive tool, not an additional major blueprint goal. The list covers every prime divisor, has no repeated primes, and contains actual prime-power values. One uses the empty support; zero is excluded.
Exact theorem in conservative defined notation
PrimeValuationSupport(1,0,0,0,0,0,0,0)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 48 original proof lines are preserved. Only local proposition formulas are abbreviated; every abbreviation has an exact binder-safe expansion check. The linked exact edition contains the unchanged replay script.
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.
01Separate the logical casesL1–1
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L1
split
02Fix variables and assumptionsL2–2
Work with arbitrary variables or the premises of the current implication.
- L2
intro hz
03Use earlier factsL3–4
04Separate the logical casesL5–5
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L5
split
05Fix variables and assumptionsL6–12
06Separate the logical casesL13–13
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L13
exfalso
07Use earlier factsL14–16
08Separate the logical casesL17–17
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L17
split
09Fix variables and assumptionsL18–19
10Separate the logical casesL20–20
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L20
exfalso
11Use earlier factsL21–23
12Separate the logical casesL24–24
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L24
split
13Fix variables and assumptionsL25–27
14Separate the logical casesL28–29
15Use earlier factsL30–33
16Establish hprodL34–38
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply factor permutation product exists.
- L34
have hprod : ∃ v. Product(0,0,0,v)Definitions: Product(0,0,0,v)Original native command in the exact edition - L35
specialize factor_permutation_product_exists (0) - L36
specialize factor_permutation_product_exists (0) - L37
specialize factor_permutation_product_exists (0) - L38
apply factor_permutation_product_exists
17Separate the logical casesL39–39
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L39
cases hprod
18Establish heqL40–48
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta product zero.
Original defined command ledger · 48 lines
- 0001
split - 0002
intro hz - 0003
apply PA1 - 0004
exact hz - 0005
split - 0006
intro i - 0007
intro j - 0008
intro p - 0009
intro hi - 0010
intro hj - 0011
intro hleft - 0012
intro hright - 0013
exfalso - 0014
specialize factor_permutation_below_zero_impossible (i) - 0015
apply factor_permutation_below_zero_impossible - 0016
exact hi - 0017
split - 0018
intro i - 0019
intro hi - 0020
exfalso - 0021
specialize factor_permutation_below_zero_impossible (i) - 0022
apply factor_permutation_below_zero_impossible - 0023
exact hi - 0024
split - 0025
intro p - 0026
intro hp - 0027
intro hdiv - 0028
exfalso - 0029
cases hp - 0030
apply hp_left - 0031
specialize divisor_one (p) - 0032
apply divisor_one - 0033
exact hdiv - 0034
have hprod : ∃ v. Product(0,0,0,v) - 0035
specialize factor_permutation_product_exists (0) - 0036
specialize factor_permutation_product_exists (0) - 0037
specialize factor_permutation_product_exists (0) - 0038
apply factor_permutation_product_exists - 0039
cases hprod - 0040
have heq : x = 1 - 0041
specialize beta_product_zero (0) - 0042
specialize beta_product_zero (0) - 0043
specialize beta_product_zero (x) - 0044
apply beta_product_zero - 0045
exact hprod_witness - 0046
rewrite heq at hprod_witness - 0047
rewrite heq at hprod_witness - 0048
exact hprod_witness