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.
All displayed hypotheses are required. Powers and positive differences are actual existential outputs. The proof constructs second-order correction identities and iterates the prime step; no binomial expansion or LTE oracle is assumed. The 2-adic variants remain separate open targets.
Exact theorem in conservative defined notation
∀ p. ¬p = 1 ∧ (∀ x. ∀ y. p = x · y → x = 1 ∨ y = 1) → BoundedPowerValuation(p,p,p,1)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 18 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 (1)
01Fix variables and assumptionsL1–2
02Establish hexL3–6
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply power valuation exists.
- L3
have hex : ∃ e. BoundedPowerValuation(p,p,p,e)Definitions: BoundedPowerValuation(p,p,p,e)Original native command in the exact edition - L4
specialize power_valuation_exists (p) - L5
specialize power_valuation_exists (p) - L6
apply power_valuation_exists
03Separate the logical casesL7–7
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L7
cases hex
04Use earlier factsL8–17
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L8
specialize prime_valuation_exponent_eq_transport (p) - L9
specialize prime_valuation_exponent_eq_transport (p) - L10
specialize prime_valuation_exponent_eq_transport (x) - L11
specialize prime_valuation_exponent_eq_transport (1) - L12
apply prime_valuation_exponent_eq_transport - L13
specialize lte_prime_self_valuation_value (p) - L14
specialize lte_prime_self_valuation_value (x) - L15
apply lte_prime_self_valuation_value - L16
exact hp - L17
exact hex_witness
05Use earlier factsL18–18
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L18
exact hex_witness
Original defined command ledger · 18 lines
- 0001
intro p - 0002
intro hp - 0003
have hex : ∃ e. BoundedPowerValuation(p,p,p,e) - 0004
specialize power_valuation_exists (p) - 0005
specialize power_valuation_exists (p) - 0006
apply power_valuation_exists - 0007
cases hex - 0008
specialize prime_valuation_exponent_eq_transport (p) - 0009
specialize prime_valuation_exponent_eq_transport (p) - 0010
specialize prime_valuation_exponent_eq_transport (x) - 0011
specialize prime_valuation_exponent_eq_transport (1) - 0012
apply prime_valuation_exponent_eq_transport - 0013
specialize lte_prime_self_valuation_value (p) - 0014
specialize lte_prime_self_valuation_value (x) - 0015
apply lte_prime_self_valuation_value - 0016
exact hp - 0017
exact hex_witness - 0018
exact hex_witness