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.
Statement with defined notation
∀ b. ∀ c. ∀ a. ∀ l. ∀ n. ∀ q. (∀ x. ∀ y. Lt(x,l) → BetaAt(b,c,x,y) → Le(y,a)) → Product(b,c,l,n) → Pow(a,l,q) → Le(n,q)Every purple notation token opens its conservative definition. Expanding the displayed statement recovers the exact first-order Peano-arithmetic formula checked by the unchanged kernel.
Definitions used by this theorem
In the theorem statement
6 occurrences
In local proof propositions
0 occurrences
Exact expanded native-PA statement
forall b c a l n q. (forall i x. (exists bpulp_bound. bpulp_bound + S i = l) -> (((exists ff_h_bpulp_source. ff_h_bpulp_source + S (x) = S ((S (i)) * c)) /\ exists ff_q_bpulp_source. b = ff_q_bpulp_source * S ((S (i)) * c) + (x))) -> exists bpulp_factor_gap. bpulp_factor_gap + x = a) -> (exists ff_u_bpulp_source_product ff_v_bpulp_source_product. ((((exists ff_h_bpulp_source_product_start. ff_h_bpulp_source_product_start + S (1) = S ((S (0)) * ff_v_bpulp_source_product)) /\ exists ff_q_bpulp_source_product_start. ff_u_bpulp_source_product = ff_q_bpulp_source_product_start * S ((S (0)) * ff_v_bpulp_source_product) + (1))) /\ ((((exists ff_h_bpulp_source_product_terminal. ff_h_bpulp_source_product_terminal + S (n) = S ((S (l)) * ff_v_bpulp_source_product)) /\ exists ff_q_bpulp_source_product_terminal. ff_u_bpulp_source_product = ff_q_bpulp_source_product_terminal * S ((S (l)) * ff_v_bpulp_source_product) + (n))) /\ forall ff_i_bpulp_source_product. (exists ff_lt_bpulp_source_product_bound. ff_lt_bpulp_source_product_bound + S ff_i_bpulp_source_product = l) -> exists ff_p_bpulp_source_product ff_r_bpulp_source_product ff_s_bpulp_source_product. ((((exists ff_h_bpulp_source_product_factor. ff_h_bpulp_source_product_factor + S (ff_p_bpulp_source_product) = S ((S (ff_i_bpulp_source_product)) * c)) /\ exists ff_q_bpulp_source_product_factor. b = ff_q_bpulp_source_product_factor * S ((S (ff_i_bpulp_source_product)) * c) + (ff_p_bpulp_source_product))) /\ ((((exists ff_h_bpulp_source_product_partial. ff_h_bpulp_source_product_partial + S (ff_r_bpulp_source_product) = S ((S (ff_i_bpulp_source_product)) * ff_v_bpulp_source_product)) /\ exists ff_q_bpulp_source_product_partial. ff_u_bpulp_source_product = ff_q_bpulp_source_product_partial * S ((S (ff_i_bpulp_source_product)) * ff_v_bpulp_source_product) + (ff_r_bpulp_source_product))) /\ ((((exists ff_h_bpulp_source_product_successor. ff_h_bpulp_source_product_successor + S (ff_s_bpulp_source_product) = S ((S (S ff_i_bpulp_source_product)) * ff_v_bpulp_source_product)) /\ exists ff_q_bpulp_source_product_successor. ff_u_bpulp_source_product = ff_q_bpulp_source_product_successor * S ((S (S ff_i_bpulp_source_product)) * ff_v_bpulp_source_product) + (ff_s_bpulp_source_product))) /\ ff_s_bpulp_source_product = ff_r_bpulp_source_product * ff_p_bpulp_source_product)))))) -> (exists ff_b_bpulp_target_power ff_c_bpulp_target_power. ((forall ff_i_bpulp_target_power_repeat. (exists ff_lt_bpulp_target_power_repeat_bound. ff_lt_bpulp_target_power_repeat_bound + S ff_i_bpulp_target_power_repeat = l) -> (((exists ff_h_bpulp_target_power_repeat_decoded. ff_h_bpulp_target_power_repeat_decoded + S (a) = S ((S (ff_i_bpulp_target_power_repeat)) * ff_c_bpulp_target_power)) /\ exists ff_q_bpulp_target_power_repeat_decoded. ff_b_bpulp_target_power = ff_q_bpulp_target_power_repeat_decoded * S ((S (ff_i_bpulp_target_power_repeat)) * ff_c_bpulp_target_power) + (a)))) /\ (exists ff_u_bpulp_target_power_product ff_v_bpulp_target_power_product. ((((exists ff_h_bpulp_target_power_product_start. ff_h_bpulp_target_power_product_start + S (1) = S ((S (0)) * ff_v_bpulp_target_power_product)) /\ exists ff_q_bpulp_target_power_product_start. ff_u_bpulp_target_power_product = ff_q_bpulp_target_power_product_start * S ((S (0)) * ff_v_bpulp_target_power_product) + (1))) /\ ((((exists ff_h_bpulp_target_power_product_terminal. ff_h_bpulp_target_power_product_terminal + S (q) = S ((S (l)) * ff_v_bpulp_target_power_product)) /\ exists ff_q_bpulp_target_power_product_terminal. ff_u_bpulp_target_power_product = ff_q_bpulp_target_power_product_terminal * S ((S (l)) * ff_v_bpulp_target_power_product) + (q))) /\ forall ff_i_bpulp_target_power_product. (exists ff_lt_bpulp_target_power_product_bound. ff_lt_bpulp_target_power_product_bound + S ff_i_bpulp_target_power_product = l) -> exists ff_p_bpulp_target_power_product ff_r_bpulp_target_power_product ff_s_bpulp_target_power_product. ((((exists ff_h_bpulp_target_power_product_factor. ff_h_bpulp_target_power_product_factor + S (ff_p_bpulp_target_power_product) = S ((S (ff_i_bpulp_target_power_product)) * ff_c_bpulp_target_power)) /\ exists ff_q_bpulp_target_power_product_factor. ff_b_bpulp_target_power = ff_q_bpulp_target_power_product_factor * S ((S (ff_i_bpulp_target_power_product)) * ff_c_bpulp_target_power) + (ff_p_bpulp_target_power_product))) /\ ((((exists ff_h_bpulp_target_power_product_partial. ff_h_bpulp_target_power_product_partial + S (ff_r_bpulp_target_power_product) = S ((S (ff_i_bpulp_target_power_product)) * ff_v_bpulp_target_power_product)) /\ exists ff_q_bpulp_target_power_product_partial. ff_u_bpulp_target_power_product = ff_q_bpulp_target_power_product_partial * S ((S (ff_i_bpulp_target_power_product)) * ff_v_bpulp_target_power_product) + (ff_r_bpulp_target_power_product))) /\ ((((exists ff_h_bpulp_target_power_product_successor. ff_h_bpulp_target_power_product_successor + S (ff_s_bpulp_target_power_product) = S ((S (S ff_i_bpulp_target_power_product)) * ff_v_bpulp_target_power_product)) /\ exists ff_q_bpulp_target_power_product_successor. ff_u_bpulp_target_power_product = ff_q_bpulp_target_power_product_successor * S ((S (S ff_i_bpulp_target_power_product)) * ff_v_bpulp_target_power_product) + (ff_s_bpulp_target_power_product))) /\ ff_s_bpulp_target_power_product = ff_r_bpulp_target_power_product * ff_p_bpulp_target_power_product)))))))) -> exists bpulp_result_gap. bpulp_result_gap + n = qProof neighborhood
Direct theorem prerequisites
Direct theorem dependents
Definition-aware tactic body
Only local propositions introduced by have or suffices are compacted. Every changed line has an exact-AST conservative-expansion receipt; the kernel still receives the immutable original tactic 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
02Separate the logical casesL10–12
03Use earlier factsL13–20
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L13
specialize beta_product_pointwise_le b - L14
specialize beta_product_pointwise_le c - L15
specialize beta_product_pointwise_le x - L16
specialize beta_product_pointwise_le x1 - L17
specialize beta_product_pointwise_le l - L18
specialize beta_product_pointwise_le n - L19
specialize beta_product_pointwise_le q - L20
apply beta_product_pointwise_le
04Fix variables and assumptionsL21–26
05Establish hzaL27–36
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta repeat entry eq.
- L27
have hza : z = a - L28
specialize beta_repeat_entry_eq x - L29
specialize beta_repeat_entry_eq x1 - L30
specialize beta_repeat_entry_eq a - L31
specialize beta_repeat_entry_eq l - L32
specialize beta_repeat_entry_eq i - L33
specialize beta_repeat_entry_eq z - L34
apply beta_repeat_entry_eq - L35
exact hq_witness_witness_left - L36
exact hi
06Use earlier factsL37–37
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L37
exact hz
07Calculate and transport equalitiesL38–38
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L38
rewrite hza
Original defined command ledger · 45 lines
- 0001
intro b - 0002
intro c - 0003
intro a - 0004
intro l - 0005
intro n - 0006
intro q - 0007
intro huniform - 0008
intro hn - 0009
intro hq - 0010
cases hq - 0011
cases hq_witness - 0012
cases hq_witness_witness - 0013
specialize beta_product_pointwise_le b - 0014
specialize beta_product_pointwise_le c - 0015
specialize beta_product_pointwise_le x - 0016
specialize beta_product_pointwise_le x1 - 0017
specialize beta_product_pointwise_le l - 0018
specialize beta_product_pointwise_le n - 0019
specialize beta_product_pointwise_le q - 0020
apply beta_product_pointwise_le - 0021
intro i - 0022
intro p - 0023
intro z - 0024
intro hi - 0025
intro hp - 0026
intro hz - 0027
have hza : z = a - 0028
specialize beta_repeat_entry_eq x - 0029
specialize beta_repeat_entry_eq x1 - 0030
specialize beta_repeat_entry_eq a - 0031
specialize beta_repeat_entry_eq l - 0032
specialize beta_repeat_entry_eq i - 0033
specialize beta_repeat_entry_eq z - 0034
apply beta_repeat_entry_eq - 0035
exact hq_witness_witness_left - 0036
exact hi - 0037
exact hz - 0038
rewrite hza - 0039
specialize huniform i - 0040
specialize huniform p - 0041
apply huniform - 0042
exact hi - 0043
exact hp - 0044
exact hn - 0045
exact hq_witness_witness_right