BT00VH · Bertrand theorem

primorial_odd_interval_divides_middle

Alpha v34 checked-use theorem · independently kernel and Lean verified; not Stable

The selector interval (n+1,2n+1] divides the odd middle coefficient.

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

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

53 script commands · 19 reading checkpoints · 6 local claims

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.

Definition notation is shown below. Open the paired exact edition for the original native formulas. Source pairing is not a new equivalence certificate.

Named ingredients (6)
01Fix variables and assumptionsL1–5

Work with arbitrary variables or the premises of the current implication.

  1. L1
    intro n
  2. L2
    intro z
  3. L3
    intro c
  4. L4
    intro hinterval
  5. L5
    intro hmiddle
02Use earlier factsL6–15

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L6
    specialize primorial_interval_divides_choose_between (S n)
  2. L7
    specialize primorial_interval_divides_choose_between n
  3. L8
    specialize primorial_interval_divides_choose_between (S (n + n))
  4. L9
    specialize primorial_interval_divides_choose_between n
  5. L10
    specialize primorial_interval_divides_choose_between (S n)
  6. L11
    specialize primorial_interval_divides_choose_between c
  7. L12
    specialize primorial_interval_divides_choose_between z
  8. L13
    apply primorial_interval_divides_choose_between
  9. L14
    apply PA4
  10. L15
    exact hmiddle
03Use earlier factsL16–16

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L16
    exact hinterval
04Fix variables and assumptionsL17–18

Work with arbitrary variables or the premises of the current implication.

  1. L17
    intro i
  2. L18
    intro hi
05Establish hrightL19–19

Establish this local claim before using it. It is not an additional assumption.

  1. 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.

  1. 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.

  1. L21
    trans S (i + S n)
08Use earlier factsL22–22

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. 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.

  1. L23
    congr
10Use earlier factsL24–24

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. 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.

  1. L25
    have hleft : Lt(n,S (S n + i))Definitions: Lt(n,S (S n + i))Original native command in the exact edition
  2. L26
    specialize lt_trans n
  3. L27
    specialize lt_trans (S n)
  4. L28
    specialize lt_trans (S (S n + i))
  5. L29
    apply lt_trans
  6. L30
    specialize le_refl (S n)
  7. L31
    exact le_refl
  8. L32
    exact hright
12Establish hupperL33–33

Establish this local claim before using it. It is not an additional assumption.

  1. 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.

  1. 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
  2. L35
    specialize add_le_add_left (S i)
  3. L36
    specialize add_le_add_left n
  4. L37
    specialize add_le_add_left (S n)
  5. L38
    apply add_le_add_left
  6. L39
    exact hi
14Establish hadd_leftL40–42

Establish this local claim before using it. It is not an additional assumption. The following proof commands apply PA4.

  1. L40
    have hadd_left : S n + S i = S (S n + i)
  2. L41
    apply PA4
  3. L42
    rewrite hadd_left at hraw
15Establish hadd_rightL43–48

Establish this local claim before using it. It is not an additional assumption. The following proof commands apply add succ left.

  1. L43
    have hadd_right : S n + n = S (n + n)
  2. L44
    specialize add_succ_left n
  3. L45
    specialize add_succ_left n
  4. L46
    apply add_succ_left
  5. L47
    rewrite hadd_right at hraw
  6. L48
    exact hraw
16Separate the logical casesL49–49

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L49
    split
17Use earlier factsL50–50

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L50
    exact hleft
18Separate the logical casesL51–51

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L51
    split
19Use earlier factsL52–53

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L52
    exact hright
  2. L53
    exact hupper

Library-wide reading audit

Original defined command ledger · 53 lines
  1. 0001intro n
  2. 0002intro z
  3. 0003intro c
  4. 0004intro hinterval
  5. 0005intro hmiddle
  6. 0006specialize primorial_interval_divides_choose_between (S n)
  7. 0007specialize primorial_interval_divides_choose_between n
  8. 0008specialize primorial_interval_divides_choose_between (S (n + n))
  9. 0009specialize primorial_interval_divides_choose_between n
  10. 0010specialize primorial_interval_divides_choose_between (S n)
  11. 0011specialize primorial_interval_divides_choose_between c
  12. 0012specialize primorial_interval_divides_choose_between z
  13. 0013apply primorial_interval_divides_choose_between
  14. 0014apply PA4
  15. 0015exact hmiddle
  16. 0016exact hinterval
  17. 0017intro i
  18. 0018intro hi
  19. 0019have hright : Lt(S n,S (S n + i))
    Exact native replay linehave hright : exists g. g + S (S n) = S (S n + i)
  20. 0020exists i
  21. 0021trans S (i + S n)
  22. 0022apply PA4
  23. 0023congr
  24. 0024apply add_comm
  25. 0025have hleft : Lt(n,S (S n + i))
    Exact native replay linehave hleft : exists g. g + S n = S (S n + i)
  26. 0026specialize lt_trans n
  27. 0027specialize lt_trans (S n)
  28. 0028specialize lt_trans (S (S n + i))
  29. 0029apply lt_trans
  30. 0030specialize le_refl (S n)
  31. 0031exact le_refl
  32. 0032exact hright
  33. 0033have hupper : Lt(S n + i,S (n + n))
    Exact native replay linehave hupper : exists g. g + S (S n + i) = S (n + n)
  34. 0034have hraw : Le(S n + S i,S n + n)
    Exact native replay linehave hraw : exists g. g + (S n + S i) = S n + n
  35. 0035specialize add_le_add_left (S i)
  36. 0036specialize add_le_add_left n
  37. 0037specialize add_le_add_left (S n)
  38. 0038apply add_le_add_left
  39. 0039exact hi
  40. 0040have hadd_left : S n + S i = S (S n + i)
  41. 0041apply PA4
  42. 0042rewrite hadd_left at hraw
  43. 0043have hadd_right : S n + n = S (n + n)
  44. 0044specialize add_succ_left n
  45. 0045specialize add_succ_left n
  46. 0046apply add_succ_left
  47. 0047rewrite hadd_right at hraw
  48. 0048exact hraw
  49. 0049split
  50. 0050exact hleft
  51. 0051split
  52. 0052exact hright
  53. 0053exact hupper