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
∀ n. ∀ z. ∀ c. (∃ x. ∃ y. (∀ m. Lt(m,n) → ∃ k. BetaAt(x,y,m,k) ∧ (Prime(S (S n + m)) ∧ k = S (S n + m) ∨ ¬Prime(S (S n + m)) ∧ k = 1)) ∧ Product(x,y,n,z)) → Choose(S (n + n),n,c) → Dvd(z,c)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
7 occurrences
In local proof propositions
4 occurrences
Exact expanded native-PA statement
forall n z c. (exists bpr_code_bpoidm_interval bpr_scale_bpoidm_interval. ((forall bpr_index_bpoidm_interval_mask. (exists bpr_gap_bpoidm_interval_mask_bound. bpr_gap_bpoidm_interval_mask_bound + S (bpr_index_bpoidm_interval_mask) = n) -> exists bpr_value_bpoidm_interval_mask. ((((exists bpr_height_bpoidm_interval_mask_decoded. bpr_height_bpoidm_interval_mask_decoded + S (bpr_value_bpoidm_interval_mask) = S ((S (bpr_index_bpoidm_interval_mask)) * bpr_scale_bpoidm_interval)) /\ exists bpr_quotient_bpoidm_interval_mask_decoded. bpr_code_bpoidm_interval = bpr_quotient_bpoidm_interval_mask_decoded * S ((S (bpr_index_bpoidm_interval_mask)) * bpr_scale_bpoidm_interval) + (bpr_value_bpoidm_interval_mask))) /\ (((((~(S (S n + bpr_index_bpoidm_interval_mask) = 1) /\ forall bpr_left_bpoidm_interval_mask_choice_prime bpr_right_bpoidm_interval_mask_choice_prime. S (S n + bpr_index_bpoidm_interval_mask) = bpr_left_bpoidm_interval_mask_choice_prime * bpr_right_bpoidm_interval_mask_choice_prime -> bpr_left_bpoidm_interval_mask_choice_prime = 1 \/ bpr_right_bpoidm_interval_mask_choice_prime = 1)) /\ bpr_value_bpoidm_interval_mask = S (S n + bpr_index_bpoidm_interval_mask)) \/ (~((~(S (S n + bpr_index_bpoidm_interval_mask) = 1) /\ forall bpr_left_bpoidm_interval_mask_choice_prime bpr_right_bpoidm_interval_mask_choice_prime. S (S n + bpr_index_bpoidm_interval_mask) = bpr_left_bpoidm_interval_mask_choice_prime * bpr_right_bpoidm_interval_mask_choice_prime -> bpr_left_bpoidm_interval_mask_choice_prime = 1 \/ bpr_right_bpoidm_interval_mask_choice_prime = 1)) /\ bpr_value_bpoidm_interval_mask = 1))))) /\ (exists ff_u_bpoidm_interval_product ff_v_bpoidm_interval_product. ((((exists ff_h_bpoidm_interval_product_start. ff_h_bpoidm_interval_product_start + S (1) = S ((S (0)) * ff_v_bpoidm_interval_product)) /\ exists ff_q_bpoidm_interval_product_start. ff_u_bpoidm_interval_product = ff_q_bpoidm_interval_product_start * S ((S (0)) * ff_v_bpoidm_interval_product) + (1))) /\ ((((exists ff_h_bpoidm_interval_product_terminal. ff_h_bpoidm_interval_product_terminal + S (z) = S ((S (n)) * ff_v_bpoidm_interval_product)) /\ exists ff_q_bpoidm_interval_product_terminal. ff_u_bpoidm_interval_product = ff_q_bpoidm_interval_product_terminal * S ((S (n)) * ff_v_bpoidm_interval_product) + (z))) /\ forall ff_i_bpoidm_interval_product. (exists ff_lt_bpoidm_interval_product_bound. ff_lt_bpoidm_interval_product_bound + S ff_i_bpoidm_interval_product = n) -> exists ff_p_bpoidm_interval_product ff_r_bpoidm_interval_product ff_s_bpoidm_interval_product. ((((exists ff_h_bpoidm_interval_product_factor. ff_h_bpoidm_interval_product_factor + S (ff_p_bpoidm_interval_product) = S ((S (ff_i_bpoidm_interval_product)) * bpr_scale_bpoidm_interval)) /\ exists ff_q_bpoidm_interval_product_factor. bpr_code_bpoidm_interval = ff_q_bpoidm_interval_product_factor * S ((S (ff_i_bpoidm_interval_product)) * bpr_scale_bpoidm_interval) + (ff_p_bpoidm_interval_product))) /\ ((((exists ff_h_bpoidm_interval_product_partial. ff_h_bpoidm_interval_product_partial + S (ff_r_bpoidm_interval_product) = S ((S (ff_i_bpoidm_interval_product)) * ff_v_bpoidm_interval_product)) /\ exists ff_q_bpoidm_interval_product_partial. ff_u_bpoidm_interval_product = ff_q_bpoidm_interval_product_partial * S ((S (ff_i_bpoidm_interval_product)) * ff_v_bpoidm_interval_product) + (ff_r_bpoidm_interval_product))) /\ ((((exists ff_h_bpoidm_interval_product_successor. ff_h_bpoidm_interval_product_successor + S (ff_s_bpoidm_interval_product) = S ((S (S ff_i_bpoidm_interval_product)) * ff_v_bpoidm_interval_product)) /\ exists ff_q_bpoidm_interval_product_successor. ff_u_bpoidm_interval_product = ff_q_bpoidm_interval_product_successor * S ((S (S ff_i_bpoidm_interval_product)) * ff_v_bpoidm_interval_product) + (ff_s_bpoidm_interval_product))) /\ ff_s_bpoidm_interval_product = ff_r_bpoidm_interval_product * ff_p_bpoidm_interval_product)))))))) -> (((exists bcf_lt_gap_bpoidm_middle_out_of_range. bcf_lt_gap_bpoidm_middle_out_of_range + S (S (n + n)) = n) /\ c = 0) \/ ((exists bcf_le_gap_bpoidm_middle_in_range. bcf_le_gap_bpoidm_middle_in_range + (n) = S (n + n)) /\ (exists bcf_row_code_code_bpoidm_middle bcf_row_code_scale_bpoidm_middle bcf_row_scale_code_bpoidm_middle bcf_row_scale_scale_bpoidm_middle bcf_row_code_bpoidm_middle bcf_row_scale_bpoidm_middle. ((forall bcf_row_index_bpoidm_middle_table. (exists bcf_lt_gap_bpoidm_middle_table_row_bound. bcf_lt_gap_bpoidm_middle_table_row_bound + S (bcf_row_index_bpoidm_middle_table) = S (S (n + n))) -> exists bcf_row_code_bpoidm_middle_table bcf_row_scale_bpoidm_middle_table. ((((exists bcf_height_bpoidm_middle_table_decoded_row_code. bcf_height_bpoidm_middle_table_decoded_row_code + S (bcf_row_code_bpoidm_middle_table) = S ((S (bcf_row_index_bpoidm_middle_table)) * bcf_row_code_scale_bpoidm_middle)) /\ exists bcf_quotient_bpoidm_middle_table_decoded_row_code. bcf_row_code_code_bpoidm_middle = bcf_quotient_bpoidm_middle_table_decoded_row_code * S ((S (bcf_row_index_bpoidm_middle_table)) * bcf_row_code_scale_bpoidm_middle) + (bcf_row_code_bpoidm_middle_table))) /\ ((((exists bcf_height_bpoidm_middle_table_decoded_row_scale. bcf_height_bpoidm_middle_table_decoded_row_scale + S (bcf_row_scale_bpoidm_middle_table) = S ((S (bcf_row_index_bpoidm_middle_table)) * bcf_row_scale_scale_bpoidm_middle)) /\ exists bcf_quotient_bpoidm_middle_table_decoded_row_scale. bcf_row_scale_code_bpoidm_middle = bcf_quotient_bpoidm_middle_table_decoded_row_scale * S ((S (bcf_row_index_bpoidm_middle_table)) * bcf_row_scale_scale_bpoidm_middle) + (bcf_row_scale_bpoidm_middle_table))) /\ ((bcf_row_index_bpoidm_middle_table = 0 /\ (forall bcf_index_bpoidm_middle_table_zero_row. (exists bcf_lt_gap_bpoidm_middle_table_zero_row_bound. bcf_lt_gap_bpoidm_middle_table_zero_row_bound + S (bcf_index_bpoidm_middle_table_zero_row) = S (S (n + n))) -> exists bcf_value_bpoidm_middle_table_zero_row. ((((exists bcf_height_bpoidm_middle_table_zero_row_entry. bcf_height_bpoidm_middle_table_zero_row_entry + S (bcf_value_bpoidm_middle_table_zero_row) = S ((S (bcf_index_bpoidm_middle_table_zero_row)) * bcf_row_scale_bpoidm_middle_table)) /\ exists bcf_quotient_bpoidm_middle_table_zero_row_entry. bcf_row_code_bpoidm_middle_table = bcf_quotient_bpoidm_middle_table_zero_row_entry * S ((S (bcf_index_bpoidm_middle_table_zero_row)) * bcf_row_scale_bpoidm_middle_table) + (bcf_value_bpoidm_middle_table_zero_row))) /\ ((bcf_index_bpoidm_middle_table_zero_row = 0 /\ bcf_value_bpoidm_middle_table_zero_row = 1) \/ exists bcf_predecessor_bpoidm_middle_table_zero_row. bcf_index_bpoidm_middle_table_zero_row = S bcf_predecessor_bpoidm_middle_table_zero_row /\ bcf_value_bpoidm_middle_table_zero_row = 0)))) \/ exists bcf_predecessor_bpoidm_middle_table bcf_previous_code_bpoidm_middle_table bcf_previous_scale_bpoidm_middle_table. bcf_row_index_bpoidm_middle_table = S bcf_predecessor_bpoidm_middle_table /\ ((((exists bcf_height_bpoidm_middle_table_decoded_previous_code. bcf_height_bpoidm_middle_table_decoded_previous_code + S (bcf_previous_code_bpoidm_middle_table) = S ((S (bcf_predecessor_bpoidm_middle_table)) * bcf_row_code_scale_bpoidm_middle)) /\ exists bcf_quotient_bpoidm_middle_table_decoded_previous_code. bcf_row_code_code_bpoidm_middle = bcf_quotient_bpoidm_middle_table_decoded_previous_code * S ((S (bcf_predecessor_bpoidm_middle_table)) * bcf_row_code_scale_bpoidm_middle) + (bcf_previous_code_bpoidm_middle_table))) /\ ((((exists bcf_height_bpoidm_middle_table_decoded_previous_scale. bcf_height_bpoidm_middle_table_decoded_previous_scale + S (bcf_previous_scale_bpoidm_middle_table) = S ((S (bcf_predecessor_bpoidm_middle_table)) * bcf_row_scale_scale_bpoidm_middle)) /\ exists bcf_quotient_bpoidm_middle_table_decoded_previous_scale. bcf_row_scale_code_bpoidm_middle = bcf_quotient_bpoidm_middle_table_decoded_previous_scale * S ((S (bcf_predecessor_bpoidm_middle_table)) * bcf_row_scale_scale_bpoidm_middle) + (bcf_previous_scale_bpoidm_middle_table))) /\ (forall bcf_index_bpoidm_middle_table_row_step. (exists bcf_lt_gap_bpoidm_middle_table_row_step_bound. bcf_lt_gap_bpoidm_middle_table_row_step_bound + S (bcf_index_bpoidm_middle_table_row_step) = S (S (n + n))) -> exists bcf_value_bpoidm_middle_table_row_step. ((((exists bcf_height_bpoidm_middle_table_row_step_entry. bcf_height_bpoidm_middle_table_row_step_entry + S (bcf_value_bpoidm_middle_table_row_step) = S ((S (bcf_index_bpoidm_middle_table_row_step)) * bcf_row_scale_bpoidm_middle_table)) /\ exists bcf_quotient_bpoidm_middle_table_row_step_entry. bcf_row_code_bpoidm_middle_table = bcf_quotient_bpoidm_middle_table_row_step_entry * S ((S (bcf_index_bpoidm_middle_table_row_step)) * bcf_row_scale_bpoidm_middle_table) + (bcf_value_bpoidm_middle_table_row_step))) /\ ((bcf_index_bpoidm_middle_table_row_step = 0 /\ bcf_value_bpoidm_middle_table_row_step = 1) \/ exists bcf_predecessor_bpoidm_middle_table_row_step bcf_left_bpoidm_middle_table_row_step bcf_right_bpoidm_middle_table_row_step. bcf_index_bpoidm_middle_table_row_step = S bcf_predecessor_bpoidm_middle_table_row_step /\ ((((exists bcf_height_bpoidm_middle_table_row_step_previous_left. bcf_height_bpoidm_middle_table_row_step_previous_left + S (bcf_left_bpoidm_middle_table_row_step) = S ((S (bcf_predecessor_bpoidm_middle_table_row_step)) * bcf_previous_scale_bpoidm_middle_table)) /\ exists bcf_quotient_bpoidm_middle_table_row_step_previous_left. bcf_previous_code_bpoidm_middle_table = bcf_quotient_bpoidm_middle_table_row_step_previous_left * S ((S (bcf_predecessor_bpoidm_middle_table_row_step)) * bcf_previous_scale_bpoidm_middle_table) + (bcf_left_bpoidm_middle_table_row_step))) /\ ((((exists bcf_height_bpoidm_middle_table_row_step_previous_right. bcf_height_bpoidm_middle_table_row_step_previous_right + S (bcf_right_bpoidm_middle_table_row_step) = S ((S (S (bcf_predecessor_bpoidm_middle_table_row_step))) * bcf_previous_scale_bpoidm_middle_table)) /\ exists bcf_quotient_bpoidm_middle_table_row_step_previous_right. bcf_previous_code_bpoidm_middle_table = bcf_quotient_bpoidm_middle_table_row_step_previous_right * S ((S (S (bcf_predecessor_bpoidm_middle_table_row_step))) * bcf_previous_scale_bpoidm_middle_table) + (bcf_right_bpoidm_middle_table_row_step))) /\ bcf_value_bpoidm_middle_table_row_step = bcf_left_bpoidm_middle_table_row_step + bcf_right_bpoidm_middle_table_row_step))))))))))) /\ ((((exists bcf_height_bpoidm_middle_decoded_row_code. bcf_height_bpoidm_middle_decoded_row_code + S (bcf_row_code_bpoidm_middle) = S ((S (S (n + n))) * bcf_row_code_scale_bpoidm_middle)) /\ exists bcf_quotient_bpoidm_middle_decoded_row_code. bcf_row_code_code_bpoidm_middle = bcf_quotient_bpoidm_middle_decoded_row_code * S ((S (S (n + n))) * bcf_row_code_scale_bpoidm_middle) + (bcf_row_code_bpoidm_middle))) /\ ((((exists bcf_height_bpoidm_middle_decoded_row_scale. bcf_height_bpoidm_middle_decoded_row_scale + S (bcf_row_scale_bpoidm_middle) = S ((S (S (n + n))) * bcf_row_scale_scale_bpoidm_middle)) /\ exists bcf_quotient_bpoidm_middle_decoded_row_scale. bcf_row_scale_code_bpoidm_middle = bcf_quotient_bpoidm_middle_decoded_row_scale * S ((S (S (n + n))) * bcf_row_scale_scale_bpoidm_middle) + (bcf_row_scale_bpoidm_middle))) /\ (((exists bcf_height_bpoidm_middle_decoded_value. bcf_height_bpoidm_middle_decoded_value + S (c) = S ((S (n)) * bcf_row_scale_bpoidm_middle)) /\ exists bcf_quotient_bpoidm_middle_decoded_value. bcf_row_code_bpoidm_middle = bcf_quotient_bpoidm_middle_decoded_value * S ((S (n)) * bcf_row_scale_bpoidm_middle) + (c))))))))) -> (exists bpr_quotient_bpoidm_result. c = (z) * bpr_quotient_bpoidm_result)Proof neighborhood
Direct theorem prerequisites
BT0002 add_comm BT0001 add_succ_left BT0015 add_le_add_left BT000E le_refl BT001F lt_trans BT00VF primorial_interval_divides_choose_betweenDirect 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 (6)
01Fix variables and assumptionsL1–5
02Use earlier factsL6–15
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L6
specialize primorial_interval_divides_choose_between (S n) - L7
specialize primorial_interval_divides_choose_between n - L8
specialize primorial_interval_divides_choose_between (S (n + n)) - L9
specialize primorial_interval_divides_choose_between n - L10
specialize primorial_interval_divides_choose_between (S n) - L11
specialize primorial_interval_divides_choose_between c - L12
specialize primorial_interval_divides_choose_between z - L13
apply primorial_interval_divides_choose_between - L14
apply PA4 - L15
exact hmiddle
03Use earlier factsL16–16
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L16
exact hinterval
04Fix variables and assumptionsL17–18
05Establish hrightL19–19
Establish this local claim before using it. It is not an additional assumption.
- L19
have hright : Lt(S n,S (S n + i))Definitions: Lt(S n,S (S n + i))Original native command in the exact edition
06Construct an explicit witnessL20–20
Supply the displayed value, then prove that it has the required property.
- L20
exists i
07Calculate and transport equalitiesL21–21
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L21
trans S (i + S n)
08Use earlier factsL22–22
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L22
apply PA4
09Calculate and transport equalitiesL23–23
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L23
congr
10Use earlier factsL24–24
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L24
apply add_comm
11Establish hleftL25–32
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply lt trans.
- L25
have hleft : Lt(n,S (S n + i))Definitions: Lt(n,S (S n + i))Original native command in the exact edition - L26
specialize lt_trans n - L27
specialize lt_trans (S n) - L28
specialize lt_trans (S (S n + i)) - L29
apply lt_trans - L30
specialize le_refl (S n) - L31
exact le_refl - L32
exact hright
12Establish hupperL33–33
Establish this local claim before using it. It is not an additional assumption.
- L33
have hupper : Lt(S n + i,S (n + n))Definitions: Lt(S n + i,S (n + n))Original native command in the exact edition
13Establish hrawL34–39
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply add le add left.
- L34
have hraw : Le(S n + S i,S n + n)Definitions: Le(S n + S i,S n + n)Original native command in the exact edition - L35
specialize add_le_add_left (S i) - L36
specialize add_le_add_left n - L37
specialize add_le_add_left (S n) - L38
apply add_le_add_left - L39
exact hi
14Establish hadd_leftL40–42
15Establish hadd_rightL43–48
16Separate the logical casesL49–49
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L49
split
17Use earlier factsL50–50
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L50
exact hleft
18Separate the logical casesL51–51
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L51
split
Original defined command ledger · 53 lines
- 0001
intro n - 0002
intro z - 0003
intro c - 0004
intro hinterval - 0005
intro hmiddle - 0006
specialize primorial_interval_divides_choose_between (S n) - 0007
specialize primorial_interval_divides_choose_between n - 0008
specialize primorial_interval_divides_choose_between (S (n + n)) - 0009
specialize primorial_interval_divides_choose_between n - 0010
specialize primorial_interval_divides_choose_between (S n) - 0011
specialize primorial_interval_divides_choose_between c - 0012
specialize primorial_interval_divides_choose_between z - 0013
apply primorial_interval_divides_choose_between - 0014
apply PA4 - 0015
exact hmiddle - 0016
exact hinterval - 0017
intro i - 0018
intro hi - 0019
have hright : Lt(S n,S (S n + i))Exact native replay line
have hright : exists g. g + S (S n) = S (S n + i) - 0020
exists i - 0021
trans S (i + S n) - 0022
apply PA4 - 0023
congr - 0024
apply add_comm - 0025
have hleft : Lt(n,S (S n + i))Exact native replay line
have hleft : exists g. g + S n = S (S n + i) - 0026
specialize lt_trans n - 0027
specialize lt_trans (S n) - 0028
specialize lt_trans (S (S n + i)) - 0029
apply lt_trans - 0030
specialize le_refl (S n) - 0031
exact le_refl - 0032
exact hright - 0033
have hupper : Lt(S n + i,S (n + n))Exact native replay line
have hupper : exists g. g + S (S n + i) = S (n + n) - 0034
have hraw : Le(S n + S i,S n + n)Exact native replay line
have hraw : exists g. g + (S n + S i) = S n + n - 0035
specialize add_le_add_left (S i) - 0036
specialize add_le_add_left n - 0037
specialize add_le_add_left (S n) - 0038
apply add_le_add_left - 0039
exact hi - 0040
have hadd_left : S n + S i = S (S n + i) - 0041
apply PA4 - 0042
rewrite hadd_left at hraw - 0043
have hadd_right : S n + n = S (n + n) - 0044
specialize add_succ_left n - 0045
specialize add_succ_left n - 0046
apply add_succ_left - 0047
rewrite hadd_right at hraw - 0048
exact hraw - 0049
split - 0050
exact hleft - 0051
split - 0052
exact hright - 0053
exact hupper