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. Prime(p) → ¬a = 0 → BoundedPowerValuation(p,a,a,e) → Pow(a,k,z) → BoundedPowerValuation(p,z,z,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 32 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 (2)
01Fix variables and assumptionsL1–9
02Establish hvL10–13
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply power valuation exists.
- L10
have hv : ∃ f. BoundedPowerValuation(p,z,z,f)Definitions: BoundedPowerValuation(p,z,z,f)Original native command in the exact edition - L11
specialize power_valuation_exists (p) - L12
specialize power_valuation_exists (z) - L13
apply power_valuation_exists
03Separate the logical casesL14–14
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L14
cases hv
04Use earlier factsL15–24
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L15
specialize prime_valuation_exponent_eq_transport (p) - L16
specialize prime_valuation_exponent_eq_transport (z) - L17
specialize prime_valuation_exponent_eq_transport (x) - L18
specialize prime_valuation_exponent_eq_transport (k * e) - L19
apply prime_valuation_exponent_eq_transport - L20
specialize prime_power_valuation_pow_value (p) - L21
specialize prime_power_valuation_pow_value (a) - L22
specialize prime_power_valuation_pow_value (k) - L23
specialize prime_power_valuation_pow_value (e) - L24
specialize prime_power_valuation_pow_value (z)
Original defined command ledger · 32 lines
- 0001
intro p - 0002
intro a - 0003
intro k - 0004
intro e - 0005
intro z - 0006
intro hp - 0007
intro ha - 0008
intro hbase - 0009
intro hpow - 0010
have hv : ∃ f. BoundedPowerValuation(p,z,z,f) - 0011
specialize power_valuation_exists (p) - 0012
specialize power_valuation_exists (z) - 0013
apply power_valuation_exists - 0014
cases hv - 0015
specialize prime_valuation_exponent_eq_transport (p) - 0016
specialize prime_valuation_exponent_eq_transport (z) - 0017
specialize prime_valuation_exponent_eq_transport (x) - 0018
specialize prime_valuation_exponent_eq_transport (k * e) - 0019
apply prime_valuation_exponent_eq_transport - 0020
specialize prime_power_valuation_pow_value (p) - 0021
specialize prime_power_valuation_pow_value (a) - 0022
specialize prime_power_valuation_pow_value (k) - 0023
specialize prime_power_valuation_pow_value (e) - 0024
specialize prime_power_valuation_pow_value (z) - 0025
specialize prime_power_valuation_pow_value (x) - 0026
apply prime_power_valuation_pow_value - 0027
exact hp - 0028
exact ha - 0029
exact hbase - 0030
exact hpow - 0031
exact hv_witness - 0032
exact hv_witness