BT010V · Bertrand theorem

no_bertrand_small_contribution_choice_le_double

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

Every small-range contribution is bounded by the doubled row.

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. (∀ 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(i,s)Prime(S i) ∧ (∃ x. PowerValuation(S i,C,x)Pow(S i,x,a)) ∨ ¬Prime(S i) ∧ a = 1 → Le(a,n + n)

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

13 occurrences

In local proof propositions

8 occurrences

Exact expanded native-PA statement
forall n s q r C i a. (forall bpr_prime_candidate_b5nbscc_exclusion. ((exists bpr_gap_b5nbscc_exclusion_lower. bpr_gap_b5nbscc_exclusion_lower + S (n) = bpr_prime_candidate_b5nbscc_exclusion) /\ (exists bpr_le_gap_b5nbscc_exclusion_upper. bpr_le_gap_b5nbscc_exclusion_upper + (bpr_prime_candidate_b5nbscc_exclusion) = (n + n))) -> ~((~(bpr_prime_candidate_b5nbscc_exclusion = 1) /\ forall bpr_left_b5nbscc_exclusion_prime bpr_right_b5nbscc_exclusion_prime. bpr_prime_candidate_b5nbscc_exclusion = bpr_left_b5nbscc_exclusion_prime * bpr_right_b5nbscc_exclusion_prime -> bpr_left_b5nbscc_exclusion_prime = 1 \/ bpr_right_b5nbscc_exclusion_prime = 1))) -> (exists bcf_lt_gap_b5nbscc_positive. bcf_lt_gap_b5nbscc_positive + S (2) = n) -> (((exists bcs_sqrt_lower_gap_b5nbscc_floor. bcs_sqrt_lower_gap_b5nbscc_floor + (s) * (s) = (n + n)) /\ exists bcs_sqrt_upper_gap_b5nbscc_floor. bcs_sqrt_upper_gap_b5nbscc_floor + S (n + n) = S (s) * S (s))) -> (((n + n) = (3) * (q) + (r) /\ (exists bcf_lt_gap_b5nbscc_division_bound. bcf_lt_gap_b5nbscc_division_bound + S (r) = 3))) -> (((exists bcf_lt_gap_b5nbscc_central_out_of_range. bcf_lt_gap_b5nbscc_central_out_of_range + S (n + n) = n) /\ C = 0) \/ ((exists bcf_le_gap_b5nbscc_central_in_range. bcf_le_gap_b5nbscc_central_in_range + (n) = n + n) /\ (exists bcf_row_code_code_b5nbscc_central bcf_row_code_scale_b5nbscc_central bcf_row_scale_code_b5nbscc_central bcf_row_scale_scale_b5nbscc_central bcf_row_code_b5nbscc_central bcf_row_scale_b5nbscc_central. ((forall bcf_row_index_b5nbscc_central_table. (exists bcf_lt_gap_b5nbscc_central_table_row_bound. bcf_lt_gap_b5nbscc_central_table_row_bound + S (bcf_row_index_b5nbscc_central_table) = S (n + n)) -> exists bcf_row_code_b5nbscc_central_table bcf_row_scale_b5nbscc_central_table. ((((exists bcf_height_b5nbscc_central_table_decoded_row_code. bcf_height_b5nbscc_central_table_decoded_row_code + S (bcf_row_code_b5nbscc_central_table) = S ((S (bcf_row_index_b5nbscc_central_table)) * bcf_row_code_scale_b5nbscc_central)) /\ exists bcf_quotient_b5nbscc_central_table_decoded_row_code. bcf_row_code_code_b5nbscc_central = bcf_quotient_b5nbscc_central_table_decoded_row_code * S ((S (bcf_row_index_b5nbscc_central_table)) * bcf_row_code_scale_b5nbscc_central) + (bcf_row_code_b5nbscc_central_table))) /\ ((((exists bcf_height_b5nbscc_central_table_decoded_row_scale. bcf_height_b5nbscc_central_table_decoded_row_scale + S (bcf_row_scale_b5nbscc_central_table) = S ((S (bcf_row_index_b5nbscc_central_table)) * bcf_row_scale_scale_b5nbscc_central)) /\ exists bcf_quotient_b5nbscc_central_table_decoded_row_scale. bcf_row_scale_code_b5nbscc_central = bcf_quotient_b5nbscc_central_table_decoded_row_scale * S ((S (bcf_row_index_b5nbscc_central_table)) * bcf_row_scale_scale_b5nbscc_central) + (bcf_row_scale_b5nbscc_central_table))) /\ ((bcf_row_index_b5nbscc_central_table = 0 /\ (forall bcf_index_b5nbscc_central_table_zero_row. (exists bcf_lt_gap_b5nbscc_central_table_zero_row_bound. bcf_lt_gap_b5nbscc_central_table_zero_row_bound + S (bcf_index_b5nbscc_central_table_zero_row) = S (n + n)) -> exists bcf_value_b5nbscc_central_table_zero_row. ((((exists bcf_height_b5nbscc_central_table_zero_row_entry. bcf_height_b5nbscc_central_table_zero_row_entry + S (bcf_value_b5nbscc_central_table_zero_row) = S ((S (bcf_index_b5nbscc_central_table_zero_row)) * bcf_row_scale_b5nbscc_central_table)) /\ exists bcf_quotient_b5nbscc_central_table_zero_row_entry. bcf_row_code_b5nbscc_central_table = bcf_quotient_b5nbscc_central_table_zero_row_entry * S ((S (bcf_index_b5nbscc_central_table_zero_row)) * bcf_row_scale_b5nbscc_central_table) + (bcf_value_b5nbscc_central_table_zero_row))) /\ ((bcf_index_b5nbscc_central_table_zero_row = 0 /\ bcf_value_b5nbscc_central_table_zero_row = 1) \/ exists bcf_predecessor_b5nbscc_central_table_zero_row. bcf_index_b5nbscc_central_table_zero_row = S bcf_predecessor_b5nbscc_central_table_zero_row /\ bcf_value_b5nbscc_central_table_zero_row = 0)))) \/ exists bcf_predecessor_b5nbscc_central_table bcf_previous_code_b5nbscc_central_table bcf_previous_scale_b5nbscc_central_table. bcf_row_index_b5nbscc_central_table = S bcf_predecessor_b5nbscc_central_table /\ ((((exists bcf_height_b5nbscc_central_table_decoded_previous_code. bcf_height_b5nbscc_central_table_decoded_previous_code + S (bcf_previous_code_b5nbscc_central_table) = S ((S (bcf_predecessor_b5nbscc_central_table)) * bcf_row_code_scale_b5nbscc_central)) /\ exists bcf_quotient_b5nbscc_central_table_decoded_previous_code. bcf_row_code_code_b5nbscc_central = bcf_quotient_b5nbscc_central_table_decoded_previous_code * S ((S (bcf_predecessor_b5nbscc_central_table)) * bcf_row_code_scale_b5nbscc_central) + (bcf_previous_code_b5nbscc_central_table))) /\ ((((exists bcf_height_b5nbscc_central_table_decoded_previous_scale. bcf_height_b5nbscc_central_table_decoded_previous_scale + S (bcf_previous_scale_b5nbscc_central_table) = S ((S (bcf_predecessor_b5nbscc_central_table)) * bcf_row_scale_scale_b5nbscc_central)) /\ exists bcf_quotient_b5nbscc_central_table_decoded_previous_scale. bcf_row_scale_code_b5nbscc_central = bcf_quotient_b5nbscc_central_table_decoded_previous_scale * S ((S (bcf_predecessor_b5nbscc_central_table)) * bcf_row_scale_scale_b5nbscc_central) + (bcf_previous_scale_b5nbscc_central_table))) /\ (forall bcf_index_b5nbscc_central_table_row_step. (exists bcf_lt_gap_b5nbscc_central_table_row_step_bound. bcf_lt_gap_b5nbscc_central_table_row_step_bound + S (bcf_index_b5nbscc_central_table_row_step) = S (n + n)) -> exists bcf_value_b5nbscc_central_table_row_step. ((((exists bcf_height_b5nbscc_central_table_row_step_entry. bcf_height_b5nbscc_central_table_row_step_entry + S (bcf_value_b5nbscc_central_table_row_step) = S ((S (bcf_index_b5nbscc_central_table_row_step)) * bcf_row_scale_b5nbscc_central_table)) /\ exists bcf_quotient_b5nbscc_central_table_row_step_entry. bcf_row_code_b5nbscc_central_table = bcf_quotient_b5nbscc_central_table_row_step_entry * S ((S (bcf_index_b5nbscc_central_table_row_step)) * bcf_row_scale_b5nbscc_central_table) + (bcf_value_b5nbscc_central_table_row_step))) /\ ((bcf_index_b5nbscc_central_table_row_step = 0 /\ bcf_value_b5nbscc_central_table_row_step = 1) \/ exists bcf_predecessor_b5nbscc_central_table_row_step bcf_left_b5nbscc_central_table_row_step bcf_right_b5nbscc_central_table_row_step. bcf_index_b5nbscc_central_table_row_step = S bcf_predecessor_b5nbscc_central_table_row_step /\ ((((exists bcf_height_b5nbscc_central_table_row_step_previous_left. bcf_height_b5nbscc_central_table_row_step_previous_left + S (bcf_left_b5nbscc_central_table_row_step) = S ((S (bcf_predecessor_b5nbscc_central_table_row_step)) * bcf_previous_scale_b5nbscc_central_table)) /\ exists bcf_quotient_b5nbscc_central_table_row_step_previous_left. bcf_previous_code_b5nbscc_central_table = bcf_quotient_b5nbscc_central_table_row_step_previous_left * S ((S (bcf_predecessor_b5nbscc_central_table_row_step)) * bcf_previous_scale_b5nbscc_central_table) + (bcf_left_b5nbscc_central_table_row_step))) /\ ((((exists bcf_height_b5nbscc_central_table_row_step_previous_right. bcf_height_b5nbscc_central_table_row_step_previous_right + S (bcf_right_b5nbscc_central_table_row_step) = S ((S (S (bcf_predecessor_b5nbscc_central_table_row_step))) * bcf_previous_scale_b5nbscc_central_table)) /\ exists bcf_quotient_b5nbscc_central_table_row_step_previous_right. bcf_previous_code_b5nbscc_central_table = bcf_quotient_b5nbscc_central_table_row_step_previous_right * S ((S (S (bcf_predecessor_b5nbscc_central_table_row_step))) * bcf_previous_scale_b5nbscc_central_table) + (bcf_right_b5nbscc_central_table_row_step))) /\ bcf_value_b5nbscc_central_table_row_step = bcf_left_b5nbscc_central_table_row_step + bcf_right_b5nbscc_central_table_row_step))))))))))) /\ ((((exists bcf_height_b5nbscc_central_decoded_row_code. bcf_height_b5nbscc_central_decoded_row_code + S (bcf_row_code_b5nbscc_central) = S ((S (n + n)) * bcf_row_code_scale_b5nbscc_central)) /\ exists bcf_quotient_b5nbscc_central_decoded_row_code. bcf_row_code_code_b5nbscc_central = bcf_quotient_b5nbscc_central_decoded_row_code * S ((S (n + n)) * bcf_row_code_scale_b5nbscc_central) + (bcf_row_code_b5nbscc_central))) /\ ((((exists bcf_height_b5nbscc_central_decoded_row_scale. bcf_height_b5nbscc_central_decoded_row_scale + S (bcf_row_scale_b5nbscc_central) = S ((S (n + n)) * bcf_row_scale_scale_b5nbscc_central)) /\ exists bcf_quotient_b5nbscc_central_decoded_row_scale. bcf_row_scale_code_b5nbscc_central = bcf_quotient_b5nbscc_central_decoded_row_scale * S ((S (n + n)) * bcf_row_scale_scale_b5nbscc_central) + (bcf_row_scale_b5nbscc_central))) /\ (((exists bcf_height_b5nbscc_central_decoded_value. bcf_height_b5nbscc_central_decoded_value + S (C) = S ((S (n)) * bcf_row_scale_b5nbscc_central)) /\ exists bcf_quotient_b5nbscc_central_decoded_value. bcf_row_code_b5nbscc_central = bcf_quotient_b5nbscc_central_decoded_value * S ((S (n)) * bcf_row_scale_b5nbscc_central) + (C))))))))) -> (exists bcf_lt_gap_b5nbscc_index. bcf_lt_gap_b5nbscc_index + S (i) = s) -> (((((~(S (i) = 1) /\ forall bpr_left_b5nbscc_choice_prime bpr_right_b5nbscc_choice_prime. S (i) = bpr_left_b5nbscc_choice_prime * bpr_right_b5nbscc_choice_prime -> bpr_left_b5nbscc_choice_prime = 1 \/ bpr_right_b5nbscc_choice_prime = 1)) /\ exists bpr_choice_exponent_b5nbscc_choice. ((((exists bpr_le_gap_b5nbscc_choice_valuation_selected_bound. bpr_le_gap_b5nbscc_choice_valuation_selected_bound + (bpr_choice_exponent_b5nbscc_choice) = (C)) /\ (exists bpr_power_value_b5nbscc_choice_valuation_selected. ((exists bpr_power_code_b5nbscc_choice_valuation_selected_power bpr_power_scale_b5nbscc_choice_valuation_selected_power. ((forall bpr_power_index_b5nbscc_choice_valuation_selected_power. (exists bpr_gap_b5nbscc_choice_valuation_selected_power_repeat_bound. bpr_gap_b5nbscc_choice_valuation_selected_power_repeat_bound + S (bpr_power_index_b5nbscc_choice_valuation_selected_power) = bpr_choice_exponent_b5nbscc_choice) -> (((exists bpr_height_b5nbscc_choice_valuation_selected_power_repeat_entry. bpr_height_b5nbscc_choice_valuation_selected_power_repeat_entry + S (S (i)) = S ((S (bpr_power_index_b5nbscc_choice_valuation_selected_power)) * bpr_power_scale_b5nbscc_choice_valuation_selected_power)) /\ exists bpr_quotient_b5nbscc_choice_valuation_selected_power_repeat_entry. bpr_power_code_b5nbscc_choice_valuation_selected_power = bpr_quotient_b5nbscc_choice_valuation_selected_power_repeat_entry * S ((S (bpr_power_index_b5nbscc_choice_valuation_selected_power)) * bpr_power_scale_b5nbscc_choice_valuation_selected_power) + (S (i))))) /\ (exists ff_u_b5nbscc_choice_valuation_selected_power_product ff_v_b5nbscc_choice_valuation_selected_power_product. ((((exists ff_h_b5nbscc_choice_valuation_selected_power_product_start. ff_h_b5nbscc_choice_valuation_selected_power_product_start + S (1) = S ((S (0)) * ff_v_b5nbscc_choice_valuation_selected_power_product)) /\ exists ff_q_b5nbscc_choice_valuation_selected_power_product_start. ff_u_b5nbscc_choice_valuation_selected_power_product = ff_q_b5nbscc_choice_valuation_selected_power_product_start * S ((S (0)) * ff_v_b5nbscc_choice_valuation_selected_power_product) + (1))) /\ ((((exists ff_h_b5nbscc_choice_valuation_selected_power_product_terminal. ff_h_b5nbscc_choice_valuation_selected_power_product_terminal + S (bpr_power_value_b5nbscc_choice_valuation_selected) = S ((S (bpr_choice_exponent_b5nbscc_choice)) * ff_v_b5nbscc_choice_valuation_selected_power_product)) /\ exists ff_q_b5nbscc_choice_valuation_selected_power_product_terminal. ff_u_b5nbscc_choice_valuation_selected_power_product = ff_q_b5nbscc_choice_valuation_selected_power_product_terminal * S ((S (bpr_choice_exponent_b5nbscc_choice)) * ff_v_b5nbscc_choice_valuation_selected_power_product) + (bpr_power_value_b5nbscc_choice_valuation_selected))) /\ forall ff_i_b5nbscc_choice_valuation_selected_power_product. (exists ff_lt_b5nbscc_choice_valuation_selected_power_product_bound. ff_lt_b5nbscc_choice_valuation_selected_power_product_bound + S ff_i_b5nbscc_choice_valuation_selected_power_product = bpr_choice_exponent_b5nbscc_choice) -> exists ff_p_b5nbscc_choice_valuation_selected_power_product ff_r_b5nbscc_choice_valuation_selected_power_product ff_s_b5nbscc_choice_valuation_selected_power_product. ((((exists ff_h_b5nbscc_choice_valuation_selected_power_product_factor. ff_h_b5nbscc_choice_valuation_selected_power_product_factor + S (ff_p_b5nbscc_choice_valuation_selected_power_product) = S ((S (ff_i_b5nbscc_choice_valuation_selected_power_product)) * bpr_power_scale_b5nbscc_choice_valuation_selected_power)) /\ exists ff_q_b5nbscc_choice_valuation_selected_power_product_factor. bpr_power_code_b5nbscc_choice_valuation_selected_power = ff_q_b5nbscc_choice_valuation_selected_power_product_factor * S ((S (ff_i_b5nbscc_choice_valuation_selected_power_product)) * bpr_power_scale_b5nbscc_choice_valuation_selected_power) + (ff_p_b5nbscc_choice_valuation_selected_power_product))) /\ ((((exists ff_h_b5nbscc_choice_valuation_selected_power_product_partial. ff_h_b5nbscc_choice_valuation_selected_power_product_partial + S (ff_r_b5nbscc_choice_valuation_selected_power_product) = S ((S (ff_i_b5nbscc_choice_valuation_selected_power_product)) * ff_v_b5nbscc_choice_valuation_selected_power_product)) /\ exists ff_q_b5nbscc_choice_valuation_selected_power_product_partial. ff_u_b5nbscc_choice_valuation_selected_power_product = ff_q_b5nbscc_choice_valuation_selected_power_product_partial * S ((S (ff_i_b5nbscc_choice_valuation_selected_power_product)) * ff_v_b5nbscc_choice_valuation_selected_power_product) + (ff_r_b5nbscc_choice_valuation_selected_power_product))) /\ ((((exists ff_h_b5nbscc_choice_valuation_selected_power_product_successor. ff_h_b5nbscc_choice_valuation_selected_power_product_successor + S (ff_s_b5nbscc_choice_valuation_selected_power_product) = S ((S (S ff_i_b5nbscc_choice_valuation_selected_power_product)) * ff_v_b5nbscc_choice_valuation_selected_power_product)) /\ exists ff_q_b5nbscc_choice_valuation_selected_power_product_successor. ff_u_b5nbscc_choice_valuation_selected_power_product = ff_q_b5nbscc_choice_valuation_selected_power_product_successor * S ((S (S ff_i_b5nbscc_choice_valuation_selected_power_product)) * ff_v_b5nbscc_choice_valuation_selected_power_product) + (ff_s_b5nbscc_choice_valuation_selected_power_product))) /\ ff_s_b5nbscc_choice_valuation_selected_power_product = ff_r_b5nbscc_choice_valuation_selected_power_product * ff_p_b5nbscc_choice_valuation_selected_power_product)))))))) /\ (exists bpr_divides_quotient_b5nbscc_choice_valuation_selected_divides. C = (bpr_power_value_b5nbscc_choice_valuation_selected) * bpr_divides_quotient_b5nbscc_choice_valuation_selected_divides)))) /\ forall bpr_valuation_candidate_b5nbscc_choice_valuation. (exists bpr_le_gap_b5nbscc_choice_valuation_candidate_bound. bpr_le_gap_b5nbscc_choice_valuation_candidate_bound + (bpr_valuation_candidate_b5nbscc_choice_valuation) = (C)) -> (exists bpr_power_value_b5nbscc_choice_valuation_candidate. ((exists bpr_power_code_b5nbscc_choice_valuation_candidate_power bpr_power_scale_b5nbscc_choice_valuation_candidate_power. ((forall bpr_power_index_b5nbscc_choice_valuation_candidate_power. (exists bpr_gap_b5nbscc_choice_valuation_candidate_power_repeat_bound. bpr_gap_b5nbscc_choice_valuation_candidate_power_repeat_bound + S (bpr_power_index_b5nbscc_choice_valuation_candidate_power) = bpr_valuation_candidate_b5nbscc_choice_valuation) -> (((exists bpr_height_b5nbscc_choice_valuation_candidate_power_repeat_entry. bpr_height_b5nbscc_choice_valuation_candidate_power_repeat_entry + S (S (i)) = S ((S (bpr_power_index_b5nbscc_choice_valuation_candidate_power)) * bpr_power_scale_b5nbscc_choice_valuation_candidate_power)) /\ exists bpr_quotient_b5nbscc_choice_valuation_candidate_power_repeat_entry. bpr_power_code_b5nbscc_choice_valuation_candidate_power = bpr_quotient_b5nbscc_choice_valuation_candidate_power_repeat_entry * S ((S (bpr_power_index_b5nbscc_choice_valuation_candidate_power)) * bpr_power_scale_b5nbscc_choice_valuation_candidate_power) + (S (i))))) /\ (exists ff_u_b5nbscc_choice_valuation_candidate_power_product ff_v_b5nbscc_choice_valuation_candidate_power_product. ((((exists ff_h_b5nbscc_choice_valuation_candidate_power_product_start. ff_h_b5nbscc_choice_valuation_candidate_power_product_start + S (1) = S ((S (0)) * ff_v_b5nbscc_choice_valuation_candidate_power_product)) /\ exists ff_q_b5nbscc_choice_valuation_candidate_power_product_start. ff_u_b5nbscc_choice_valuation_candidate_power_product = ff_q_b5nbscc_choice_valuation_candidate_power_product_start * S ((S (0)) * ff_v_b5nbscc_choice_valuation_candidate_power_product) + (1))) /\ ((((exists ff_h_b5nbscc_choice_valuation_candidate_power_product_terminal. ff_h_b5nbscc_choice_valuation_candidate_power_product_terminal + S (bpr_power_value_b5nbscc_choice_valuation_candidate) = S ((S (bpr_valuation_candidate_b5nbscc_choice_valuation)) * ff_v_b5nbscc_choice_valuation_candidate_power_product)) /\ exists ff_q_b5nbscc_choice_valuation_candidate_power_product_terminal. ff_u_b5nbscc_choice_valuation_candidate_power_product = ff_q_b5nbscc_choice_valuation_candidate_power_product_terminal * S ((S (bpr_valuation_candidate_b5nbscc_choice_valuation)) * ff_v_b5nbscc_choice_valuation_candidate_power_product) + (bpr_power_value_b5nbscc_choice_valuation_candidate))) /\ forall ff_i_b5nbscc_choice_valuation_candidate_power_product. (exists ff_lt_b5nbscc_choice_valuation_candidate_power_product_bound. ff_lt_b5nbscc_choice_valuation_candidate_power_product_bound + S ff_i_b5nbscc_choice_valuation_candidate_power_product = bpr_valuation_candidate_b5nbscc_choice_valuation) -> exists ff_p_b5nbscc_choice_valuation_candidate_power_product ff_r_b5nbscc_choice_valuation_candidate_power_product ff_s_b5nbscc_choice_valuation_candidate_power_product. ((((exists ff_h_b5nbscc_choice_valuation_candidate_power_product_factor. ff_h_b5nbscc_choice_valuation_candidate_power_product_factor + S (ff_p_b5nbscc_choice_valuation_candidate_power_product) = S ((S (ff_i_b5nbscc_choice_valuation_candidate_power_product)) * bpr_power_scale_b5nbscc_choice_valuation_candidate_power)) /\ exists ff_q_b5nbscc_choice_valuation_candidate_power_product_factor. bpr_power_code_b5nbscc_choice_valuation_candidate_power = ff_q_b5nbscc_choice_valuation_candidate_power_product_factor * S ((S (ff_i_b5nbscc_choice_valuation_candidate_power_product)) * bpr_power_scale_b5nbscc_choice_valuation_candidate_power) + (ff_p_b5nbscc_choice_valuation_candidate_power_product))) /\ ((((exists ff_h_b5nbscc_choice_valuation_candidate_power_product_partial. ff_h_b5nbscc_choice_valuation_candidate_power_product_partial + S (ff_r_b5nbscc_choice_valuation_candidate_power_product) = S ((S (ff_i_b5nbscc_choice_valuation_candidate_power_product)) * ff_v_b5nbscc_choice_valuation_candidate_power_product)) /\ exists ff_q_b5nbscc_choice_valuation_candidate_power_product_partial. ff_u_b5nbscc_choice_valuation_candidate_power_product = ff_q_b5nbscc_choice_valuation_candidate_power_product_partial * S ((S (ff_i_b5nbscc_choice_valuation_candidate_power_product)) * ff_v_b5nbscc_choice_valuation_candidate_power_product) + (ff_r_b5nbscc_choice_valuation_candidate_power_product))) /\ ((((exists ff_h_b5nbscc_choice_valuation_candidate_power_product_successor. ff_h_b5nbscc_choice_valuation_candidate_power_product_successor + S (ff_s_b5nbscc_choice_valuation_candidate_power_product) = S ((S (S ff_i_b5nbscc_choice_valuation_candidate_power_product)) * ff_v_b5nbscc_choice_valuation_candidate_power_product)) /\ exists ff_q_b5nbscc_choice_valuation_candidate_power_product_successor. ff_u_b5nbscc_choice_valuation_candidate_power_product = ff_q_b5nbscc_choice_valuation_candidate_power_product_successor * S ((S (S ff_i_b5nbscc_choice_valuation_candidate_power_product)) * ff_v_b5nbscc_choice_valuation_candidate_power_product) + (ff_s_b5nbscc_choice_valuation_candidate_power_product))) /\ ff_s_b5nbscc_choice_valuation_candidate_power_product = ff_r_b5nbscc_choice_valuation_candidate_power_product * ff_p_b5nbscc_choice_valuation_candidate_power_product)))))))) /\ (exists bpr_divides_quotient_b5nbscc_choice_valuation_candidate_divides. C = (bpr_power_value_b5nbscc_choice_valuation_candidate) * bpr_divides_quotient_b5nbscc_choice_valuation_candidate_divides))) -> (exists bpr_le_gap_b5nbscc_choice_valuation_candidate_below. bpr_le_gap_b5nbscc_choice_valuation_candidate_below + (bpr_valuation_candidate_b5nbscc_choice_valuation) = (bpr_choice_exponent_b5nbscc_choice))) /\ (exists bpr_power_code_b5nbscc_choice_power bpr_power_scale_b5nbscc_choice_power. ((forall bpr_power_index_b5nbscc_choice_power. (exists bpr_gap_b5nbscc_choice_power_repeat_bound. bpr_gap_b5nbscc_choice_power_repeat_bound + S (bpr_power_index_b5nbscc_choice_power) = bpr_choice_exponent_b5nbscc_choice) -> (((exists bpr_height_b5nbscc_choice_power_repeat_entry. bpr_height_b5nbscc_choice_power_repeat_entry + S (S (i)) = S ((S (bpr_power_index_b5nbscc_choice_power)) * bpr_power_scale_b5nbscc_choice_power)) /\ exists bpr_quotient_b5nbscc_choice_power_repeat_entry. bpr_power_code_b5nbscc_choice_power = bpr_quotient_b5nbscc_choice_power_repeat_entry * S ((S (bpr_power_index_b5nbscc_choice_power)) * bpr_power_scale_b5nbscc_choice_power) + (S (i))))) /\ (exists ff_u_b5nbscc_choice_power_product ff_v_b5nbscc_choice_power_product. ((((exists ff_h_b5nbscc_choice_power_product_start. ff_h_b5nbscc_choice_power_product_start + S (1) = S ((S (0)) * ff_v_b5nbscc_choice_power_product)) /\ exists ff_q_b5nbscc_choice_power_product_start. ff_u_b5nbscc_choice_power_product = ff_q_b5nbscc_choice_power_product_start * S ((S (0)) * ff_v_b5nbscc_choice_power_product) + (1))) /\ ((((exists ff_h_b5nbscc_choice_power_product_terminal. ff_h_b5nbscc_choice_power_product_terminal + S (a) = S ((S (bpr_choice_exponent_b5nbscc_choice)) * ff_v_b5nbscc_choice_power_product)) /\ exists ff_q_b5nbscc_choice_power_product_terminal. ff_u_b5nbscc_choice_power_product = ff_q_b5nbscc_choice_power_product_terminal * S ((S (bpr_choice_exponent_b5nbscc_choice)) * ff_v_b5nbscc_choice_power_product) + (a))) /\ forall ff_i_b5nbscc_choice_power_product. (exists ff_lt_b5nbscc_choice_power_product_bound. ff_lt_b5nbscc_choice_power_product_bound + S ff_i_b5nbscc_choice_power_product = bpr_choice_exponent_b5nbscc_choice) -> exists ff_p_b5nbscc_choice_power_product ff_r_b5nbscc_choice_power_product ff_s_b5nbscc_choice_power_product. ((((exists ff_h_b5nbscc_choice_power_product_factor. ff_h_b5nbscc_choice_power_product_factor + S (ff_p_b5nbscc_choice_power_product) = S ((S (ff_i_b5nbscc_choice_power_product)) * bpr_power_scale_b5nbscc_choice_power)) /\ exists ff_q_b5nbscc_choice_power_product_factor. bpr_power_code_b5nbscc_choice_power = ff_q_b5nbscc_choice_power_product_factor * S ((S (ff_i_b5nbscc_choice_power_product)) * bpr_power_scale_b5nbscc_choice_power) + (ff_p_b5nbscc_choice_power_product))) /\ ((((exists ff_h_b5nbscc_choice_power_product_partial. ff_h_b5nbscc_choice_power_product_partial + S (ff_r_b5nbscc_choice_power_product) = S ((S (ff_i_b5nbscc_choice_power_product)) * ff_v_b5nbscc_choice_power_product)) /\ exists ff_q_b5nbscc_choice_power_product_partial. ff_u_b5nbscc_choice_power_product = ff_q_b5nbscc_choice_power_product_partial * S ((S (ff_i_b5nbscc_choice_power_product)) * ff_v_b5nbscc_choice_power_product) + (ff_r_b5nbscc_choice_power_product))) /\ ((((exists ff_h_b5nbscc_choice_power_product_successor. ff_h_b5nbscc_choice_power_product_successor + S (ff_s_b5nbscc_choice_power_product) = S ((S (S ff_i_b5nbscc_choice_power_product)) * ff_v_b5nbscc_choice_power_product)) /\ exists ff_q_b5nbscc_choice_power_product_successor. ff_u_b5nbscc_choice_power_product = ff_q_b5nbscc_choice_power_product_successor * S ((S (S ff_i_b5nbscc_choice_power_product)) * ff_v_b5nbscc_choice_power_product) + (ff_s_b5nbscc_choice_power_product))) /\ ff_s_b5nbscc_choice_power_product = ff_r_b5nbscc_choice_power_product * ff_p_b5nbscc_choice_power_product)))))))))) \/ (~((~(S (i) = 1) /\ forall bpr_left_b5nbscc_choice_prime bpr_right_b5nbscc_choice_prime. S (i) = bpr_left_b5nbscc_choice_prime * bpr_right_b5nbscc_choice_prime -> bpr_left_b5nbscc_choice_prime = 1 \/ bpr_right_b5nbscc_choice_prime = 1)) /\ a = 1))) -> (exists bcf_le_gap_b5nbscc_result. bcf_le_gap_b5nbscc_result + (a) = n + n)

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

67 script commands · 15 reading checkpoints · 5 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 (5)
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 hexclusion
  9. L9
    intro hpositive
  10. L10
    intro hfloor
02Fix variables and assumptionsL11–14

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

  1. L11
    intro hdivision
  2. L12
    intro hcentral
  3. L13
    intro hindex
  4. L14
    intro hchoice
03Establish hrangesL15–24

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. L15
    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. L16
    specialize no_bertrand_central_contribution_choice_ranges n
  3. L17
    specialize no_bertrand_central_contribution_choice_ranges s
  4. L18
    specialize no_bertrand_central_contribution_choice_ranges q
  5. L19
    specialize no_bertrand_central_contribution_choice_ranges r
  6. L20
    specialize no_bertrand_central_contribution_choice_ranges C
  7. L21
    specialize no_bertrand_central_contribution_choice_ranges i
  8. L22
    specialize no_bertrand_central_contribution_choice_ranges a
  9. L23
    apply no_bertrand_central_contribution_choice_ranges
  10. L24
    exact hexclusion
04Use earlier factsL25–29

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

  1. L25
    exact hpositive
  2. L26
    exact hfloor
  3. L27
    exact hdivision
  4. L28
    exact hcentral
  5. L29
    exact hchoice
05Separate the logical casesL30–32

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

  1. L30
    cases hranges
  2. L31
    cases hranges_left
  3. L32
    cases hranges_left_left
06Use earlier factsL33–33

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

  1. L33
    exact hranges_left_left_right
07Separate the logical casesL34–36

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

  1. L34
    cases hranges_left_right
  2. L35
    cases hranges_left_right_left
  3. L36
    exfalso
08Use earlier factsL37–41

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

  1. L37
    specialize lt_not_le s
  2. L38
    specialize lt_not_le (S i)
  3. L39
    apply lt_not_le
  4. L40
    exact hranges_left_right_left_left
  5. L41
    exact hindex
09Calculate and transport equalitiesL42–42

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

  1. L42
    rewrite hranges_right
10Establish hone_twoL43–43

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

  1. L43
    have hone_two : Lt(0,2)Definitions: Lt(0,2)Original native command in the exact edition
11Construct an explicit witnessL44–44

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

  1. L44
    exists 1
12Calculate and transport equalitiesL45–45

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

  1. L45
    norm_num
13Establish htwo_nL46–50

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

  1. L46
    have htwo_n : Lt(1,n)Definitions: Lt(1,n)Original native command in the exact edition
  2. L47
    specialize lt_to_le 2
  3. L48
    specialize lt_to_le n
  4. L49
    apply lt_to_le
  5. L50
    exact hpositive
14Establish hone_nL51–57

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

  1. L51
    have hone_n : Lt(0,n)Definitions: Lt(0,n)Original native command in the exact edition
  2. L52
    specialize le_trans 1
  3. L53
    specialize le_trans 2
  4. L54
    specialize le_trans n
  5. L55
    apply le_trans
  6. L56
    exact hone_two
  7. L57
    exact htwo_n
15Establish hn_doubleL58–67

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

  1. L58
    have hn_double : Le(n,n + n)Definitions: Le(n,n + n)Original native command in the exact edition
  2. L59
    specialize le_add_right n
  3. L60
    specialize le_add_right n
  4. L61
    exact le_add_right
  5. L62
    specialize le_trans 1
  6. L63
    specialize le_trans n
  7. L64
    specialize le_trans (n + n)
  8. L65
    apply le_trans
  9. L66
    exact hone_n
  10. L67
    exact hn_double

Library-wide reading audit

Original defined command ledger · 67 lines
  1. 0001intro n
  2. 0002intro s
  3. 0003intro q
  4. 0004intro r
  5. 0005intro C
  6. 0006intro i
  7. 0007intro a
  8. 0008intro hexclusion
  9. 0009intro hpositive
  10. 0010intro hfloor
  11. 0011intro hdivision
  12. 0012intro hcentral
  13. 0013intro hindex
  14. 0014intro hchoice
  15. 0015have 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_b5nbscc_si_s. bcf_le_gap_b5nbscc_si_s + (S i) = s) /\ (exists bcf_le_gap_b5nbscc_result. bcf_le_gap_b5nbscc_result + (a) = n + n)) \/ (((exists bcf_lt_gap_b5nbscc_range_above. bcf_lt_gap_b5nbscc_range_above + S (s) = S i) /\ (exists bcf_le_gap_b5nbscc_range_middle. bcf_le_gap_b5nbscc_range_middle + (S i) = q)) /\ a = S i) \/ a = 1
  16. 0016specialize no_bertrand_central_contribution_choice_ranges n
  17. 0017specialize no_bertrand_central_contribution_choice_ranges s
  18. 0018specialize no_bertrand_central_contribution_choice_ranges q
  19. 0019specialize no_bertrand_central_contribution_choice_ranges r
  20. 0020specialize no_bertrand_central_contribution_choice_ranges C
  21. 0021specialize no_bertrand_central_contribution_choice_ranges i
  22. 0022specialize no_bertrand_central_contribution_choice_ranges a
  23. 0023apply no_bertrand_central_contribution_choice_ranges
  24. 0024exact hexclusion
  25. 0025exact hpositive
  26. 0026exact hfloor
  27. 0027exact hdivision
  28. 0028exact hcentral
  29. 0029exact hchoice
  30. 0030cases hranges
  31. 0031cases hranges_left
  32. 0032cases hranges_left_left
  33. 0033exact hranges_left_left_right
  34. 0034cases hranges_left_right
  35. 0035cases hranges_left_right_left
  36. 0036exfalso
  37. 0037specialize lt_not_le s
  38. 0038specialize lt_not_le (S i)
  39. 0039apply lt_not_le
  40. 0040exact hranges_left_right_left_left
  41. 0041exact hindex
  42. 0042rewrite hranges_right
  43. 0043have hone_two : Lt(0,2)
    Exact native replay linehave hone_two : exists bcf_le_gap_b5nbscc_one_two. bcf_le_gap_b5nbscc_one_two + (1) = 2
  44. 0044exists 1
  45. 0045norm_num
  46. 0046have htwo_n : Lt(1,n)
    Exact native replay linehave htwo_n : exists bcf_le_gap_b5nbscc_two_n. bcf_le_gap_b5nbscc_two_n + (2) = n
  47. 0047specialize lt_to_le 2
  48. 0048specialize lt_to_le n
  49. 0049apply lt_to_le
  50. 0050exact hpositive
  51. 0051have hone_n : Lt(0,n)
    Exact native replay linehave hone_n : exists bcf_le_gap_b5nbscc_one_n. bcf_le_gap_b5nbscc_one_n + (1) = n
  52. 0052specialize le_trans 1
  53. 0053specialize le_trans 2
  54. 0054specialize le_trans n
  55. 0055apply le_trans
  56. 0056exact hone_two
  57. 0057exact htwo_n
  58. 0058have hn_double : Le(n,n + n)
    Exact native replay linehave hn_double : exists bcf_le_gap_b5nbscc_n_double. bcf_le_gap_b5nbscc_n_double + (n) = n + n
  59. 0059specialize le_add_right n
  60. 0060specialize le_add_right n
  61. 0061exact le_add_right
  62. 0062specialize le_trans 1
  63. 0063specialize le_trans n
  64. 0064specialize le_trans (n + n)
  65. 0065apply le_trans
  66. 0066exact hone_n
  67. 0067exact hn_double