BT010W · Bertrand theorem

no_bertrand_middle_contribution_choice_le_selector

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

Middle-range contributions are bounded by dense selector factors.

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. ∀ s. ∀ q. ∀ r. ∀ C. ∀ i. ∀ a. ∀ p. (∀ x. Lt(n,x)Le(x,n + n) → ¬Prime(x)) → Lt(2,n)FloorSqrt(n + n,s)DivRem(n + n,3,q,r)CentralBinom(n,C)Lt(s,S i)Lt(i,q)Prime(S i) ∧ (∃ x. PowerValuation(S i,C,x)Pow(S i,x,a)) ∨ ¬Prime(S i) ∧ a = 1 → Prime(S i) ∧ p = S i ∨ ¬Prime(S i) ∧ p = 1 → Le(a,p)

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

16 occurrences

In local proof propositions

4 occurrences

Exact expanded native-PA statement
forall n s q r C i a p. (forall bpr_prime_candidate_b5nbmcc_exclusion. ((exists bpr_gap_b5nbmcc_exclusion_lower. bpr_gap_b5nbmcc_exclusion_lower + S (n) = bpr_prime_candidate_b5nbmcc_exclusion) /\ (exists bpr_le_gap_b5nbmcc_exclusion_upper. bpr_le_gap_b5nbmcc_exclusion_upper + (bpr_prime_candidate_b5nbmcc_exclusion) = (n + n))) -> ~((~(bpr_prime_candidate_b5nbmcc_exclusion = 1) /\ forall bpr_left_b5nbmcc_exclusion_prime bpr_right_b5nbmcc_exclusion_prime. bpr_prime_candidate_b5nbmcc_exclusion = bpr_left_b5nbmcc_exclusion_prime * bpr_right_b5nbmcc_exclusion_prime -> bpr_left_b5nbmcc_exclusion_prime = 1 \/ bpr_right_b5nbmcc_exclusion_prime = 1))) -> (exists bcf_lt_gap_b5nbmcc_positive. bcf_lt_gap_b5nbmcc_positive + S (2) = n) -> (((exists bcs_sqrt_lower_gap_b5nbmcc_floor. bcs_sqrt_lower_gap_b5nbmcc_floor + (s) * (s) = (n + n)) /\ exists bcs_sqrt_upper_gap_b5nbmcc_floor. bcs_sqrt_upper_gap_b5nbmcc_floor + S (n + n) = S (s) * S (s))) -> (((n + n) = (3) * (q) + (r) /\ (exists bcf_lt_gap_b5nbmcc_division_bound. bcf_lt_gap_b5nbmcc_division_bound + S (r) = 3))) -> (((exists bcf_lt_gap_b5nbmcc_central_out_of_range. bcf_lt_gap_b5nbmcc_central_out_of_range + S (n + n) = n) /\ C = 0) \/ ((exists bcf_le_gap_b5nbmcc_central_in_range. bcf_le_gap_b5nbmcc_central_in_range + (n) = n + n) /\ (exists bcf_row_code_code_b5nbmcc_central bcf_row_code_scale_b5nbmcc_central bcf_row_scale_code_b5nbmcc_central bcf_row_scale_scale_b5nbmcc_central bcf_row_code_b5nbmcc_central bcf_row_scale_b5nbmcc_central. ((forall bcf_row_index_b5nbmcc_central_table. (exists bcf_lt_gap_b5nbmcc_central_table_row_bound. bcf_lt_gap_b5nbmcc_central_table_row_bound + S (bcf_row_index_b5nbmcc_central_table) = S (n + n)) -> exists bcf_row_code_b5nbmcc_central_table bcf_row_scale_b5nbmcc_central_table. ((((exists bcf_height_b5nbmcc_central_table_decoded_row_code. bcf_height_b5nbmcc_central_table_decoded_row_code + S (bcf_row_code_b5nbmcc_central_table) = S ((S (bcf_row_index_b5nbmcc_central_table)) * bcf_row_code_scale_b5nbmcc_central)) /\ exists bcf_quotient_b5nbmcc_central_table_decoded_row_code. bcf_row_code_code_b5nbmcc_central = bcf_quotient_b5nbmcc_central_table_decoded_row_code * S ((S (bcf_row_index_b5nbmcc_central_table)) * bcf_row_code_scale_b5nbmcc_central) + (bcf_row_code_b5nbmcc_central_table))) /\ ((((exists bcf_height_b5nbmcc_central_table_decoded_row_scale. bcf_height_b5nbmcc_central_table_decoded_row_scale + S (bcf_row_scale_b5nbmcc_central_table) = S ((S (bcf_row_index_b5nbmcc_central_table)) * bcf_row_scale_scale_b5nbmcc_central)) /\ exists bcf_quotient_b5nbmcc_central_table_decoded_row_scale. bcf_row_scale_code_b5nbmcc_central = bcf_quotient_b5nbmcc_central_table_decoded_row_scale * S ((S (bcf_row_index_b5nbmcc_central_table)) * bcf_row_scale_scale_b5nbmcc_central) + (bcf_row_scale_b5nbmcc_central_table))) /\ ((bcf_row_index_b5nbmcc_central_table = 0 /\ (forall bcf_index_b5nbmcc_central_table_zero_row. (exists bcf_lt_gap_b5nbmcc_central_table_zero_row_bound. bcf_lt_gap_b5nbmcc_central_table_zero_row_bound + S (bcf_index_b5nbmcc_central_table_zero_row) = S (n + n)) -> exists bcf_value_b5nbmcc_central_table_zero_row. ((((exists bcf_height_b5nbmcc_central_table_zero_row_entry. bcf_height_b5nbmcc_central_table_zero_row_entry + S (bcf_value_b5nbmcc_central_table_zero_row) = S ((S (bcf_index_b5nbmcc_central_table_zero_row)) * bcf_row_scale_b5nbmcc_central_table)) /\ exists bcf_quotient_b5nbmcc_central_table_zero_row_entry. bcf_row_code_b5nbmcc_central_table = bcf_quotient_b5nbmcc_central_table_zero_row_entry * S ((S (bcf_index_b5nbmcc_central_table_zero_row)) * bcf_row_scale_b5nbmcc_central_table) + (bcf_value_b5nbmcc_central_table_zero_row))) /\ ((bcf_index_b5nbmcc_central_table_zero_row = 0 /\ bcf_value_b5nbmcc_central_table_zero_row = 1) \/ exists bcf_predecessor_b5nbmcc_central_table_zero_row. bcf_index_b5nbmcc_central_table_zero_row = S bcf_predecessor_b5nbmcc_central_table_zero_row /\ bcf_value_b5nbmcc_central_table_zero_row = 0)))) \/ exists bcf_predecessor_b5nbmcc_central_table bcf_previous_code_b5nbmcc_central_table bcf_previous_scale_b5nbmcc_central_table. bcf_row_index_b5nbmcc_central_table = S bcf_predecessor_b5nbmcc_central_table /\ ((((exists bcf_height_b5nbmcc_central_table_decoded_previous_code. bcf_height_b5nbmcc_central_table_decoded_previous_code + S (bcf_previous_code_b5nbmcc_central_table) = S ((S (bcf_predecessor_b5nbmcc_central_table)) * bcf_row_code_scale_b5nbmcc_central)) /\ exists bcf_quotient_b5nbmcc_central_table_decoded_previous_code. bcf_row_code_code_b5nbmcc_central = bcf_quotient_b5nbmcc_central_table_decoded_previous_code * S ((S (bcf_predecessor_b5nbmcc_central_table)) * bcf_row_code_scale_b5nbmcc_central) + (bcf_previous_code_b5nbmcc_central_table))) /\ ((((exists bcf_height_b5nbmcc_central_table_decoded_previous_scale. bcf_height_b5nbmcc_central_table_decoded_previous_scale + S (bcf_previous_scale_b5nbmcc_central_table) = S ((S (bcf_predecessor_b5nbmcc_central_table)) * bcf_row_scale_scale_b5nbmcc_central)) /\ exists bcf_quotient_b5nbmcc_central_table_decoded_previous_scale. bcf_row_scale_code_b5nbmcc_central = bcf_quotient_b5nbmcc_central_table_decoded_previous_scale * S ((S (bcf_predecessor_b5nbmcc_central_table)) * bcf_row_scale_scale_b5nbmcc_central) + (bcf_previous_scale_b5nbmcc_central_table))) /\ (forall bcf_index_b5nbmcc_central_table_row_step. (exists bcf_lt_gap_b5nbmcc_central_table_row_step_bound. bcf_lt_gap_b5nbmcc_central_table_row_step_bound + S (bcf_index_b5nbmcc_central_table_row_step) = S (n + n)) -> exists bcf_value_b5nbmcc_central_table_row_step. ((((exists bcf_height_b5nbmcc_central_table_row_step_entry. bcf_height_b5nbmcc_central_table_row_step_entry + S (bcf_value_b5nbmcc_central_table_row_step) = S ((S (bcf_index_b5nbmcc_central_table_row_step)) * bcf_row_scale_b5nbmcc_central_table)) /\ exists bcf_quotient_b5nbmcc_central_table_row_step_entry. bcf_row_code_b5nbmcc_central_table = bcf_quotient_b5nbmcc_central_table_row_step_entry * S ((S (bcf_index_b5nbmcc_central_table_row_step)) * bcf_row_scale_b5nbmcc_central_table) + (bcf_value_b5nbmcc_central_table_row_step))) /\ ((bcf_index_b5nbmcc_central_table_row_step = 0 /\ bcf_value_b5nbmcc_central_table_row_step = 1) \/ exists bcf_predecessor_b5nbmcc_central_table_row_step bcf_left_b5nbmcc_central_table_row_step bcf_right_b5nbmcc_central_table_row_step. bcf_index_b5nbmcc_central_table_row_step = S bcf_predecessor_b5nbmcc_central_table_row_step /\ ((((exists bcf_height_b5nbmcc_central_table_row_step_previous_left. bcf_height_b5nbmcc_central_table_row_step_previous_left + S (bcf_left_b5nbmcc_central_table_row_step) = S ((S (bcf_predecessor_b5nbmcc_central_table_row_step)) * bcf_previous_scale_b5nbmcc_central_table)) /\ exists bcf_quotient_b5nbmcc_central_table_row_step_previous_left. bcf_previous_code_b5nbmcc_central_table = bcf_quotient_b5nbmcc_central_table_row_step_previous_left * S ((S (bcf_predecessor_b5nbmcc_central_table_row_step)) * bcf_previous_scale_b5nbmcc_central_table) + (bcf_left_b5nbmcc_central_table_row_step))) /\ ((((exists bcf_height_b5nbmcc_central_table_row_step_previous_right. bcf_height_b5nbmcc_central_table_row_step_previous_right + S (bcf_right_b5nbmcc_central_table_row_step) = S ((S (S (bcf_predecessor_b5nbmcc_central_table_row_step))) * bcf_previous_scale_b5nbmcc_central_table)) /\ exists bcf_quotient_b5nbmcc_central_table_row_step_previous_right. bcf_previous_code_b5nbmcc_central_table = bcf_quotient_b5nbmcc_central_table_row_step_previous_right * S ((S (S (bcf_predecessor_b5nbmcc_central_table_row_step))) * bcf_previous_scale_b5nbmcc_central_table) + (bcf_right_b5nbmcc_central_table_row_step))) /\ bcf_value_b5nbmcc_central_table_row_step = bcf_left_b5nbmcc_central_table_row_step + bcf_right_b5nbmcc_central_table_row_step))))))))))) /\ ((((exists bcf_height_b5nbmcc_central_decoded_row_code. bcf_height_b5nbmcc_central_decoded_row_code + S (bcf_row_code_b5nbmcc_central) = S ((S (n + n)) * bcf_row_code_scale_b5nbmcc_central)) /\ exists bcf_quotient_b5nbmcc_central_decoded_row_code. bcf_row_code_code_b5nbmcc_central = bcf_quotient_b5nbmcc_central_decoded_row_code * S ((S (n + n)) * bcf_row_code_scale_b5nbmcc_central) + (bcf_row_code_b5nbmcc_central))) /\ ((((exists bcf_height_b5nbmcc_central_decoded_row_scale. bcf_height_b5nbmcc_central_decoded_row_scale + S (bcf_row_scale_b5nbmcc_central) = S ((S (n + n)) * bcf_row_scale_scale_b5nbmcc_central)) /\ exists bcf_quotient_b5nbmcc_central_decoded_row_scale. bcf_row_scale_code_b5nbmcc_central = bcf_quotient_b5nbmcc_central_decoded_row_scale * S ((S (n + n)) * bcf_row_scale_scale_b5nbmcc_central) + (bcf_row_scale_b5nbmcc_central))) /\ (((exists bcf_height_b5nbmcc_central_decoded_value. bcf_height_b5nbmcc_central_decoded_value + S (C) = S ((S (n)) * bcf_row_scale_b5nbmcc_central)) /\ exists bcf_quotient_b5nbmcc_central_decoded_value. bcf_row_code_b5nbmcc_central = bcf_quotient_b5nbmcc_central_decoded_value * S ((S (n)) * bcf_row_scale_b5nbmcc_central) + (C))))))))) -> (exists bcf_lt_gap_b5nbmcc_above. bcf_lt_gap_b5nbmcc_above + S (s) = S i) -> (exists bcf_le_gap_b5nbmcc_bound. bcf_le_gap_b5nbmcc_bound + (S i) = q) -> (((((~(S (i) = 1) /\ forall bpr_left_b5nbmcc_choice_prime bpr_right_b5nbmcc_choice_prime. S (i) = bpr_left_b5nbmcc_choice_prime * bpr_right_b5nbmcc_choice_prime -> bpr_left_b5nbmcc_choice_prime = 1 \/ bpr_right_b5nbmcc_choice_prime = 1)) /\ exists bpr_choice_exponent_b5nbmcc_choice. ((((exists bpr_le_gap_b5nbmcc_choice_valuation_selected_bound. bpr_le_gap_b5nbmcc_choice_valuation_selected_bound + (bpr_choice_exponent_b5nbmcc_choice) = (C)) /\ (exists bpr_power_value_b5nbmcc_choice_valuation_selected. ((exists bpr_power_code_b5nbmcc_choice_valuation_selected_power bpr_power_scale_b5nbmcc_choice_valuation_selected_power. ((forall bpr_power_index_b5nbmcc_choice_valuation_selected_power. (exists bpr_gap_b5nbmcc_choice_valuation_selected_power_repeat_bound. bpr_gap_b5nbmcc_choice_valuation_selected_power_repeat_bound + S (bpr_power_index_b5nbmcc_choice_valuation_selected_power) = bpr_choice_exponent_b5nbmcc_choice) -> (((exists bpr_height_b5nbmcc_choice_valuation_selected_power_repeat_entry. bpr_height_b5nbmcc_choice_valuation_selected_power_repeat_entry + S (S (i)) = S ((S (bpr_power_index_b5nbmcc_choice_valuation_selected_power)) * bpr_power_scale_b5nbmcc_choice_valuation_selected_power)) /\ exists bpr_quotient_b5nbmcc_choice_valuation_selected_power_repeat_entry. bpr_power_code_b5nbmcc_choice_valuation_selected_power = bpr_quotient_b5nbmcc_choice_valuation_selected_power_repeat_entry * S ((S (bpr_power_index_b5nbmcc_choice_valuation_selected_power)) * bpr_power_scale_b5nbmcc_choice_valuation_selected_power) + (S (i))))) /\ (exists ff_u_b5nbmcc_choice_valuation_selected_power_product ff_v_b5nbmcc_choice_valuation_selected_power_product. ((((exists ff_h_b5nbmcc_choice_valuation_selected_power_product_start. ff_h_b5nbmcc_choice_valuation_selected_power_product_start + S (1) = S ((S (0)) * ff_v_b5nbmcc_choice_valuation_selected_power_product)) /\ exists ff_q_b5nbmcc_choice_valuation_selected_power_product_start. ff_u_b5nbmcc_choice_valuation_selected_power_product = ff_q_b5nbmcc_choice_valuation_selected_power_product_start * S ((S (0)) * ff_v_b5nbmcc_choice_valuation_selected_power_product) + (1))) /\ ((((exists ff_h_b5nbmcc_choice_valuation_selected_power_product_terminal. ff_h_b5nbmcc_choice_valuation_selected_power_product_terminal + S (bpr_power_value_b5nbmcc_choice_valuation_selected) = S ((S (bpr_choice_exponent_b5nbmcc_choice)) * ff_v_b5nbmcc_choice_valuation_selected_power_product)) /\ exists ff_q_b5nbmcc_choice_valuation_selected_power_product_terminal. ff_u_b5nbmcc_choice_valuation_selected_power_product = ff_q_b5nbmcc_choice_valuation_selected_power_product_terminal * S ((S (bpr_choice_exponent_b5nbmcc_choice)) * ff_v_b5nbmcc_choice_valuation_selected_power_product) + (bpr_power_value_b5nbmcc_choice_valuation_selected))) /\ forall ff_i_b5nbmcc_choice_valuation_selected_power_product. (exists ff_lt_b5nbmcc_choice_valuation_selected_power_product_bound. ff_lt_b5nbmcc_choice_valuation_selected_power_product_bound + S ff_i_b5nbmcc_choice_valuation_selected_power_product = bpr_choice_exponent_b5nbmcc_choice) -> exists ff_p_b5nbmcc_choice_valuation_selected_power_product ff_r_b5nbmcc_choice_valuation_selected_power_product ff_s_b5nbmcc_choice_valuation_selected_power_product. ((((exists ff_h_b5nbmcc_choice_valuation_selected_power_product_factor. ff_h_b5nbmcc_choice_valuation_selected_power_product_factor + S (ff_p_b5nbmcc_choice_valuation_selected_power_product) = S ((S (ff_i_b5nbmcc_choice_valuation_selected_power_product)) * bpr_power_scale_b5nbmcc_choice_valuation_selected_power)) /\ exists ff_q_b5nbmcc_choice_valuation_selected_power_product_factor. bpr_power_code_b5nbmcc_choice_valuation_selected_power = ff_q_b5nbmcc_choice_valuation_selected_power_product_factor * S ((S (ff_i_b5nbmcc_choice_valuation_selected_power_product)) * bpr_power_scale_b5nbmcc_choice_valuation_selected_power) + (ff_p_b5nbmcc_choice_valuation_selected_power_product))) /\ ((((exists ff_h_b5nbmcc_choice_valuation_selected_power_product_partial. ff_h_b5nbmcc_choice_valuation_selected_power_product_partial + S (ff_r_b5nbmcc_choice_valuation_selected_power_product) = S ((S (ff_i_b5nbmcc_choice_valuation_selected_power_product)) * ff_v_b5nbmcc_choice_valuation_selected_power_product)) /\ exists ff_q_b5nbmcc_choice_valuation_selected_power_product_partial. ff_u_b5nbmcc_choice_valuation_selected_power_product = ff_q_b5nbmcc_choice_valuation_selected_power_product_partial * S ((S (ff_i_b5nbmcc_choice_valuation_selected_power_product)) * ff_v_b5nbmcc_choice_valuation_selected_power_product) + (ff_r_b5nbmcc_choice_valuation_selected_power_product))) /\ ((((exists ff_h_b5nbmcc_choice_valuation_selected_power_product_successor. ff_h_b5nbmcc_choice_valuation_selected_power_product_successor + S (ff_s_b5nbmcc_choice_valuation_selected_power_product) = S ((S (S ff_i_b5nbmcc_choice_valuation_selected_power_product)) * ff_v_b5nbmcc_choice_valuation_selected_power_product)) /\ exists ff_q_b5nbmcc_choice_valuation_selected_power_product_successor. ff_u_b5nbmcc_choice_valuation_selected_power_product = ff_q_b5nbmcc_choice_valuation_selected_power_product_successor * S ((S (S ff_i_b5nbmcc_choice_valuation_selected_power_product)) * ff_v_b5nbmcc_choice_valuation_selected_power_product) + (ff_s_b5nbmcc_choice_valuation_selected_power_product))) /\ ff_s_b5nbmcc_choice_valuation_selected_power_product = ff_r_b5nbmcc_choice_valuation_selected_power_product * ff_p_b5nbmcc_choice_valuation_selected_power_product)))))))) /\ (exists bpr_divides_quotient_b5nbmcc_choice_valuation_selected_divides. C = (bpr_power_value_b5nbmcc_choice_valuation_selected) * bpr_divides_quotient_b5nbmcc_choice_valuation_selected_divides)))) /\ forall bpr_valuation_candidate_b5nbmcc_choice_valuation. (exists bpr_le_gap_b5nbmcc_choice_valuation_candidate_bound. bpr_le_gap_b5nbmcc_choice_valuation_candidate_bound + (bpr_valuation_candidate_b5nbmcc_choice_valuation) = (C)) -> (exists bpr_power_value_b5nbmcc_choice_valuation_candidate. ((exists bpr_power_code_b5nbmcc_choice_valuation_candidate_power bpr_power_scale_b5nbmcc_choice_valuation_candidate_power. ((forall bpr_power_index_b5nbmcc_choice_valuation_candidate_power. (exists bpr_gap_b5nbmcc_choice_valuation_candidate_power_repeat_bound. bpr_gap_b5nbmcc_choice_valuation_candidate_power_repeat_bound + S (bpr_power_index_b5nbmcc_choice_valuation_candidate_power) = bpr_valuation_candidate_b5nbmcc_choice_valuation) -> (((exists bpr_height_b5nbmcc_choice_valuation_candidate_power_repeat_entry. bpr_height_b5nbmcc_choice_valuation_candidate_power_repeat_entry + S (S (i)) = S ((S (bpr_power_index_b5nbmcc_choice_valuation_candidate_power)) * bpr_power_scale_b5nbmcc_choice_valuation_candidate_power)) /\ exists bpr_quotient_b5nbmcc_choice_valuation_candidate_power_repeat_entry. bpr_power_code_b5nbmcc_choice_valuation_candidate_power = bpr_quotient_b5nbmcc_choice_valuation_candidate_power_repeat_entry * S ((S (bpr_power_index_b5nbmcc_choice_valuation_candidate_power)) * bpr_power_scale_b5nbmcc_choice_valuation_candidate_power) + (S (i))))) /\ (exists ff_u_b5nbmcc_choice_valuation_candidate_power_product ff_v_b5nbmcc_choice_valuation_candidate_power_product. ((((exists ff_h_b5nbmcc_choice_valuation_candidate_power_product_start. ff_h_b5nbmcc_choice_valuation_candidate_power_product_start + S (1) = S ((S (0)) * ff_v_b5nbmcc_choice_valuation_candidate_power_product)) /\ exists ff_q_b5nbmcc_choice_valuation_candidate_power_product_start. ff_u_b5nbmcc_choice_valuation_candidate_power_product = ff_q_b5nbmcc_choice_valuation_candidate_power_product_start * S ((S (0)) * ff_v_b5nbmcc_choice_valuation_candidate_power_product) + (1))) /\ ((((exists ff_h_b5nbmcc_choice_valuation_candidate_power_product_terminal. ff_h_b5nbmcc_choice_valuation_candidate_power_product_terminal + S (bpr_power_value_b5nbmcc_choice_valuation_candidate) = S ((S (bpr_valuation_candidate_b5nbmcc_choice_valuation)) * ff_v_b5nbmcc_choice_valuation_candidate_power_product)) /\ exists ff_q_b5nbmcc_choice_valuation_candidate_power_product_terminal. ff_u_b5nbmcc_choice_valuation_candidate_power_product = ff_q_b5nbmcc_choice_valuation_candidate_power_product_terminal * S ((S (bpr_valuation_candidate_b5nbmcc_choice_valuation)) * ff_v_b5nbmcc_choice_valuation_candidate_power_product) + (bpr_power_value_b5nbmcc_choice_valuation_candidate))) /\ forall ff_i_b5nbmcc_choice_valuation_candidate_power_product. (exists ff_lt_b5nbmcc_choice_valuation_candidate_power_product_bound. ff_lt_b5nbmcc_choice_valuation_candidate_power_product_bound + S ff_i_b5nbmcc_choice_valuation_candidate_power_product = bpr_valuation_candidate_b5nbmcc_choice_valuation) -> exists ff_p_b5nbmcc_choice_valuation_candidate_power_product ff_r_b5nbmcc_choice_valuation_candidate_power_product ff_s_b5nbmcc_choice_valuation_candidate_power_product. ((((exists ff_h_b5nbmcc_choice_valuation_candidate_power_product_factor. ff_h_b5nbmcc_choice_valuation_candidate_power_product_factor + S (ff_p_b5nbmcc_choice_valuation_candidate_power_product) = S ((S (ff_i_b5nbmcc_choice_valuation_candidate_power_product)) * bpr_power_scale_b5nbmcc_choice_valuation_candidate_power)) /\ exists ff_q_b5nbmcc_choice_valuation_candidate_power_product_factor. bpr_power_code_b5nbmcc_choice_valuation_candidate_power = ff_q_b5nbmcc_choice_valuation_candidate_power_product_factor * S ((S (ff_i_b5nbmcc_choice_valuation_candidate_power_product)) * bpr_power_scale_b5nbmcc_choice_valuation_candidate_power) + (ff_p_b5nbmcc_choice_valuation_candidate_power_product))) /\ ((((exists ff_h_b5nbmcc_choice_valuation_candidate_power_product_partial. ff_h_b5nbmcc_choice_valuation_candidate_power_product_partial + S (ff_r_b5nbmcc_choice_valuation_candidate_power_product) = S ((S (ff_i_b5nbmcc_choice_valuation_candidate_power_product)) * ff_v_b5nbmcc_choice_valuation_candidate_power_product)) /\ exists ff_q_b5nbmcc_choice_valuation_candidate_power_product_partial. ff_u_b5nbmcc_choice_valuation_candidate_power_product = ff_q_b5nbmcc_choice_valuation_candidate_power_product_partial * S ((S (ff_i_b5nbmcc_choice_valuation_candidate_power_product)) * ff_v_b5nbmcc_choice_valuation_candidate_power_product) + (ff_r_b5nbmcc_choice_valuation_candidate_power_product))) /\ ((((exists ff_h_b5nbmcc_choice_valuation_candidate_power_product_successor. ff_h_b5nbmcc_choice_valuation_candidate_power_product_successor + S (ff_s_b5nbmcc_choice_valuation_candidate_power_product) = S ((S (S ff_i_b5nbmcc_choice_valuation_candidate_power_product)) * ff_v_b5nbmcc_choice_valuation_candidate_power_product)) /\ exists ff_q_b5nbmcc_choice_valuation_candidate_power_product_successor. ff_u_b5nbmcc_choice_valuation_candidate_power_product = ff_q_b5nbmcc_choice_valuation_candidate_power_product_successor * S ((S (S ff_i_b5nbmcc_choice_valuation_candidate_power_product)) * ff_v_b5nbmcc_choice_valuation_candidate_power_product) + (ff_s_b5nbmcc_choice_valuation_candidate_power_product))) /\ ff_s_b5nbmcc_choice_valuation_candidate_power_product = ff_r_b5nbmcc_choice_valuation_candidate_power_product * ff_p_b5nbmcc_choice_valuation_candidate_power_product)))))))) /\ (exists bpr_divides_quotient_b5nbmcc_choice_valuation_candidate_divides. C = (bpr_power_value_b5nbmcc_choice_valuation_candidate) * bpr_divides_quotient_b5nbmcc_choice_valuation_candidate_divides))) -> (exists bpr_le_gap_b5nbmcc_choice_valuation_candidate_below. bpr_le_gap_b5nbmcc_choice_valuation_candidate_below + (bpr_valuation_candidate_b5nbmcc_choice_valuation) = (bpr_choice_exponent_b5nbmcc_choice))) /\ (exists bpr_power_code_b5nbmcc_choice_power bpr_power_scale_b5nbmcc_choice_power. ((forall bpr_power_index_b5nbmcc_choice_power. (exists bpr_gap_b5nbmcc_choice_power_repeat_bound. bpr_gap_b5nbmcc_choice_power_repeat_bound + S (bpr_power_index_b5nbmcc_choice_power) = bpr_choice_exponent_b5nbmcc_choice) -> (((exists bpr_height_b5nbmcc_choice_power_repeat_entry. bpr_height_b5nbmcc_choice_power_repeat_entry + S (S (i)) = S ((S (bpr_power_index_b5nbmcc_choice_power)) * bpr_power_scale_b5nbmcc_choice_power)) /\ exists bpr_quotient_b5nbmcc_choice_power_repeat_entry. bpr_power_code_b5nbmcc_choice_power = bpr_quotient_b5nbmcc_choice_power_repeat_entry * S ((S (bpr_power_index_b5nbmcc_choice_power)) * bpr_power_scale_b5nbmcc_choice_power) + (S (i))))) /\ (exists ff_u_b5nbmcc_choice_power_product ff_v_b5nbmcc_choice_power_product. ((((exists ff_h_b5nbmcc_choice_power_product_start. ff_h_b5nbmcc_choice_power_product_start + S (1) = S ((S (0)) * ff_v_b5nbmcc_choice_power_product)) /\ exists ff_q_b5nbmcc_choice_power_product_start. ff_u_b5nbmcc_choice_power_product = ff_q_b5nbmcc_choice_power_product_start * S ((S (0)) * ff_v_b5nbmcc_choice_power_product) + (1))) /\ ((((exists ff_h_b5nbmcc_choice_power_product_terminal. ff_h_b5nbmcc_choice_power_product_terminal + S (a) = S ((S (bpr_choice_exponent_b5nbmcc_choice)) * ff_v_b5nbmcc_choice_power_product)) /\ exists ff_q_b5nbmcc_choice_power_product_terminal. ff_u_b5nbmcc_choice_power_product = ff_q_b5nbmcc_choice_power_product_terminal * S ((S (bpr_choice_exponent_b5nbmcc_choice)) * ff_v_b5nbmcc_choice_power_product) + (a))) /\ forall ff_i_b5nbmcc_choice_power_product. (exists ff_lt_b5nbmcc_choice_power_product_bound. ff_lt_b5nbmcc_choice_power_product_bound + S ff_i_b5nbmcc_choice_power_product = bpr_choice_exponent_b5nbmcc_choice) -> exists ff_p_b5nbmcc_choice_power_product ff_r_b5nbmcc_choice_power_product ff_s_b5nbmcc_choice_power_product. ((((exists ff_h_b5nbmcc_choice_power_product_factor. ff_h_b5nbmcc_choice_power_product_factor + S (ff_p_b5nbmcc_choice_power_product) = S ((S (ff_i_b5nbmcc_choice_power_product)) * bpr_power_scale_b5nbmcc_choice_power)) /\ exists ff_q_b5nbmcc_choice_power_product_factor. bpr_power_code_b5nbmcc_choice_power = ff_q_b5nbmcc_choice_power_product_factor * S ((S (ff_i_b5nbmcc_choice_power_product)) * bpr_power_scale_b5nbmcc_choice_power) + (ff_p_b5nbmcc_choice_power_product))) /\ ((((exists ff_h_b5nbmcc_choice_power_product_partial. ff_h_b5nbmcc_choice_power_product_partial + S (ff_r_b5nbmcc_choice_power_product) = S ((S (ff_i_b5nbmcc_choice_power_product)) * ff_v_b5nbmcc_choice_power_product)) /\ exists ff_q_b5nbmcc_choice_power_product_partial. ff_u_b5nbmcc_choice_power_product = ff_q_b5nbmcc_choice_power_product_partial * S ((S (ff_i_b5nbmcc_choice_power_product)) * ff_v_b5nbmcc_choice_power_product) + (ff_r_b5nbmcc_choice_power_product))) /\ ((((exists ff_h_b5nbmcc_choice_power_product_successor. ff_h_b5nbmcc_choice_power_product_successor + S (ff_s_b5nbmcc_choice_power_product) = S ((S (S ff_i_b5nbmcc_choice_power_product)) * ff_v_b5nbmcc_choice_power_product)) /\ exists ff_q_b5nbmcc_choice_power_product_successor. ff_u_b5nbmcc_choice_power_product = ff_q_b5nbmcc_choice_power_product_successor * S ((S (S ff_i_b5nbmcc_choice_power_product)) * ff_v_b5nbmcc_choice_power_product) + (ff_s_b5nbmcc_choice_power_product))) /\ ff_s_b5nbmcc_choice_power_product = ff_r_b5nbmcc_choice_power_product * ff_p_b5nbmcc_choice_power_product)))))))))) \/ (~((~(S (i) = 1) /\ forall bpr_left_b5nbmcc_choice_prime bpr_right_b5nbmcc_choice_prime. S (i) = bpr_left_b5nbmcc_choice_prime * bpr_right_b5nbmcc_choice_prime -> bpr_left_b5nbmcc_choice_prime = 1 \/ bpr_right_b5nbmcc_choice_prime = 1)) /\ a = 1))) -> (((((~(S (i) = 1) /\ forall bpr_left_b5nbmcc_selector_prime bpr_right_b5nbmcc_selector_prime. S (i) = bpr_left_b5nbmcc_selector_prime * bpr_right_b5nbmcc_selector_prime -> bpr_left_b5nbmcc_selector_prime = 1 \/ bpr_right_b5nbmcc_selector_prime = 1)) /\ p = S (i)) \/ (~((~(S (i) = 1) /\ forall bpr_left_b5nbmcc_selector_prime bpr_right_b5nbmcc_selector_prime. S (i) = bpr_left_b5nbmcc_selector_prime * bpr_right_b5nbmcc_selector_prime -> bpr_left_b5nbmcc_selector_prime = 1 \/ bpr_right_b5nbmcc_selector_prime = 1)) /\ p = 1))) -> (exists bcf_le_gap_b5nbmcc_result. bcf_le_gap_b5nbmcc_result + (a) = p)

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

64 script commands · 18 reading checkpoints · 1 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 (3)
01Fix variables and assumptionsL1–10

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

  1. L1
    intro n
  2. L2
    intro s
  3. L3
    intro q
  4. L4
    intro r
  5. L5
    intro C
  6. L6
    intro i
  7. L7
    intro a
  8. L8
    intro p
  9. L9
    intro hexclusion
  10. L10
    intro hpositive
02Fix variables and assumptionsL11–17

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

  1. L11
    intro hfloor
  2. L12
    intro hdivision
  3. L13
    intro hcentral
  4. L14
    intro habove
  5. L15
    intro hbound
  6. L16
    intro hchoice
  7. L17
    intro hselector
03Separate the logical casesL18–19

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

  1. L18
    cases hselector
  2. L19
    cases hselector_left
04Establish hrangesL20–29

Establish this local claim before using it. It is not an additional assumption. The following proof commands apply no bertrand central contribution choice ranges.

  1. L20
    have hranges : Lt(i,s) ∧ Le(a,n + n) ∨ Lt(s,S i) ∧ Lt(i,q) ∧ a = S i ∨ a = 1Definitions: Lt(i,s)Le(a,n + n)Lt(s,S i)Lt(i,q)Original native command in the exact edition
  2. L21
    specialize no_bertrand_central_contribution_choice_ranges n
  3. L22
    specialize no_bertrand_central_contribution_choice_ranges s
  4. L23
    specialize no_bertrand_central_contribution_choice_ranges q
  5. L24
    specialize no_bertrand_central_contribution_choice_ranges r
  6. L25
    specialize no_bertrand_central_contribution_choice_ranges C
  7. L26
    specialize no_bertrand_central_contribution_choice_ranges i
  8. L27
    specialize no_bertrand_central_contribution_choice_ranges a
  9. L28
    apply no_bertrand_central_contribution_choice_ranges
  10. L29
    exact hexclusion
05Use earlier factsL30–34

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

  1. L30
    exact hpositive
  2. L31
    exact hfloor
  3. L32
    exact hdivision
  4. L33
    exact hcentral
  5. L34
    exact hchoice
06Separate the logical casesL35–38

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

  1. L35
    cases hranges
  2. L36
    cases hranges_left
  3. L37
    cases hranges_left_left
  4. L38
    exfalso
07Use earlier factsL39–43

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

  1. L39
    specialize lt_not_le s
  2. L40
    specialize lt_not_le (S i)
  3. L41
    apply lt_not_le
  4. L42
    exact habove
  5. L43
    exact hranges_left_left_left
08Separate the logical casesL44–45

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

  1. L44
    cases hranges_left_right
  2. L45
    cases hranges_left_right_left
09Calculate and transport equalitiesL46–47

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

  1. L46
    rewrite hranges_left_right_right
  2. L47
    rewrite hselector_left_right
10Use earlier factsL48–49

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

  1. L48
    specialize le_refl (S i)
  2. L49
    exact le_refl
11Calculate and transport equalitiesL50–51

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

  1. L50
    rewrite hranges_right
  2. L51
    rewrite hselector_left_right
12Construct an explicit witnessL52–52

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

  1. L52
    exists i
13Calculate and transport equalitiesL53–53

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

  1. L53
    simp
14Separate the logical casesL54–57

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

  1. L54
    cases hselector_right
  2. L55
    cases hchoice
  3. L56
    cases hchoice_left
  4. L57
    exfalso
15Use earlier factsL58–59

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

  1. L58
    apply hselector_right_left
  2. L59
    exact hchoice_left_left
16Separate the logical casesL60–60

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

  1. L60
    cases hchoice_right
17Calculate and transport equalitiesL61–62

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

  1. L61
    rewrite hchoice_right_right
  2. L62
    rewrite hselector_right_right
18Use earlier factsL63–64

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

  1. L63
    specialize le_refl 1
  2. L64
    exact le_refl

Library-wide reading audit

Original defined command ledger · 64 lines
  1. 0001intro n
  2. 0002intro s
  3. 0003intro q
  4. 0004intro r
  5. 0005intro C
  6. 0006intro i
  7. 0007intro a
  8. 0008intro p
  9. 0009intro hexclusion
  10. 0010intro hpositive
  11. 0011intro hfloor
  12. 0012intro hdivision
  13. 0013intro hcentral
  14. 0014intro habove
  15. 0015intro hbound
  16. 0016intro hchoice
  17. 0017intro hselector
  18. 0018cases hselector
  19. 0019cases hselector_left
  20. 0020have hranges : Lt(i,s)Le(a,n + n)Lt(s,S i)Lt(i,q) ∧ a = S i ∨ a = 1
    Exact native replay linehave hranges : ((exists bcf_le_gap_b5nbmcc_small_bound. bcf_le_gap_b5nbmcc_small_bound + (S i) = s) /\ (exists bcf_le_gap_b5nbmcc_small_value. bcf_le_gap_b5nbmcc_small_value + (a) = n + n)) \/ (((exists bcf_lt_gap_b5nbmcc_above. bcf_lt_gap_b5nbmcc_above + S (s) = S i) /\ (exists bcf_le_gap_b5nbmcc_bound. bcf_le_gap_b5nbmcc_bound + (S i) = q)) /\ a = S i) \/ a = 1
  21. 0021specialize no_bertrand_central_contribution_choice_ranges n
  22. 0022specialize no_bertrand_central_contribution_choice_ranges s
  23. 0023specialize no_bertrand_central_contribution_choice_ranges q
  24. 0024specialize no_bertrand_central_contribution_choice_ranges r
  25. 0025specialize no_bertrand_central_contribution_choice_ranges C
  26. 0026specialize no_bertrand_central_contribution_choice_ranges i
  27. 0027specialize no_bertrand_central_contribution_choice_ranges a
  28. 0028apply no_bertrand_central_contribution_choice_ranges
  29. 0029exact hexclusion
  30. 0030exact hpositive
  31. 0031exact hfloor
  32. 0032exact hdivision
  33. 0033exact hcentral
  34. 0034exact hchoice
  35. 0035cases hranges
  36. 0036cases hranges_left
  37. 0037cases hranges_left_left
  38. 0038exfalso
  39. 0039specialize lt_not_le s
  40. 0040specialize lt_not_le (S i)
  41. 0041apply lt_not_le
  42. 0042exact habove
  43. 0043exact hranges_left_left_left
  44. 0044cases hranges_left_right
  45. 0045cases hranges_left_right_left
  46. 0046rewrite hranges_left_right_right
  47. 0047rewrite hselector_left_right
  48. 0048specialize le_refl (S i)
  49. 0049exact le_refl
  50. 0050rewrite hranges_right
  51. 0051rewrite hselector_left_right
  52. 0052exists i
  53. 0053simp
  54. 0054cases hselector_right
  55. 0055cases hchoice
  56. 0056cases hchoice_left
  57. 0057exfalso
  58. 0058apply hselector_right_left
  59. 0059exact hchoice_left_left
  60. 0060cases hchoice_right
  61. 0061rewrite hchoice_right_right
  62. 0062rewrite hselector_right_right
  63. 0063specialize le_refl 1
  64. 0064exact le_refl