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
∀ b. ∀ c. ∀ d. ∀ f. ∀ B. ∀ l. ∀ z. ∀ k. ∀ Q. (∀ x. ∀ y. ∀ n. Lt(x,l) → BetaAt(b,c,x,y) → BetaAt(d,f,x,n) → n = 0 ∧ y = 1 ∨ n = 1 ∧ Le(y,B)) → Product(b,c,l,z) → Sum(d,f,l,k) → Pow(B,k,Q) → Le(z,Q)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 154 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–5
02Induction on lL6–13
03Establish hz1L14–19
04Establish hk0L20–25
05Establish hQ1L26–35
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply pow zero.
06Use earlier factsL36–36
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L36
apply le_refl
07Fix variables and assumptionsL37–43
08Establish hprodL44–50
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta product succ decompose.
- L44
have hprod : ∃ a. ∃ w. BetaAt(b,c,l,a) ∧ (Product(b,c,l,w) ∧ z = w · a)Definitions: BetaAt(b,c,l,a)Product(b,c,l,w)Original native command in the exact edition - L45
specialize beta_product_succ_decompose b - L46
specialize beta_product_succ_decompose c - L47
specialize beta_product_succ_decompose l - L48
specialize beta_product_succ_decompose z - L49
apply beta_product_succ_decompose - L50
exact hz
09Separate the logical casesL51–54
10Establish hsumL55–61
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta sum succ decompose.
- L55
have hsum : ∃ e. ∃ K. BetaAt(d,f,l,e) ∧ (Sum(d,f,l,K) ∧ k = K + e)Definitions: BetaAt(d,f,l,e)Sum(d,f,l,K)Original native command in the exact edition - L56
specialize beta_sum_succ_decompose d - L57
specialize beta_sum_succ_decompose f - L58
specialize beta_sum_succ_decompose l - L59
specialize beta_sum_succ_decompose k - L60
apply beta_sum_succ_decompose - L61
exact hk
11Separate the logical casesL62–65
12Establish hpL66–69
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply pow exists.
13Separate the logical casesL70–70
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L70
cases hp
14Establish hpreL71–80
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply IH.
15Fix variables and assumptionsL81–81
Work with arbitrary variables or the premises of the current implication.
- L81
intro he
16Use earlier factsL82–91
17Use earlier factsL92–94
18Establish hlastL95–103
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply hw.
19Separate the logical casesL104–105
20Establish hk0L106–114
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply PA3.
21Establish hQ0L115–124
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply pow functional.
22Calculate and transport equalitiesL125–125
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L125
rewrite hlast_left_right
23Establish hmL126–129
24Separate the logical casesL130–130
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L130
cases hlast_right
25Establish hk1L131–135
26Establish hQ1L136–145
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply pow successor pair mul.
27Calculate and transport equalitiesL146–147
Original defined command ledger · 154 lines
- 0001
intro b - 0002
intro c - 0003
intro d - 0004
intro f - 0005
intro B - 0006
induction l - 0007
intro z - 0008
intro k - 0009
intro Q - 0010
intro hw - 0011
intro hz - 0012
intro hk - 0013
intro hQ - 0014
have hz1 : z = 1 - 0015
specialize beta_product_zero b - 0016
specialize beta_product_zero c - 0017
specialize beta_product_zero z - 0018
apply beta_product_zero - 0019
exact hz - 0020
have hk0 : k = 0 - 0021
specialize beta_sum_zero d - 0022
specialize beta_sum_zero f - 0023
specialize beta_sum_zero k - 0024
apply beta_sum_zero - 0025
exact hk - 0026
have hQ1 : Q = 1 - 0027
specialize pow_zero B - 0028
specialize pow_zero k - 0029
specialize pow_zero Q - 0030
apply pow_zero - 0031
exact hk0 - 0032
exact hQ - 0033
rewrite hz1 - 0034
rewrite hQ1 - 0035
specialize le_refl 1 - 0036
apply le_refl - 0037
intro z - 0038
intro k - 0039
intro Q - 0040
intro hw - 0041
intro hz - 0042
intro hk - 0043
intro hQ - 0044
have hprod : ∃ a. ∃ w. BetaAt(b,c,l,a) ∧ (Product(b,c,l,w) ∧ z = w · a) - 0045
specialize beta_product_succ_decompose b - 0046
specialize beta_product_succ_decompose c - 0047
specialize beta_product_succ_decompose l - 0048
specialize beta_product_succ_decompose z - 0049
apply beta_product_succ_decompose - 0050
exact hz - 0051
cases hprod - 0052
cases hprod_witness - 0053
cases hprod_witness_witness - 0054
cases hprod_witness_witness_right - 0055
have hsum : ∃ e. ∃ K. BetaAt(d,f,l,e) ∧ (Sum(d,f,l,K) ∧ k = K + e) - 0056
specialize beta_sum_succ_decompose d - 0057
specialize beta_sum_succ_decompose f - 0058
specialize beta_sum_succ_decompose l - 0059
specialize beta_sum_succ_decompose k - 0060
apply beta_sum_succ_decompose - 0061
exact hk - 0062
cases hsum - 0063
cases hsum_witness - 0064
cases hsum_witness_witness - 0065
cases hsum_witness_witness_right - 0066
have hp : ∃ R. Pow(B,x3,R) - 0067
specialize pow_exists B - 0068
specialize pow_exists x3 - 0069
apply pow_exists - 0070
cases hp - 0071
have hpre : Le(x1,x4) - 0072
specialize IH x1 - 0073
specialize IH x3 - 0074
specialize IH x4 - 0075
apply IH - 0076
intro i - 0077
intro a - 0078
intro e - 0079
intro hi - 0080
intro ha - 0081
intro he - 0082
specialize hw i - 0083
specialize hw a - 0084
specialize hw e - 0085
apply hw - 0086
specialize le_succ (S i) - 0087
specialize le_succ l - 0088
apply le_succ - 0089
exact hi - 0090
exact ha - 0091
exact he - 0092
exact hprod_witness_witness_right_left - 0093
exact hsum_witness_witness_right_left - 0094
exact hp_witness - 0095
have hlast : x2 = 0 ∧ x = 1 ∨ x2 = 1 ∧ Le(x,B) - 0096
specialize hw l - 0097
specialize hw x - 0098
specialize hw x2 - 0099
apply hw - 0100
specialize le_refl (S l) - 0101
apply le_refl - 0102
exact hprod_witness_witness_left - 0103
exact hsum_witness_witness_left - 0104
cases hlast - 0105
cases hlast_left - 0106
have hk0 : k = x3 - 0107
trans x3 + x2 - 0108
exact hsum_witness_witness_right_right - 0109
rewrite hlast_left_left - 0110
apply PA3 - 0111
rewrite hk0 at hQ - 0112
rewrite hk0 at hQ - 0113
rewrite hk0 at hQ - 0114
rewrite hk0 at hQ - 0115
have hQ0 : Q = x4 - 0116
specialize pow_functional B - 0117
specialize pow_functional x3 - 0118
specialize pow_functional Q - 0119
specialize pow_functional x4 - 0120
apply pow_functional - 0121
exact hQ - 0122
exact hp_witness - 0123
rewrite hprod_witness_witness_right_right - 0124
rewrite hQ0 - 0125
rewrite hlast_left_right - 0126
have hm : x1 * 1 = x1 - 0127
apply mul_one - 0128
rewrite hm - 0129
exact hpre - 0130
cases hlast_right - 0131
have hk1 : k = S x3 - 0132
trans x3 + x2 - 0133
exact hsum_witness_witness_right_right - 0134
rewrite hlast_right_left - 0135
simp - 0136
have hQ1 : Q = x4 * B - 0137
specialize pow_successor_pair_mul B - 0138
specialize pow_successor_pair_mul x3 - 0139
specialize pow_successor_pair_mul k - 0140
specialize pow_successor_pair_mul x4 - 0141
specialize pow_successor_pair_mul Q - 0142
apply pow_successor_pair_mul - 0143
exact hk1 - 0144
exact hp_witness - 0145
exact hQ - 0146
rewrite hprod_witness_witness_right_right - 0147
rewrite hQ1 - 0148
specialize mul_le_mul x1 - 0149
specialize mul_le_mul x4 - 0150
specialize mul_le_mul x - 0151
specialize mul_le_mul B - 0152
apply mul_le_mul - 0153
exact hpre - 0154
exact hlast_right_right