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
∀ p. ∀ a. ∀ k. ∀ e. ∀ z. ∀ f. Prime(p) → ¬a = 0 → BoundedPowerValuation(p,a,a,e) → Pow(a,k,z) → BoundedPowerValuation(p,z,z,f) → f = k · e
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 98 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.
01Fix variables and assumptionsL1–3
02Induction on kL4–12
03Establish hzL13–22
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply pow zero.
04Use earlier factsL23–27
05Calculate and transport equalitiesL28–28
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L28
symm
06Use earlier factsL29–29
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L29
apply mul_zero_left
07Fix variables and assumptionsL30–37
08Establish hprevL38–45
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply pow successor decompose.
- L38
have hprev : ∃ r. Pow(a,k,r) ∧ z = r · aDefinitions: Pow(a,k,r)Original native command in the exact edition - L39
specialize pow_successor_decompose (a) - L40
specialize pow_successor_decompose (k) - L41
specialize pow_successor_decompose (S k) - L42
specialize pow_successor_decompose (z) - L43
apply pow_successor_decompose - L44
refl - L45
exact hpow
09Separate the logical casesL46–47
10Establish hvL48–51
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply power valuation exists.
- L48
have hv : ∃ j. BoundedPowerValuation(p,x,x,j)Definitions: BoundedPowerValuation(p,x,x,j)Original native command in the exact edition - L49
specialize power_valuation_exists (p) - L50
specialize power_valuation_exists (x) - L51
apply power_valuation_exists
11Separate the logical casesL52–52
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L52
cases hv
12Establish hindexL53–62
13Establish hxL63–72
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply pow nonzero of one le.
14Use earlier factsL73–73
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L73
exact hxzero
15Establish hproductL74–83
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply power valuation value eq transport.
- L74
have hproduct : BoundedPowerValuation(p,x · a,x · a,f)Definitions: BoundedPowerValuation(p,x · a,x · a,f)Original native command in the exact edition - L75
specialize power_valuation_value_eq_transport (p) - L76
specialize power_valuation_value_eq_transport (z) - L77
specialize power_valuation_value_eq_transport (x * a) - L78
specialize power_valuation_value_eq_transport (f) - L79
apply power_valuation_value_eq_transport - L80
exact hprev_witness_right - L81
exact hval - L82
trans x1 + e - L83
specialize prime_power_valuation_mul (p)
16Use earlier factsL84–93
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L84
specialize prime_power_valuation_mul (x) - L85
specialize prime_power_valuation_mul (a) - L86
specialize prime_power_valuation_mul (x1) - L87
specialize prime_power_valuation_mul (e) - L88
specialize prime_power_valuation_mul (f) - L89
apply prime_power_valuation_mul - L90
exact hp - L91
exact hx - L92
exact ha - L93
exact hv_witness
17Use earlier factsL94–95
18Calculate and transport equalitiesL96–97
19Use earlier factsL98–98
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L98
apply mul_succ_left
Original defined command ledger · 98 lines
- 0001
intro p - 0002
intro a - 0003
intro k - 0004
induction k - 0005
intro e - 0006
intro z - 0007
intro f - 0008
intro hp - 0009
intro ha - 0010
intro hbase - 0011
intro hpow - 0012
intro hval - 0013
have hz : z = 1 - 0014
specialize pow_zero (a) - 0015
specialize pow_zero (0) - 0016
specialize pow_zero (z) - 0017
apply pow_zero - 0018
refl - 0019
exact hpow - 0020
trans 0 - 0021
specialize prime_power_valuation_one_zero (p) - 0022
specialize prime_power_valuation_one_zero (z) - 0023
specialize prime_power_valuation_one_zero (f) - 0024
apply prime_power_valuation_one_zero - 0025
exact hz - 0026
exact hp - 0027
exact hval - 0028
symm - 0029
apply mul_zero_left - 0030
intro e - 0031
intro z - 0032
intro f - 0033
intro hp - 0034
intro ha - 0035
intro hbase - 0036
intro hpow - 0037
intro hval - 0038
have hprev : ∃ r. Pow(a,k,r) ∧ z = r · a - 0039
specialize pow_successor_decompose (a) - 0040
specialize pow_successor_decompose (k) - 0041
specialize pow_successor_decompose (S k) - 0042
specialize pow_successor_decompose (z) - 0043
apply pow_successor_decompose - 0044
refl - 0045
exact hpow - 0046
cases hprev - 0047
cases hprev_witness - 0048
have hv : ∃ j. BoundedPowerValuation(p,x,x,j) - 0049
specialize power_valuation_exists (p) - 0050
specialize power_valuation_exists (x) - 0051
apply power_valuation_exists - 0052
cases hv - 0053
have hindex : x1 = k * e - 0054
specialize IH (e) - 0055
specialize IH (x) - 0056
specialize IH (x1) - 0057
apply IH - 0058
exact hp - 0059
exact ha - 0060
exact hbase - 0061
exact hprev_witness_left - 0062
exact hv_witness - 0063
have hx : ~(x = 0) - 0064
intro hxzero - 0065
specialize pow_nonzero_of_one_le (a) - 0066
specialize pow_nonzero_of_one_le (k) - 0067
specialize pow_nonzero_of_one_le (x) - 0068
apply pow_nonzero_of_one_le - 0069
specialize one_le_of_ne_zero (a) - 0070
apply one_le_of_ne_zero - 0071
exact ha - 0072
exact hprev_witness_left - 0073
exact hxzero - 0074
have hproduct : BoundedPowerValuation(p,x · a,x · a,f) - 0075
specialize power_valuation_value_eq_transport (p) - 0076
specialize power_valuation_value_eq_transport (z) - 0077
specialize power_valuation_value_eq_transport (x * a) - 0078
specialize power_valuation_value_eq_transport (f) - 0079
apply power_valuation_value_eq_transport - 0080
exact hprev_witness_right - 0081
exact hval - 0082
trans x1 + e - 0083
specialize prime_power_valuation_mul (p) - 0084
specialize prime_power_valuation_mul (x) - 0085
specialize prime_power_valuation_mul (a) - 0086
specialize prime_power_valuation_mul (x1) - 0087
specialize prime_power_valuation_mul (e) - 0088
specialize prime_power_valuation_mul (f) - 0089
apply prime_power_valuation_mul - 0090
exact hp - 0091
exact hx - 0092
exact ha - 0093
exact hv_witness - 0094
exact hbase - 0095
exact hproduct - 0096
rewrite hindex - 0097
symm - 0098
apply mul_succ_left