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
∀ B. ∀ n. ¬n = 0 → Lt(n,B) → ∃ x. ∃ y. ∃ z. ∃ m. ∃ k. ∃ i. ∃ j. PrimeValuationSupport(n,x,y,z,m,k,i,j)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 107 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.
Named ingredients (4)
01Fix variables and assumptionsL1–1
Work with arbitrary variables or the premises of the current implication.
- L1
intro B
02Induction on BL2–5
03Separate the logical casesL6–6
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L6
exfalso
04Use earlier factsL7–9
05Fix variables and assumptionsL10–12
06Use earlier factsL13–14
07Separate the logical casesL15–15
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L15
cases eq_decidable
08Construct an explicit witnessL16–22
09Use earlier factsL23–32
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L23
specialize prime_valuation_support_value_eq_transport (1) - L24
specialize prime_valuation_support_value_eq_transport (n) - L25
specialize prime_valuation_support_value_eq_transport (0) - L26
specialize prime_valuation_support_value_eq_transport (0) - L27
specialize prime_valuation_support_value_eq_transport (0) - L28
specialize prime_valuation_support_value_eq_transport (0) - L29
specialize prime_valuation_support_value_eq_transport (0) - L30
specialize prime_valuation_support_value_eq_transport (0) - L31
specialize prime_valuation_support_value_eq_transport (0) - L32
apply prime_valuation_support_value_eq_transport
10Calculate and transport equalitiesL33–33
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L33
symm
11Use earlier factsL34–35
12Establish hfactorL36–40
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply prime valuation strict cofactor exists.
- L36
have hfactor : ∃ p. ∃ e. ∃ P. ∃ u. Prime(p) ∧ (¬e = 0 ∧ (BoundedPowerValuation(p,n,n,e) ∧ (Pow(p,e,P) ∧ (n = P · u ∧ (¬u = 0 ∧ (¬Dvd(p,u) ∧ Lt(u,n)))))))Definitions: Prime(p)BoundedPowerValuation(p,n,n,e)Pow(p,e,P)Dvd(p,u)Lt(u,n)Original native command in the exact edition - L37
specialize prime_valuation_strict_cofactor_exists (n) - L38
apply prime_valuation_strict_cofactor_exists - L39
exact hn - L40
exact eq_decidable_right
13Separate the logical casesL41–50
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L41
cases hfactor - L42
cases hfactor_witness - L43
cases hfactor_witness_witness - L44
cases hfactor_witness_witness_witness - L45
cases hfactor_witness_witness_witness_witness - L46
cases hfactor_witness_witness_witness_witness_right - L47
cases hfactor_witness_witness_witness_witness_right_right - L48
cases hfactor_witness_witness_witness_witness_right_right_right - L49
cases hfactor_witness_witness_witness_witness_right_right_right_right - L50
cases hfactor_witness_witness_witness_witness_right_right_right_right_right
14Separate the logical casesL51–51
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L51
cases hfactor_witness_witness_witness_witness_right_right_right_right_right_right
15Establish hrecL52–61
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply IH.
- L52
have hrec : ∃ pb. ∃ pc. ∃ eb. ∃ ec. ∃ vb. ∃ vc. ∃ l. PrimeValuationSupport(x3,pb,pc,eb,ec,vb,vc,l)Definitions: PrimeValuationSupport(x3,pb,pc,eb,ec,vb,vc,l)Original native command in the exact edition - L53
specialize IH (x3) - L54
apply IH - L55
exact hfactor_witness_witness_witness_witness_right_right_right_right_right_left - L56
specialize lt_of_lt_of_le (x3) - L57
specialize lt_of_lt_of_le (n) - L58
specialize lt_of_lt_of_le (B) - L59
apply lt_of_lt_of_le - L60
exact hfactor_witness_witness_witness_witness_right_right_right_right_right_right_right - L61
specialize le_of_succ_le_succ (n)
16Use earlier factsL62–64
17Separate the logical casesL65–71
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
18Establish hextendedL72–81
Establish this local claim before using it. It is not an additional assumption.
- L72
have hextended : ∃ a. ∃ b. ∃ c. ∃ d. ∃ e. ∃ f. PrimeValuationSupport(n,a,b,c,d,e,f,S x10)Definitions: PrimeValuationSupport(n,a,b,c,d,e,f,S x10)Original native command in the exact edition - L73
specialize prime_valuation_support_append_full_power (n) - L74
specialize prime_valuation_support_append_full_power (x3) - L75
specialize prime_valuation_support_append_full_power (x) - L76
specialize prime_valuation_support_append_full_power (x1) - L77
specialize prime_valuation_support_append_full_power (x2) - L78
specialize prime_valuation_support_append_full_power (x4) - L79
specialize prime_valuation_support_append_full_power (x5) - L80
specialize prime_valuation_support_append_full_power (x6) - L81
specialize prime_valuation_support_append_full_power (x7)
19Use earlier factsL82–91
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L82
specialize prime_valuation_support_append_full_power (x8) - L83
specialize prime_valuation_support_append_full_power (x9) - L84
specialize prime_valuation_support_append_full_power (x10) - L85
apply prime_valuation_support_append_full_power - L86
exact hn - L87
exact hfactor_witness_witness_witness_witness_left - L88
exact hfactor_witness_witness_witness_witness_right_left - L89
exact hfactor_witness_witness_witness_witness_right_right_left - L90
exact hfactor_witness_witness_witness_witness_right_right_right_left - L91
exact hfactor_witness_witness_witness_witness_right_right_right_right_right_right_left
20Use earlier factsL92–93
21Separate the logical casesL94–99
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
22Construct an explicit witnessL100–106
23Use earlier factsL107–107
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L107
exact hextended_witness_witness_witness_witness_witness_witness
Original defined command ledger · 107 lines
- 0001
intro B - 0002
induction B - 0003
intro n - 0004
intro hn - 0005
intro hbound - 0006
exfalso - 0007
specialize factor_permutation_below_zero_impossible (n) - 0008
apply factor_permutation_below_zero_impossible - 0009
exact hbound - 0010
intro n - 0011
intro hn - 0012
intro hbound - 0013
specialize eq_decidable n - 0014
specialize eq_decidable 1 - 0015
cases eq_decidable - 0016
exists 0 - 0017
exists 0 - 0018
exists 0 - 0019
exists 0 - 0020
exists 0 - 0021
exists 0 - 0022
exists 0 - 0023
specialize prime_valuation_support_value_eq_transport (1) - 0024
specialize prime_valuation_support_value_eq_transport (n) - 0025
specialize prime_valuation_support_value_eq_transport (0) - 0026
specialize prime_valuation_support_value_eq_transport (0) - 0027
specialize prime_valuation_support_value_eq_transport (0) - 0028
specialize prime_valuation_support_value_eq_transport (0) - 0029
specialize prime_valuation_support_value_eq_transport (0) - 0030
specialize prime_valuation_support_value_eq_transport (0) - 0031
specialize prime_valuation_support_value_eq_transport (0) - 0032
apply prime_valuation_support_value_eq_transport - 0033
symm - 0034
exact eq_decidable_left - 0035
apply prime_valuation_support_one - 0036
have hfactor : ∃ p. ∃ e. ∃ P. ∃ u. Prime(p) ∧ (¬e = 0 ∧ (BoundedPowerValuation(p,n,n,e) ∧ (Pow(p,e,P) ∧ (n = P · u ∧ (¬u = 0 ∧ (¬Dvd(p,u) ∧ Lt(u,n))))))) - 0037
specialize prime_valuation_strict_cofactor_exists (n) - 0038
apply prime_valuation_strict_cofactor_exists - 0039
exact hn - 0040
exact eq_decidable_right - 0041
cases hfactor - 0042
cases hfactor_witness - 0043
cases hfactor_witness_witness - 0044
cases hfactor_witness_witness_witness - 0045
cases hfactor_witness_witness_witness_witness - 0046
cases hfactor_witness_witness_witness_witness_right - 0047
cases hfactor_witness_witness_witness_witness_right_right - 0048
cases hfactor_witness_witness_witness_witness_right_right_right - 0049
cases hfactor_witness_witness_witness_witness_right_right_right_right - 0050
cases hfactor_witness_witness_witness_witness_right_right_right_right_right - 0051
cases hfactor_witness_witness_witness_witness_right_right_right_right_right_right - 0052
have hrec : ∃ pb. ∃ pc. ∃ eb. ∃ ec. ∃ vb. ∃ vc. ∃ l. PrimeValuationSupport(x3,pb,pc,eb,ec,vb,vc,l) - 0053
specialize IH (x3) - 0054
apply IH - 0055
exact hfactor_witness_witness_witness_witness_right_right_right_right_right_left - 0056
specialize lt_of_lt_of_le (x3) - 0057
specialize lt_of_lt_of_le (n) - 0058
specialize lt_of_lt_of_le (B) - 0059
apply lt_of_lt_of_le - 0060
exact hfactor_witness_witness_witness_witness_right_right_right_right_right_right_right - 0061
specialize le_of_succ_le_succ (n) - 0062
specialize le_of_succ_le_succ (B) - 0063
apply le_of_succ_le_succ - 0064
exact hbound - 0065
cases hrec - 0066
cases hrec_witness - 0067
cases hrec_witness_witness - 0068
cases hrec_witness_witness_witness - 0069
cases hrec_witness_witness_witness_witness - 0070
cases hrec_witness_witness_witness_witness_witness - 0071
cases hrec_witness_witness_witness_witness_witness_witness - 0072
have hextended : ∃ a. ∃ b. ∃ c. ∃ d. ∃ e. ∃ f. PrimeValuationSupport(n,a,b,c,d,e,f,S x10) - 0073
specialize prime_valuation_support_append_full_power (n) - 0074
specialize prime_valuation_support_append_full_power (x3) - 0075
specialize prime_valuation_support_append_full_power (x) - 0076
specialize prime_valuation_support_append_full_power (x1) - 0077
specialize prime_valuation_support_append_full_power (x2) - 0078
specialize prime_valuation_support_append_full_power (x4) - 0079
specialize prime_valuation_support_append_full_power (x5) - 0080
specialize prime_valuation_support_append_full_power (x6) - 0081
specialize prime_valuation_support_append_full_power (x7) - 0082
specialize prime_valuation_support_append_full_power (x8) - 0083
specialize prime_valuation_support_append_full_power (x9) - 0084
specialize prime_valuation_support_append_full_power (x10) - 0085
apply prime_valuation_support_append_full_power - 0086
exact hn - 0087
exact hfactor_witness_witness_witness_witness_left - 0088
exact hfactor_witness_witness_witness_witness_right_left - 0089
exact hfactor_witness_witness_witness_witness_right_right_left - 0090
exact hfactor_witness_witness_witness_witness_right_right_right_left - 0091
exact hfactor_witness_witness_witness_witness_right_right_right_right_right_right_left - 0092
exact hfactor_witness_witness_witness_witness_right_right_right_right_left - 0093
exact hrec_witness_witness_witness_witness_witness_witness_witness - 0094
cases hextended - 0095
cases hextended_witness - 0096
cases hextended_witness_witness - 0097
cases hextended_witness_witness_witness - 0098
cases hextended_witness_witness_witness_witness - 0099
cases hextended_witness_witness_witness_witness_witness - 0100
exists x11 - 0101
exists x12 - 0102
exists x13 - 0103
exists x14 - 0104
exists x15 - 0105
exists x16 - 0106
exists S x10 - 0107
exact hextended_witness_witness_witness_witness_witness_witness