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.
These are the exact finite integer inequalities with constant 8, for every N≥2. The proof uses constructive binomial and primorial infrastructure; it does not assume logarithms, asymptotic estimates, the prime number theorem, or a factorization oracle.
Exact theorem in conservative defined notation
∀ n. ∀ C. ∀ b. ∀ c. ∀ d. ∀ f. ∀ l. Lt(0,n) → CentralBinom(n,C) → (∀ x. Lt(x,l) → ∃ y. BetaAt(b,c,x,y) ∧ (Prime(S x) ∧ (∃ z. Le(z,C) ∧ (∃ m. Pow(S x,z,m) ∧ (∃ k. C = m · k)) ∧ (∀ m. Le(m,C) → (∃ k. Pow(S x,m,k) ∧ (∃ i. C = k · i)) → Le(m,z)) ∧ Pow(S x,z,y)) ∨ ¬Prime(S x) ∧ y = 1)) → PrimeBitPrefix(d,f,l) → ∀ x. ∀ y. ∀ z. Lt(x,l) → BetaAt(b,c,x,y) → BetaAt(d,f,x,z) → z = 0 ∧ y = 1 ∨ z = 1 ∧ Le(y,n + n)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 73 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–10
02Fix variables and assumptionsL11–17
03Establish hbL18–27
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply prime bit prefix entry.
- L18
have hb : Prime(S i) ∧ e = 1 ∨ ¬Prime(S i) ∧ e = 0Definitions: Prime(S i)Original native command in the exact edition - L19
specialize prime_bit_prefix_entry d - L20
specialize prime_bit_prefix_entry f - L21
specialize prime_bit_prefix_entry l - L22
specialize prime_bit_prefix_entry i - L23
specialize prime_bit_prefix_entry e - L24
apply prime_bit_prefix_entry - L25
exact hm - L26
exact hi - L27
exact he
04Establish hvL28–37
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply prime contribution prefix decoded choice.
- L28
have hv : Prime(S i) ∧ (∃ x. Le(x,C) ∧ (∃ y. Pow(S i,x,y) ∧ (∃ z. C = y · z)) ∧ (∀ y. Le(y,C) → (∃ z. Pow(S i,y,z) ∧ (∃ n. C = z · n)) → Le(y,x)) ∧ Pow(S i,x,a)) ∨ ¬Prime(S i) ∧ a = 1Definitions: Prime(S i)Le(x,C)Pow(S i,x,y)Le(y,C)Pow(S i,y,z)Le(y,x)Pow(S i,x,a)Original native command in the exact edition - L29
specialize prime_contribution_prefix_decoded_choice C - L30
specialize prime_contribution_prefix_decoded_choice b - L31
specialize prime_contribution_prefix_decoded_choice c - L32
specialize prime_contribution_prefix_decoded_choice l - L33
specialize prime_contribution_prefix_decoded_choice i - L34
specialize prime_contribution_prefix_decoded_choice a - L35
apply prime_contribution_prefix_decoded_choice - L36
exact hf - L37
exact hi
05Use earlier factsL38–38
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L38
exact ha
06Separate the logical casesL39–46
07Use earlier factsL47–56
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L47
exact hb_left_right - L48
specialize central_binom_prime_power_contribution_le_double (S i) - L49
specialize central_binom_prime_power_contribution_le_double n - L50
specialize central_binom_prime_power_contribution_le_double C - L51
specialize central_binom_prime_power_contribution_le_double x - L52
specialize central_binom_prime_power_contribution_le_double a - L53
apply central_binom_prime_power_contribution_le_double - L54
exact hb_left_left - L55
exact hn - L56
exact hC
08Use earlier factsL57–58
09Separate the logical casesL59–60
10Use earlier factsL61–62
11Separate the logical casesL63–66
12Use earlier factsL67–68
13Separate the logical casesL69–71
Original defined command ledger · 73 lines
- 0001
intro n - 0002
intro C - 0003
intro b - 0004
intro c - 0005
intro d - 0006
intro f - 0007
intro l - 0008
intro hn - 0009
intro hC - 0010
intro hf - 0011
intro hm - 0012
intro i - 0013
intro a - 0014
intro e - 0015
intro hi - 0016
intro ha - 0017
intro he - 0018
have hb : Prime(S i) ∧ e = 1 ∨ ¬Prime(S i) ∧ e = 0 - 0019
specialize prime_bit_prefix_entry d - 0020
specialize prime_bit_prefix_entry f - 0021
specialize prime_bit_prefix_entry l - 0022
specialize prime_bit_prefix_entry i - 0023
specialize prime_bit_prefix_entry e - 0024
apply prime_bit_prefix_entry - 0025
exact hm - 0026
exact hi - 0027
exact he - 0028
have hv : Prime(S i) ∧ (∃ x. Le(x,C) ∧ (∃ y. Pow(S i,x,y) ∧ (∃ z. C = y · z)) ∧ (∀ y. Le(y,C) → (∃ z. Pow(S i,y,z) ∧ (∃ n. C = z · n)) → Le(y,x)) ∧ Pow(S i,x,a)) ∨ ¬Prime(S i) ∧ a = 1 - 0029
specialize prime_contribution_prefix_decoded_choice C - 0030
specialize prime_contribution_prefix_decoded_choice b - 0031
specialize prime_contribution_prefix_decoded_choice c - 0032
specialize prime_contribution_prefix_decoded_choice l - 0033
specialize prime_contribution_prefix_decoded_choice i - 0034
specialize prime_contribution_prefix_decoded_choice a - 0035
apply prime_contribution_prefix_decoded_choice - 0036
exact hf - 0037
exact hi - 0038
exact ha - 0039
cases hb - 0040
cases hb_left - 0041
cases hv - 0042
cases hv_left - 0043
cases hv_left_right - 0044
cases hv_left_right_witness - 0045
right - 0046
split - 0047
exact hb_left_right - 0048
specialize central_binom_prime_power_contribution_le_double (S i) - 0049
specialize central_binom_prime_power_contribution_le_double n - 0050
specialize central_binom_prime_power_contribution_le_double C - 0051
specialize central_binom_prime_power_contribution_le_double x - 0052
specialize central_binom_prime_power_contribution_le_double a - 0053
apply central_binom_prime_power_contribution_le_double - 0054
exact hb_left_left - 0055
exact hn - 0056
exact hC - 0057
exact hv_left_right_witness_left - 0058
exact hv_left_right_witness_right - 0059
cases hv_right - 0060
exfalso - 0061
apply hv_right_left - 0062
exact hb_left_left - 0063
cases hb_right - 0064
cases hv - 0065
cases hv_left - 0066
exfalso - 0067
apply hb_right_left - 0068
exact hv_left_left - 0069
cases hv_right - 0070
left - 0071
split - 0072
exact hb_right_right - 0073
exact hv_right_right