BT00VJ · Bertrand theorem

primorial_odd_interval_le_middle

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

The odd Primorial interval is bounded by 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)Le(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

1 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_le_gap_bpoilm_result. bpr_le_gap_bpoilm_result + (z) = (c))

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

29 script commands · 11 reading checkpoints · 2 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 (4)
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
02Establish hdividesL6–9

Establish this local claim before using it. It is not an additional assumption. The following proof commands apply primorial odd interval divides middle.

  1. L6
    have hdivides : Dvd(z,c)Definitions: Dvd(z,c)Original native command in the exact edition
  2. L7
    apply primorial_odd_interval_divides_middle
  3. L8
    exact hinterval
  4. L9
    exact hmiddle
03Establish hpositiveL10–14

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

  1. L10
    have hpositive : exists r. c = S r
  2. L11
    specialize choose_positive (S (n + n))
  3. L12
    specialize choose_positive n
  4. L13
    specialize choose_positive c
  5. L14
    apply choose_positive
04Construct an explicit witnessL15–15

Supply the displayed value, then prove that it has the required property.

  1. L15
    exists S n
05Use earlier factsL16–22

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

  1. L16
    specialize add_succ_left n
  2. L17
    specialize add_succ_left n
  3. L18
    exact add_succ_left
  4. L19
    exact hmiddle
  5. L20
    specialize divisor_le_nonzero z
  6. L21
    specialize divisor_le_nonzero c
  7. L22
    apply divisor_le_nonzero
06Fix variables and assumptionsL23–23

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

  1. L23
    intro hc
07Calculate and transport equalitiesL24–24

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L24
    rewrite hc at hpositive
08Separate the logical casesL25–25

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

  1. L25
    cases hpositive
09Use earlier factsL26–26

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

  1. L26
    apply PA1
10Calculate and transport equalitiesL27–27

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L27
    symm
11Use earlier factsL28–29

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

  1. L28
    exact hpositive_witness
  2. L29
    exact hdivides

Library-wide reading audit

Original defined command ledger · 29 lines
  1. 0001intro n
  2. 0002intro z
  3. 0003intro c
  4. 0004intro hinterval
  5. 0005intro hmiddle
  6. 0006have hdivides : Dvd(z,c)
    Exact native replay linehave hdivides : exists q. c = z * q
  7. 0007apply primorial_odd_interval_divides_middle
  8. 0008exact hinterval
  9. 0009exact hmiddle
  10. 0010have hpositive : exists r. c = S r
  11. 0011specialize choose_positive (S (n + n))
  12. 0012specialize choose_positive n
  13. 0013specialize choose_positive c
  14. 0014apply choose_positive
  15. 0015exists S n
  16. 0016specialize add_succ_left n
  17. 0017specialize add_succ_left n
  18. 0018exact add_succ_left
  19. 0019exact hmiddle
  20. 0020specialize divisor_le_nonzero z
  21. 0021specialize divisor_le_nonzero c
  22. 0022apply divisor_le_nonzero
  23. 0023intro hc
  24. 0024rewrite hc at hpositive
  25. 0025cases hpositive
  26. 0026apply PA1
  27. 0027symm
  28. 0028exact hpositive_witness
  29. 0029exact hdivides