BT010X · Bertrand theorem

no_bertrand_high_contribution_choice_eq_one

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

Every contribution above the third quotient is neutral.

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

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

12 occurrences

In local proof propositions

6 occurrences

Exact expanded native-PA statement
forall n s q r C i a. (forall bpr_prime_candidate_b5nbhcc_exclusion. ((exists bpr_gap_b5nbhcc_exclusion_lower. bpr_gap_b5nbhcc_exclusion_lower + S (n) = bpr_prime_candidate_b5nbhcc_exclusion) /\ (exists bpr_le_gap_b5nbhcc_exclusion_upper. bpr_le_gap_b5nbhcc_exclusion_upper + (bpr_prime_candidate_b5nbhcc_exclusion) = (n + n))) -> ~((~(bpr_prime_candidate_b5nbhcc_exclusion = 1) /\ forall bpr_left_b5nbhcc_exclusion_prime bpr_right_b5nbhcc_exclusion_prime. bpr_prime_candidate_b5nbhcc_exclusion = bpr_left_b5nbhcc_exclusion_prime * bpr_right_b5nbhcc_exclusion_prime -> bpr_left_b5nbhcc_exclusion_prime = 1 \/ bpr_right_b5nbhcc_exclusion_prime = 1))) -> (exists bcf_lt_gap_b5nbhcc_positive. bcf_lt_gap_b5nbhcc_positive + S (2) = n) -> (((exists bcs_sqrt_lower_gap_b5nbhcc_floor. bcs_sqrt_lower_gap_b5nbhcc_floor + (s) * (s) = (n + n)) /\ exists bcs_sqrt_upper_gap_b5nbhcc_floor. bcs_sqrt_upper_gap_b5nbhcc_floor + S (n + n) = S (s) * S (s))) -> (((n + n) = (3) * (q) + (r) /\ (exists bcf_lt_gap_b5nbhcc_division_bound. bcf_lt_gap_b5nbhcc_division_bound + S (r) = 3))) -> (((exists bcf_lt_gap_b5nbhcc_central_out_of_range. bcf_lt_gap_b5nbhcc_central_out_of_range + S (n + n) = n) /\ C = 0) \/ ((exists bcf_le_gap_b5nbhcc_central_in_range. bcf_le_gap_b5nbhcc_central_in_range + (n) = n + n) /\ (exists bcf_row_code_code_b5nbhcc_central bcf_row_code_scale_b5nbhcc_central bcf_row_scale_code_b5nbhcc_central bcf_row_scale_scale_b5nbhcc_central bcf_row_code_b5nbhcc_central bcf_row_scale_b5nbhcc_central. ((forall bcf_row_index_b5nbhcc_central_table. (exists bcf_lt_gap_b5nbhcc_central_table_row_bound. bcf_lt_gap_b5nbhcc_central_table_row_bound + S (bcf_row_index_b5nbhcc_central_table) = S (n + n)) -> exists bcf_row_code_b5nbhcc_central_table bcf_row_scale_b5nbhcc_central_table. ((((exists bcf_height_b5nbhcc_central_table_decoded_row_code. bcf_height_b5nbhcc_central_table_decoded_row_code + S (bcf_row_code_b5nbhcc_central_table) = S ((S (bcf_row_index_b5nbhcc_central_table)) * bcf_row_code_scale_b5nbhcc_central)) /\ exists bcf_quotient_b5nbhcc_central_table_decoded_row_code. bcf_row_code_code_b5nbhcc_central = bcf_quotient_b5nbhcc_central_table_decoded_row_code * S ((S (bcf_row_index_b5nbhcc_central_table)) * bcf_row_code_scale_b5nbhcc_central) + (bcf_row_code_b5nbhcc_central_table))) /\ ((((exists bcf_height_b5nbhcc_central_table_decoded_row_scale. bcf_height_b5nbhcc_central_table_decoded_row_scale + S (bcf_row_scale_b5nbhcc_central_table) = S ((S (bcf_row_index_b5nbhcc_central_table)) * bcf_row_scale_scale_b5nbhcc_central)) /\ exists bcf_quotient_b5nbhcc_central_table_decoded_row_scale. bcf_row_scale_code_b5nbhcc_central = bcf_quotient_b5nbhcc_central_table_decoded_row_scale * S ((S (bcf_row_index_b5nbhcc_central_table)) * bcf_row_scale_scale_b5nbhcc_central) + (bcf_row_scale_b5nbhcc_central_table))) /\ ((bcf_row_index_b5nbhcc_central_table = 0 /\ (forall bcf_index_b5nbhcc_central_table_zero_row. (exists bcf_lt_gap_b5nbhcc_central_table_zero_row_bound. bcf_lt_gap_b5nbhcc_central_table_zero_row_bound + S (bcf_index_b5nbhcc_central_table_zero_row) = S (n + n)) -> exists bcf_value_b5nbhcc_central_table_zero_row. ((((exists bcf_height_b5nbhcc_central_table_zero_row_entry. bcf_height_b5nbhcc_central_table_zero_row_entry + S (bcf_value_b5nbhcc_central_table_zero_row) = S ((S (bcf_index_b5nbhcc_central_table_zero_row)) * bcf_row_scale_b5nbhcc_central_table)) /\ exists bcf_quotient_b5nbhcc_central_table_zero_row_entry. bcf_row_code_b5nbhcc_central_table = bcf_quotient_b5nbhcc_central_table_zero_row_entry * S ((S (bcf_index_b5nbhcc_central_table_zero_row)) * bcf_row_scale_b5nbhcc_central_table) + (bcf_value_b5nbhcc_central_table_zero_row))) /\ ((bcf_index_b5nbhcc_central_table_zero_row = 0 /\ bcf_value_b5nbhcc_central_table_zero_row = 1) \/ exists bcf_predecessor_b5nbhcc_central_table_zero_row. bcf_index_b5nbhcc_central_table_zero_row = S bcf_predecessor_b5nbhcc_central_table_zero_row /\ bcf_value_b5nbhcc_central_table_zero_row = 0)))) \/ exists bcf_predecessor_b5nbhcc_central_table bcf_previous_code_b5nbhcc_central_table bcf_previous_scale_b5nbhcc_central_table. bcf_row_index_b5nbhcc_central_table = S bcf_predecessor_b5nbhcc_central_table /\ ((((exists bcf_height_b5nbhcc_central_table_decoded_previous_code. bcf_height_b5nbhcc_central_table_decoded_previous_code + S (bcf_previous_code_b5nbhcc_central_table) = S ((S (bcf_predecessor_b5nbhcc_central_table)) * bcf_row_code_scale_b5nbhcc_central)) /\ exists bcf_quotient_b5nbhcc_central_table_decoded_previous_code. bcf_row_code_code_b5nbhcc_central = bcf_quotient_b5nbhcc_central_table_decoded_previous_code * S ((S (bcf_predecessor_b5nbhcc_central_table)) * bcf_row_code_scale_b5nbhcc_central) + (bcf_previous_code_b5nbhcc_central_table))) /\ ((((exists bcf_height_b5nbhcc_central_table_decoded_previous_scale. bcf_height_b5nbhcc_central_table_decoded_previous_scale + S (bcf_previous_scale_b5nbhcc_central_table) = S ((S (bcf_predecessor_b5nbhcc_central_table)) * bcf_row_scale_scale_b5nbhcc_central)) /\ exists bcf_quotient_b5nbhcc_central_table_decoded_previous_scale. bcf_row_scale_code_b5nbhcc_central = bcf_quotient_b5nbhcc_central_table_decoded_previous_scale * S ((S (bcf_predecessor_b5nbhcc_central_table)) * bcf_row_scale_scale_b5nbhcc_central) + (bcf_previous_scale_b5nbhcc_central_table))) /\ (forall bcf_index_b5nbhcc_central_table_row_step. (exists bcf_lt_gap_b5nbhcc_central_table_row_step_bound. bcf_lt_gap_b5nbhcc_central_table_row_step_bound + S (bcf_index_b5nbhcc_central_table_row_step) = S (n + n)) -> exists bcf_value_b5nbhcc_central_table_row_step. ((((exists bcf_height_b5nbhcc_central_table_row_step_entry. bcf_height_b5nbhcc_central_table_row_step_entry + S (bcf_value_b5nbhcc_central_table_row_step) = S ((S (bcf_index_b5nbhcc_central_table_row_step)) * bcf_row_scale_b5nbhcc_central_table)) /\ exists bcf_quotient_b5nbhcc_central_table_row_step_entry. bcf_row_code_b5nbhcc_central_table = bcf_quotient_b5nbhcc_central_table_row_step_entry * S ((S (bcf_index_b5nbhcc_central_table_row_step)) * bcf_row_scale_b5nbhcc_central_table) + (bcf_value_b5nbhcc_central_table_row_step))) /\ ((bcf_index_b5nbhcc_central_table_row_step = 0 /\ bcf_value_b5nbhcc_central_table_row_step = 1) \/ exists bcf_predecessor_b5nbhcc_central_table_row_step bcf_left_b5nbhcc_central_table_row_step bcf_right_b5nbhcc_central_table_row_step. bcf_index_b5nbhcc_central_table_row_step = S bcf_predecessor_b5nbhcc_central_table_row_step /\ ((((exists bcf_height_b5nbhcc_central_table_row_step_previous_left. bcf_height_b5nbhcc_central_table_row_step_previous_left + S (bcf_left_b5nbhcc_central_table_row_step) = S ((S (bcf_predecessor_b5nbhcc_central_table_row_step)) * bcf_previous_scale_b5nbhcc_central_table)) /\ exists bcf_quotient_b5nbhcc_central_table_row_step_previous_left. bcf_previous_code_b5nbhcc_central_table = bcf_quotient_b5nbhcc_central_table_row_step_previous_left * S ((S (bcf_predecessor_b5nbhcc_central_table_row_step)) * bcf_previous_scale_b5nbhcc_central_table) + (bcf_left_b5nbhcc_central_table_row_step))) /\ ((((exists bcf_height_b5nbhcc_central_table_row_step_previous_right. bcf_height_b5nbhcc_central_table_row_step_previous_right + S (bcf_right_b5nbhcc_central_table_row_step) = S ((S (S (bcf_predecessor_b5nbhcc_central_table_row_step))) * bcf_previous_scale_b5nbhcc_central_table)) /\ exists bcf_quotient_b5nbhcc_central_table_row_step_previous_right. bcf_previous_code_b5nbhcc_central_table = bcf_quotient_b5nbhcc_central_table_row_step_previous_right * S ((S (S (bcf_predecessor_b5nbhcc_central_table_row_step))) * bcf_previous_scale_b5nbhcc_central_table) + (bcf_right_b5nbhcc_central_table_row_step))) /\ bcf_value_b5nbhcc_central_table_row_step = bcf_left_b5nbhcc_central_table_row_step + bcf_right_b5nbhcc_central_table_row_step))))))))))) /\ ((((exists bcf_height_b5nbhcc_central_decoded_row_code. bcf_height_b5nbhcc_central_decoded_row_code + S (bcf_row_code_b5nbhcc_central) = S ((S (n + n)) * bcf_row_code_scale_b5nbhcc_central)) /\ exists bcf_quotient_b5nbhcc_central_decoded_row_code. bcf_row_code_code_b5nbhcc_central = bcf_quotient_b5nbhcc_central_decoded_row_code * S ((S (n + n)) * bcf_row_code_scale_b5nbhcc_central) + (bcf_row_code_b5nbhcc_central))) /\ ((((exists bcf_height_b5nbhcc_central_decoded_row_scale. bcf_height_b5nbhcc_central_decoded_row_scale + S (bcf_row_scale_b5nbhcc_central) = S ((S (n + n)) * bcf_row_scale_scale_b5nbhcc_central)) /\ exists bcf_quotient_b5nbhcc_central_decoded_row_scale. bcf_row_scale_code_b5nbhcc_central = bcf_quotient_b5nbhcc_central_decoded_row_scale * S ((S (n + n)) * bcf_row_scale_scale_b5nbhcc_central) + (bcf_row_scale_b5nbhcc_central))) /\ (((exists bcf_height_b5nbhcc_central_decoded_value. bcf_height_b5nbhcc_central_decoded_value + S (C) = S ((S (n)) * bcf_row_scale_b5nbhcc_central)) /\ exists bcf_quotient_b5nbhcc_central_decoded_value. bcf_row_code_b5nbhcc_central = bcf_quotient_b5nbhcc_central_decoded_value * S ((S (n)) * bcf_row_scale_b5nbhcc_central) + (C))))))))) -> (exists bcf_lt_gap_b5nbhcc_above. bcf_lt_gap_b5nbhcc_above + S (q) = S i) -> (((((~(S (i) = 1) /\ forall bpr_left_b5nbhcc_choice_prime bpr_right_b5nbhcc_choice_prime. S (i) = bpr_left_b5nbhcc_choice_prime * bpr_right_b5nbhcc_choice_prime -> bpr_left_b5nbhcc_choice_prime = 1 \/ bpr_right_b5nbhcc_choice_prime = 1)) /\ exists bpr_choice_exponent_b5nbhcc_choice. ((((exists bpr_le_gap_b5nbhcc_choice_valuation_selected_bound. bpr_le_gap_b5nbhcc_choice_valuation_selected_bound + (bpr_choice_exponent_b5nbhcc_choice) = (C)) /\ (exists bpr_power_value_b5nbhcc_choice_valuation_selected. ((exists bpr_power_code_b5nbhcc_choice_valuation_selected_power bpr_power_scale_b5nbhcc_choice_valuation_selected_power. ((forall bpr_power_index_b5nbhcc_choice_valuation_selected_power. (exists bpr_gap_b5nbhcc_choice_valuation_selected_power_repeat_bound. bpr_gap_b5nbhcc_choice_valuation_selected_power_repeat_bound + S (bpr_power_index_b5nbhcc_choice_valuation_selected_power) = bpr_choice_exponent_b5nbhcc_choice) -> (((exists bpr_height_b5nbhcc_choice_valuation_selected_power_repeat_entry. bpr_height_b5nbhcc_choice_valuation_selected_power_repeat_entry + S (S (i)) = S ((S (bpr_power_index_b5nbhcc_choice_valuation_selected_power)) * bpr_power_scale_b5nbhcc_choice_valuation_selected_power)) /\ exists bpr_quotient_b5nbhcc_choice_valuation_selected_power_repeat_entry. bpr_power_code_b5nbhcc_choice_valuation_selected_power = bpr_quotient_b5nbhcc_choice_valuation_selected_power_repeat_entry * S ((S (bpr_power_index_b5nbhcc_choice_valuation_selected_power)) * bpr_power_scale_b5nbhcc_choice_valuation_selected_power) + (S (i))))) /\ (exists ff_u_b5nbhcc_choice_valuation_selected_power_product ff_v_b5nbhcc_choice_valuation_selected_power_product. ((((exists ff_h_b5nbhcc_choice_valuation_selected_power_product_start. ff_h_b5nbhcc_choice_valuation_selected_power_product_start + S (1) = S ((S (0)) * ff_v_b5nbhcc_choice_valuation_selected_power_product)) /\ exists ff_q_b5nbhcc_choice_valuation_selected_power_product_start. ff_u_b5nbhcc_choice_valuation_selected_power_product = ff_q_b5nbhcc_choice_valuation_selected_power_product_start * S ((S (0)) * ff_v_b5nbhcc_choice_valuation_selected_power_product) + (1))) /\ ((((exists ff_h_b5nbhcc_choice_valuation_selected_power_product_terminal. ff_h_b5nbhcc_choice_valuation_selected_power_product_terminal + S (bpr_power_value_b5nbhcc_choice_valuation_selected) = S ((S (bpr_choice_exponent_b5nbhcc_choice)) * ff_v_b5nbhcc_choice_valuation_selected_power_product)) /\ exists ff_q_b5nbhcc_choice_valuation_selected_power_product_terminal. ff_u_b5nbhcc_choice_valuation_selected_power_product = ff_q_b5nbhcc_choice_valuation_selected_power_product_terminal * S ((S (bpr_choice_exponent_b5nbhcc_choice)) * ff_v_b5nbhcc_choice_valuation_selected_power_product) + (bpr_power_value_b5nbhcc_choice_valuation_selected))) /\ forall ff_i_b5nbhcc_choice_valuation_selected_power_product. (exists ff_lt_b5nbhcc_choice_valuation_selected_power_product_bound. ff_lt_b5nbhcc_choice_valuation_selected_power_product_bound + S ff_i_b5nbhcc_choice_valuation_selected_power_product = bpr_choice_exponent_b5nbhcc_choice) -> exists ff_p_b5nbhcc_choice_valuation_selected_power_product ff_r_b5nbhcc_choice_valuation_selected_power_product ff_s_b5nbhcc_choice_valuation_selected_power_product. ((((exists ff_h_b5nbhcc_choice_valuation_selected_power_product_factor. ff_h_b5nbhcc_choice_valuation_selected_power_product_factor + S (ff_p_b5nbhcc_choice_valuation_selected_power_product) = S ((S (ff_i_b5nbhcc_choice_valuation_selected_power_product)) * bpr_power_scale_b5nbhcc_choice_valuation_selected_power)) /\ exists ff_q_b5nbhcc_choice_valuation_selected_power_product_factor. bpr_power_code_b5nbhcc_choice_valuation_selected_power = ff_q_b5nbhcc_choice_valuation_selected_power_product_factor * S ((S (ff_i_b5nbhcc_choice_valuation_selected_power_product)) * bpr_power_scale_b5nbhcc_choice_valuation_selected_power) + (ff_p_b5nbhcc_choice_valuation_selected_power_product))) /\ ((((exists ff_h_b5nbhcc_choice_valuation_selected_power_product_partial. ff_h_b5nbhcc_choice_valuation_selected_power_product_partial + S (ff_r_b5nbhcc_choice_valuation_selected_power_product) = S ((S (ff_i_b5nbhcc_choice_valuation_selected_power_product)) * ff_v_b5nbhcc_choice_valuation_selected_power_product)) /\ exists ff_q_b5nbhcc_choice_valuation_selected_power_product_partial. ff_u_b5nbhcc_choice_valuation_selected_power_product = ff_q_b5nbhcc_choice_valuation_selected_power_product_partial * S ((S (ff_i_b5nbhcc_choice_valuation_selected_power_product)) * ff_v_b5nbhcc_choice_valuation_selected_power_product) + (ff_r_b5nbhcc_choice_valuation_selected_power_product))) /\ ((((exists ff_h_b5nbhcc_choice_valuation_selected_power_product_successor. ff_h_b5nbhcc_choice_valuation_selected_power_product_successor + S (ff_s_b5nbhcc_choice_valuation_selected_power_product) = S ((S (S ff_i_b5nbhcc_choice_valuation_selected_power_product)) * ff_v_b5nbhcc_choice_valuation_selected_power_product)) /\ exists ff_q_b5nbhcc_choice_valuation_selected_power_product_successor. ff_u_b5nbhcc_choice_valuation_selected_power_product = ff_q_b5nbhcc_choice_valuation_selected_power_product_successor * S ((S (S ff_i_b5nbhcc_choice_valuation_selected_power_product)) * ff_v_b5nbhcc_choice_valuation_selected_power_product) + (ff_s_b5nbhcc_choice_valuation_selected_power_product))) /\ ff_s_b5nbhcc_choice_valuation_selected_power_product = ff_r_b5nbhcc_choice_valuation_selected_power_product * ff_p_b5nbhcc_choice_valuation_selected_power_product)))))))) /\ (exists bpr_divides_quotient_b5nbhcc_choice_valuation_selected_divides. C = (bpr_power_value_b5nbhcc_choice_valuation_selected) * bpr_divides_quotient_b5nbhcc_choice_valuation_selected_divides)))) /\ forall bpr_valuation_candidate_b5nbhcc_choice_valuation. (exists bpr_le_gap_b5nbhcc_choice_valuation_candidate_bound. bpr_le_gap_b5nbhcc_choice_valuation_candidate_bound + (bpr_valuation_candidate_b5nbhcc_choice_valuation) = (C)) -> (exists bpr_power_value_b5nbhcc_choice_valuation_candidate. ((exists bpr_power_code_b5nbhcc_choice_valuation_candidate_power bpr_power_scale_b5nbhcc_choice_valuation_candidate_power. ((forall bpr_power_index_b5nbhcc_choice_valuation_candidate_power. (exists bpr_gap_b5nbhcc_choice_valuation_candidate_power_repeat_bound. bpr_gap_b5nbhcc_choice_valuation_candidate_power_repeat_bound + S (bpr_power_index_b5nbhcc_choice_valuation_candidate_power) = bpr_valuation_candidate_b5nbhcc_choice_valuation) -> (((exists bpr_height_b5nbhcc_choice_valuation_candidate_power_repeat_entry. bpr_height_b5nbhcc_choice_valuation_candidate_power_repeat_entry + S (S (i)) = S ((S (bpr_power_index_b5nbhcc_choice_valuation_candidate_power)) * bpr_power_scale_b5nbhcc_choice_valuation_candidate_power)) /\ exists bpr_quotient_b5nbhcc_choice_valuation_candidate_power_repeat_entry. bpr_power_code_b5nbhcc_choice_valuation_candidate_power = bpr_quotient_b5nbhcc_choice_valuation_candidate_power_repeat_entry * S ((S (bpr_power_index_b5nbhcc_choice_valuation_candidate_power)) * bpr_power_scale_b5nbhcc_choice_valuation_candidate_power) + (S (i))))) /\ (exists ff_u_b5nbhcc_choice_valuation_candidate_power_product ff_v_b5nbhcc_choice_valuation_candidate_power_product. ((((exists ff_h_b5nbhcc_choice_valuation_candidate_power_product_start. ff_h_b5nbhcc_choice_valuation_candidate_power_product_start + S (1) = S ((S (0)) * ff_v_b5nbhcc_choice_valuation_candidate_power_product)) /\ exists ff_q_b5nbhcc_choice_valuation_candidate_power_product_start. ff_u_b5nbhcc_choice_valuation_candidate_power_product = ff_q_b5nbhcc_choice_valuation_candidate_power_product_start * S ((S (0)) * ff_v_b5nbhcc_choice_valuation_candidate_power_product) + (1))) /\ ((((exists ff_h_b5nbhcc_choice_valuation_candidate_power_product_terminal. ff_h_b5nbhcc_choice_valuation_candidate_power_product_terminal + S (bpr_power_value_b5nbhcc_choice_valuation_candidate) = S ((S (bpr_valuation_candidate_b5nbhcc_choice_valuation)) * ff_v_b5nbhcc_choice_valuation_candidate_power_product)) /\ exists ff_q_b5nbhcc_choice_valuation_candidate_power_product_terminal. ff_u_b5nbhcc_choice_valuation_candidate_power_product = ff_q_b5nbhcc_choice_valuation_candidate_power_product_terminal * S ((S (bpr_valuation_candidate_b5nbhcc_choice_valuation)) * ff_v_b5nbhcc_choice_valuation_candidate_power_product) + (bpr_power_value_b5nbhcc_choice_valuation_candidate))) /\ forall ff_i_b5nbhcc_choice_valuation_candidate_power_product. (exists ff_lt_b5nbhcc_choice_valuation_candidate_power_product_bound. ff_lt_b5nbhcc_choice_valuation_candidate_power_product_bound + S ff_i_b5nbhcc_choice_valuation_candidate_power_product = bpr_valuation_candidate_b5nbhcc_choice_valuation) -> exists ff_p_b5nbhcc_choice_valuation_candidate_power_product ff_r_b5nbhcc_choice_valuation_candidate_power_product ff_s_b5nbhcc_choice_valuation_candidate_power_product. ((((exists ff_h_b5nbhcc_choice_valuation_candidate_power_product_factor. ff_h_b5nbhcc_choice_valuation_candidate_power_product_factor + S (ff_p_b5nbhcc_choice_valuation_candidate_power_product) = S ((S (ff_i_b5nbhcc_choice_valuation_candidate_power_product)) * bpr_power_scale_b5nbhcc_choice_valuation_candidate_power)) /\ exists ff_q_b5nbhcc_choice_valuation_candidate_power_product_factor. bpr_power_code_b5nbhcc_choice_valuation_candidate_power = ff_q_b5nbhcc_choice_valuation_candidate_power_product_factor * S ((S (ff_i_b5nbhcc_choice_valuation_candidate_power_product)) * bpr_power_scale_b5nbhcc_choice_valuation_candidate_power) + (ff_p_b5nbhcc_choice_valuation_candidate_power_product))) /\ ((((exists ff_h_b5nbhcc_choice_valuation_candidate_power_product_partial. ff_h_b5nbhcc_choice_valuation_candidate_power_product_partial + S (ff_r_b5nbhcc_choice_valuation_candidate_power_product) = S ((S (ff_i_b5nbhcc_choice_valuation_candidate_power_product)) * ff_v_b5nbhcc_choice_valuation_candidate_power_product)) /\ exists ff_q_b5nbhcc_choice_valuation_candidate_power_product_partial. ff_u_b5nbhcc_choice_valuation_candidate_power_product = ff_q_b5nbhcc_choice_valuation_candidate_power_product_partial * S ((S (ff_i_b5nbhcc_choice_valuation_candidate_power_product)) * ff_v_b5nbhcc_choice_valuation_candidate_power_product) + (ff_r_b5nbhcc_choice_valuation_candidate_power_product))) /\ ((((exists ff_h_b5nbhcc_choice_valuation_candidate_power_product_successor. ff_h_b5nbhcc_choice_valuation_candidate_power_product_successor + S (ff_s_b5nbhcc_choice_valuation_candidate_power_product) = S ((S (S ff_i_b5nbhcc_choice_valuation_candidate_power_product)) * ff_v_b5nbhcc_choice_valuation_candidate_power_product)) /\ exists ff_q_b5nbhcc_choice_valuation_candidate_power_product_successor. ff_u_b5nbhcc_choice_valuation_candidate_power_product = ff_q_b5nbhcc_choice_valuation_candidate_power_product_successor * S ((S (S ff_i_b5nbhcc_choice_valuation_candidate_power_product)) * ff_v_b5nbhcc_choice_valuation_candidate_power_product) + (ff_s_b5nbhcc_choice_valuation_candidate_power_product))) /\ ff_s_b5nbhcc_choice_valuation_candidate_power_product = ff_r_b5nbhcc_choice_valuation_candidate_power_product * ff_p_b5nbhcc_choice_valuation_candidate_power_product)))))))) /\ (exists bpr_divides_quotient_b5nbhcc_choice_valuation_candidate_divides. C = (bpr_power_value_b5nbhcc_choice_valuation_candidate) * bpr_divides_quotient_b5nbhcc_choice_valuation_candidate_divides))) -> (exists bpr_le_gap_b5nbhcc_choice_valuation_candidate_below. bpr_le_gap_b5nbhcc_choice_valuation_candidate_below + (bpr_valuation_candidate_b5nbhcc_choice_valuation) = (bpr_choice_exponent_b5nbhcc_choice))) /\ (exists bpr_power_code_b5nbhcc_choice_power bpr_power_scale_b5nbhcc_choice_power. ((forall bpr_power_index_b5nbhcc_choice_power. (exists bpr_gap_b5nbhcc_choice_power_repeat_bound. bpr_gap_b5nbhcc_choice_power_repeat_bound + S (bpr_power_index_b5nbhcc_choice_power) = bpr_choice_exponent_b5nbhcc_choice) -> (((exists bpr_height_b5nbhcc_choice_power_repeat_entry. bpr_height_b5nbhcc_choice_power_repeat_entry + S (S (i)) = S ((S (bpr_power_index_b5nbhcc_choice_power)) * bpr_power_scale_b5nbhcc_choice_power)) /\ exists bpr_quotient_b5nbhcc_choice_power_repeat_entry. bpr_power_code_b5nbhcc_choice_power = bpr_quotient_b5nbhcc_choice_power_repeat_entry * S ((S (bpr_power_index_b5nbhcc_choice_power)) * bpr_power_scale_b5nbhcc_choice_power) + (S (i))))) /\ (exists ff_u_b5nbhcc_choice_power_product ff_v_b5nbhcc_choice_power_product. ((((exists ff_h_b5nbhcc_choice_power_product_start. ff_h_b5nbhcc_choice_power_product_start + S (1) = S ((S (0)) * ff_v_b5nbhcc_choice_power_product)) /\ exists ff_q_b5nbhcc_choice_power_product_start. ff_u_b5nbhcc_choice_power_product = ff_q_b5nbhcc_choice_power_product_start * S ((S (0)) * ff_v_b5nbhcc_choice_power_product) + (1))) /\ ((((exists ff_h_b5nbhcc_choice_power_product_terminal. ff_h_b5nbhcc_choice_power_product_terminal + S (a) = S ((S (bpr_choice_exponent_b5nbhcc_choice)) * ff_v_b5nbhcc_choice_power_product)) /\ exists ff_q_b5nbhcc_choice_power_product_terminal. ff_u_b5nbhcc_choice_power_product = ff_q_b5nbhcc_choice_power_product_terminal * S ((S (bpr_choice_exponent_b5nbhcc_choice)) * ff_v_b5nbhcc_choice_power_product) + (a))) /\ forall ff_i_b5nbhcc_choice_power_product. (exists ff_lt_b5nbhcc_choice_power_product_bound. ff_lt_b5nbhcc_choice_power_product_bound + S ff_i_b5nbhcc_choice_power_product = bpr_choice_exponent_b5nbhcc_choice) -> exists ff_p_b5nbhcc_choice_power_product ff_r_b5nbhcc_choice_power_product ff_s_b5nbhcc_choice_power_product. ((((exists ff_h_b5nbhcc_choice_power_product_factor. ff_h_b5nbhcc_choice_power_product_factor + S (ff_p_b5nbhcc_choice_power_product) = S ((S (ff_i_b5nbhcc_choice_power_product)) * bpr_power_scale_b5nbhcc_choice_power)) /\ exists ff_q_b5nbhcc_choice_power_product_factor. bpr_power_code_b5nbhcc_choice_power = ff_q_b5nbhcc_choice_power_product_factor * S ((S (ff_i_b5nbhcc_choice_power_product)) * bpr_power_scale_b5nbhcc_choice_power) + (ff_p_b5nbhcc_choice_power_product))) /\ ((((exists ff_h_b5nbhcc_choice_power_product_partial. ff_h_b5nbhcc_choice_power_product_partial + S (ff_r_b5nbhcc_choice_power_product) = S ((S (ff_i_b5nbhcc_choice_power_product)) * ff_v_b5nbhcc_choice_power_product)) /\ exists ff_q_b5nbhcc_choice_power_product_partial. ff_u_b5nbhcc_choice_power_product = ff_q_b5nbhcc_choice_power_product_partial * S ((S (ff_i_b5nbhcc_choice_power_product)) * ff_v_b5nbhcc_choice_power_product) + (ff_r_b5nbhcc_choice_power_product))) /\ ((((exists ff_h_b5nbhcc_choice_power_product_successor. ff_h_b5nbhcc_choice_power_product_successor + S (ff_s_b5nbhcc_choice_power_product) = S ((S (S ff_i_b5nbhcc_choice_power_product)) * ff_v_b5nbhcc_choice_power_product)) /\ exists ff_q_b5nbhcc_choice_power_product_successor. ff_u_b5nbhcc_choice_power_product = ff_q_b5nbhcc_choice_power_product_successor * S ((S (S ff_i_b5nbhcc_choice_power_product)) * ff_v_b5nbhcc_choice_power_product) + (ff_s_b5nbhcc_choice_power_product))) /\ ff_s_b5nbhcc_choice_power_product = ff_r_b5nbhcc_choice_power_product * ff_p_b5nbhcc_choice_power_product)))))))))) \/ (~((~(S (i) = 1) /\ forall bpr_left_b5nbhcc_choice_prime bpr_right_b5nbhcc_choice_prime. S (i) = bpr_left_b5nbhcc_choice_prime * bpr_right_b5nbhcc_choice_prime -> bpr_left_b5nbhcc_choice_prime = 1 \/ bpr_right_b5nbhcc_choice_prime = 1)) /\ a = 1))) -> a = 1

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

63 script commands · 11 reading checkpoints · 3 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–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 habove
  4. L14
    intro hchoice
03Establish hrootL15–23

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

  1. L15
  2. L16
    specialize floor_sqrt_le_third_quotient n
  3. L17
    specialize floor_sqrt_le_third_quotient s
  4. L18
    specialize floor_sqrt_le_third_quotient q
  5. L19
    specialize floor_sqrt_le_third_quotient r
  6. L20
    apply floor_sqrt_le_third_quotient
  7. L21
    exact hpositive
  8. L22
    exact hfloor
  9. L23
    exact hdivision
04Establish hrangesL24–33

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. L24
    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. L25
    specialize no_bertrand_central_contribution_choice_ranges n
  3. L26
    specialize no_bertrand_central_contribution_choice_ranges s
  4. L27
    specialize no_bertrand_central_contribution_choice_ranges q
  5. L28
    specialize no_bertrand_central_contribution_choice_ranges r
  6. L29
    specialize no_bertrand_central_contribution_choice_ranges C
  7. L30
    specialize no_bertrand_central_contribution_choice_ranges i
  8. L31
    specialize no_bertrand_central_contribution_choice_ranges a
  9. L32
    apply no_bertrand_central_contribution_choice_ranges
  10. L33
    exact hexclusion
05Use earlier factsL34–38

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

  1. L34
    exact hpositive
  2. L35
    exact hfloor
  3. L36
    exact hdivision
  4. L37
    exact hcentral
  5. L38
    exact hchoice
06Separate the logical casesL39–41

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

  1. L39
    cases hranges
  2. L40
    cases hranges_left
  3. L41
    cases hranges_left_left
07Establish hsmall_to_qL42–48

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

  1. L42
    have hsmall_to_q : Lt(i,q)Definitions: Lt(i,q)Original native command in the exact edition
  2. L43
    specialize le_trans (S i)
  3. L44
    specialize le_trans s
  4. L45
    specialize le_trans q
  5. L46
    apply le_trans
  6. L47
    exact hranges_left_left_left
  7. L48
    exact hroot
08Separate the logical casesL49–49

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

  1. L49
    exfalso
09Use earlier factsL50–54

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

  1. L50
    specialize lt_not_le q
  2. L51
    specialize lt_not_le (S i)
  3. L52
    apply lt_not_le
  4. L53
    exact habove
  5. L54
    exact hsmall_to_q
10Separate the logical casesL55–57

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

  1. L55
    cases hranges_left_right
  2. L56
    cases hranges_left_right_left
  3. L57
    exfalso
11Use earlier factsL58–63

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

  1. L58
    specialize lt_not_le q
  2. L59
    specialize lt_not_le (S i)
  3. L60
    apply lt_not_le
  4. L61
    exact habove
  5. L62
    exact hranges_left_right_left_right
  6. L63
    exact hranges_right

Library-wide reading audit

Original defined command ledger · 63 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 habove
  14. 0014intro hchoice
  15. 0015have hroot : Le(s,q)
    Exact native replay linehave hroot : exists bcf_le_gap_b5nbhcc_root_bound. bcf_le_gap_b5nbhcc_root_bound + (s) = q
  16. 0016specialize floor_sqrt_le_third_quotient n
  17. 0017specialize floor_sqrt_le_third_quotient s
  18. 0018specialize floor_sqrt_le_third_quotient q
  19. 0019specialize floor_sqrt_le_third_quotient r
  20. 0020apply floor_sqrt_le_third_quotient
  21. 0021exact hpositive
  22. 0022exact hfloor
  23. 0023exact hdivision
  24. 0024have 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_b5nbhcc_small_bound. bcf_le_gap_b5nbhcc_small_bound + (S i) = s) /\ (exists bcf_le_gap_b5nbhcc_small_value. bcf_le_gap_b5nbhcc_small_value + (a) = n + n)) \/ (((exists bcf_lt_gap_b5nbhcc_range_above. bcf_lt_gap_b5nbhcc_range_above + S (s) = S i) /\ (exists bcf_le_gap_b5nbhcc_middle_bound. bcf_le_gap_b5nbhcc_middle_bound + (S i) = q)) /\ a = S i) \/ a = 1
  25. 0025specialize no_bertrand_central_contribution_choice_ranges n
  26. 0026specialize no_bertrand_central_contribution_choice_ranges s
  27. 0027specialize no_bertrand_central_contribution_choice_ranges q
  28. 0028specialize no_bertrand_central_contribution_choice_ranges r
  29. 0029specialize no_bertrand_central_contribution_choice_ranges C
  30. 0030specialize no_bertrand_central_contribution_choice_ranges i
  31. 0031specialize no_bertrand_central_contribution_choice_ranges a
  32. 0032apply no_bertrand_central_contribution_choice_ranges
  33. 0033exact hexclusion
  34. 0034exact hpositive
  35. 0035exact hfloor
  36. 0036exact hdivision
  37. 0037exact hcentral
  38. 0038exact hchoice
  39. 0039cases hranges
  40. 0040cases hranges_left
  41. 0041cases hranges_left_left
  42. 0042have hsmall_to_q : Lt(i,q)
    Exact native replay linehave hsmall_to_q : exists bcf_le_gap_b5nbhcc_middle_bound. bcf_le_gap_b5nbhcc_middle_bound + (S i) = q
  43. 0043specialize le_trans (S i)
  44. 0044specialize le_trans s
  45. 0045specialize le_trans q
  46. 0046apply le_trans
  47. 0047exact hranges_left_left_left
  48. 0048exact hroot
  49. 0049exfalso
  50. 0050specialize lt_not_le q
  51. 0051specialize lt_not_le (S i)
  52. 0052apply lt_not_le
  53. 0053exact habove
  54. 0054exact hsmall_to_q
  55. 0055cases hranges_left_right
  56. 0056cases hranges_left_right_left
  57. 0057exfalso
  58. 0058specialize lt_not_le q
  59. 0059specialize lt_not_le (S i)
  60. 0060apply lt_not_le
  61. 0061exact habove
  62. 0062exact hranges_left_right_left_right
  63. 0063exact hranges_right