PD0042

CentralBinom(n,z)

z is the central binomial coefficient Choose(2n,n).

Conservative notation; not a theorem, primitive, or axiom.

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.

Definition in prerequisite notation

Choose(n + n,n,z)

Only definitions earlier in this acyclic notation graph are used here.

Hygienic expanded first-order definition
((exists bcf_lt_gap_bertrand_defined_central_binom_out_of_range. bcf_lt_gap_bertrand_defined_central_binom_out_of_range + S (n + n) = n) /\ z = 0) \/ ((exists bcf_le_gap_bertrand_defined_central_binom_in_range. bcf_le_gap_bertrand_defined_central_binom_in_range + (n) = n + n) /\ (exists bcf_row_code_code_bertrand_defined_central_binom bcf_row_code_scale_bertrand_defined_central_binom bcf_row_scale_code_bertrand_defined_central_binom bcf_row_scale_scale_bertrand_defined_central_binom bcf_row_code_bertrand_defined_central_binom bcf_row_scale_bertrand_defined_central_binom. ((forall bcf_row_index_bertrand_defined_central_binom_table. (exists bcf_lt_gap_bertrand_defined_central_binom_table_row_bound. bcf_lt_gap_bertrand_defined_central_binom_table_row_bound + S (bcf_row_index_bertrand_defined_central_binom_table) = S (n + n)) -> exists bcf_row_code_bertrand_defined_central_binom_table bcf_row_scale_bertrand_defined_central_binom_table. ((((exists bcf_height_bertrand_defined_central_binom_table_decoded_row_code. bcf_height_bertrand_defined_central_binom_table_decoded_row_code + S (bcf_row_code_bertrand_defined_central_binom_table) = S ((S (bcf_row_index_bertrand_defined_central_binom_table)) * bcf_row_code_scale_bertrand_defined_central_binom)) /\ exists bcf_quotient_bertrand_defined_central_binom_table_decoded_row_code. bcf_row_code_code_bertrand_defined_central_binom = bcf_quotient_bertrand_defined_central_binom_table_decoded_row_code * S ((S (bcf_row_index_bertrand_defined_central_binom_table)) * bcf_row_code_scale_bertrand_defined_central_binom) + (bcf_row_code_bertrand_defined_central_binom_table))) /\ ((((exists bcf_height_bertrand_defined_central_binom_table_decoded_row_scale. bcf_height_bertrand_defined_central_binom_table_decoded_row_scale + S (bcf_row_scale_bertrand_defined_central_binom_table) = S ((S (bcf_row_index_bertrand_defined_central_binom_table)) * bcf_row_scale_scale_bertrand_defined_central_binom)) /\ exists bcf_quotient_bertrand_defined_central_binom_table_decoded_row_scale. bcf_row_scale_code_bertrand_defined_central_binom = bcf_quotient_bertrand_defined_central_binom_table_decoded_row_scale * S ((S (bcf_row_index_bertrand_defined_central_binom_table)) * bcf_row_scale_scale_bertrand_defined_central_binom) + (bcf_row_scale_bertrand_defined_central_binom_table))) /\ ((bcf_row_index_bertrand_defined_central_binom_table = 0 /\ (forall bcf_index_bertrand_defined_central_binom_table_zero_row. (exists bcf_lt_gap_bertrand_defined_central_binom_table_zero_row_bound. bcf_lt_gap_bertrand_defined_central_binom_table_zero_row_bound + S (bcf_index_bertrand_defined_central_binom_table_zero_row) = S (n + n)) -> exists bcf_value_bertrand_defined_central_binom_table_zero_row. ((((exists bcf_height_bertrand_defined_central_binom_table_zero_row_entry. bcf_height_bertrand_defined_central_binom_table_zero_row_entry + S (bcf_value_bertrand_defined_central_binom_table_zero_row) = S ((S (bcf_index_bertrand_defined_central_binom_table_zero_row)) * bcf_row_scale_bertrand_defined_central_binom_table)) /\ exists bcf_quotient_bertrand_defined_central_binom_table_zero_row_entry. bcf_row_code_bertrand_defined_central_binom_table = bcf_quotient_bertrand_defined_central_binom_table_zero_row_entry * S ((S (bcf_index_bertrand_defined_central_binom_table_zero_row)) * bcf_row_scale_bertrand_defined_central_binom_table) + (bcf_value_bertrand_defined_central_binom_table_zero_row))) /\ ((bcf_index_bertrand_defined_central_binom_table_zero_row = 0 /\ bcf_value_bertrand_defined_central_binom_table_zero_row = 1) \/ exists bcf_predecessor_bertrand_defined_central_binom_table_zero_row. bcf_index_bertrand_defined_central_binom_table_zero_row = S bcf_predecessor_bertrand_defined_central_binom_table_zero_row /\ bcf_value_bertrand_defined_central_binom_table_zero_row = 0)))) \/ exists bcf_predecessor_bertrand_defined_central_binom_table bcf_previous_code_bertrand_defined_central_binom_table bcf_previous_scale_bertrand_defined_central_binom_table. bcf_row_index_bertrand_defined_central_binom_table = S bcf_predecessor_bertrand_defined_central_binom_table /\ ((((exists bcf_height_bertrand_defined_central_binom_table_decoded_previous_code. bcf_height_bertrand_defined_central_binom_table_decoded_previous_code + S (bcf_previous_code_bertrand_defined_central_binom_table) = S ((S (bcf_predecessor_bertrand_defined_central_binom_table)) * bcf_row_code_scale_bertrand_defined_central_binom)) /\ exists bcf_quotient_bertrand_defined_central_binom_table_decoded_previous_code. bcf_row_code_code_bertrand_defined_central_binom = bcf_quotient_bertrand_defined_central_binom_table_decoded_previous_code * S ((S (bcf_predecessor_bertrand_defined_central_binom_table)) * bcf_row_code_scale_bertrand_defined_central_binom) + (bcf_previous_code_bertrand_defined_central_binom_table))) /\ ((((exists bcf_height_bertrand_defined_central_binom_table_decoded_previous_scale. bcf_height_bertrand_defined_central_binom_table_decoded_previous_scale + S (bcf_previous_scale_bertrand_defined_central_binom_table) = S ((S (bcf_predecessor_bertrand_defined_central_binom_table)) * bcf_row_scale_scale_bertrand_defined_central_binom)) /\ exists bcf_quotient_bertrand_defined_central_binom_table_decoded_previous_scale. bcf_row_scale_code_bertrand_defined_central_binom = bcf_quotient_bertrand_defined_central_binom_table_decoded_previous_scale * S ((S (bcf_predecessor_bertrand_defined_central_binom_table)) * bcf_row_scale_scale_bertrand_defined_central_binom) + (bcf_previous_scale_bertrand_defined_central_binom_table))) /\ (forall bcf_index_bertrand_defined_central_binom_table_row_step. (exists bcf_lt_gap_bertrand_defined_central_binom_table_row_step_bound. bcf_lt_gap_bertrand_defined_central_binom_table_row_step_bound + S (bcf_index_bertrand_defined_central_binom_table_row_step) = S (n + n)) -> exists bcf_value_bertrand_defined_central_binom_table_row_step. ((((exists bcf_height_bertrand_defined_central_binom_table_row_step_entry. bcf_height_bertrand_defined_central_binom_table_row_step_entry + S (bcf_value_bertrand_defined_central_binom_table_row_step) = S ((S (bcf_index_bertrand_defined_central_binom_table_row_step)) * bcf_row_scale_bertrand_defined_central_binom_table)) /\ exists bcf_quotient_bertrand_defined_central_binom_table_row_step_entry. bcf_row_code_bertrand_defined_central_binom_table = bcf_quotient_bertrand_defined_central_binom_table_row_step_entry * S ((S (bcf_index_bertrand_defined_central_binom_table_row_step)) * bcf_row_scale_bertrand_defined_central_binom_table) + (bcf_value_bertrand_defined_central_binom_table_row_step))) /\ ((bcf_index_bertrand_defined_central_binom_table_row_step = 0 /\ bcf_value_bertrand_defined_central_binom_table_row_step = 1) \/ exists bcf_predecessor_bertrand_defined_central_binom_table_row_step bcf_left_bertrand_defined_central_binom_table_row_step bcf_right_bertrand_defined_central_binom_table_row_step. bcf_index_bertrand_defined_central_binom_table_row_step = S bcf_predecessor_bertrand_defined_central_binom_table_row_step /\ ((((exists bcf_height_bertrand_defined_central_binom_table_row_step_previous_left. bcf_height_bertrand_defined_central_binom_table_row_step_previous_left + S (bcf_left_bertrand_defined_central_binom_table_row_step) = S ((S (bcf_predecessor_bertrand_defined_central_binom_table_row_step)) * bcf_previous_scale_bertrand_defined_central_binom_table)) /\ exists bcf_quotient_bertrand_defined_central_binom_table_row_step_previous_left. bcf_previous_code_bertrand_defined_central_binom_table = bcf_quotient_bertrand_defined_central_binom_table_row_step_previous_left * S ((S (bcf_predecessor_bertrand_defined_central_binom_table_row_step)) * bcf_previous_scale_bertrand_defined_central_binom_table) + (bcf_left_bertrand_defined_central_binom_table_row_step))) /\ ((((exists bcf_height_bertrand_defined_central_binom_table_row_step_previous_right. bcf_height_bertrand_defined_central_binom_table_row_step_previous_right + S (bcf_right_bertrand_defined_central_binom_table_row_step) = S ((S (S (bcf_predecessor_bertrand_defined_central_binom_table_row_step))) * bcf_previous_scale_bertrand_defined_central_binom_table)) /\ exists bcf_quotient_bertrand_defined_central_binom_table_row_step_previous_right. bcf_previous_code_bertrand_defined_central_binom_table = bcf_quotient_bertrand_defined_central_binom_table_row_step_previous_right * S ((S (S (bcf_predecessor_bertrand_defined_central_binom_table_row_step))) * bcf_previous_scale_bertrand_defined_central_binom_table) + (bcf_right_bertrand_defined_central_binom_table_row_step))) /\ bcf_value_bertrand_defined_central_binom_table_row_step = bcf_left_bertrand_defined_central_binom_table_row_step + bcf_right_bertrand_defined_central_binom_table_row_step))))))))))) /\ ((((exists bcf_height_bertrand_defined_central_binom_decoded_row_code. bcf_height_bertrand_defined_central_binom_decoded_row_code + S (bcf_row_code_bertrand_defined_central_binom) = S ((S (n + n)) * bcf_row_code_scale_bertrand_defined_central_binom)) /\ exists bcf_quotient_bertrand_defined_central_binom_decoded_row_code. bcf_row_code_code_bertrand_defined_central_binom = bcf_quotient_bertrand_defined_central_binom_decoded_row_code * S ((S (n + n)) * bcf_row_code_scale_bertrand_defined_central_binom) + (bcf_row_code_bertrand_defined_central_binom))) /\ ((((exists bcf_height_bertrand_defined_central_binom_decoded_row_scale. bcf_height_bertrand_defined_central_binom_decoded_row_scale + S (bcf_row_scale_bertrand_defined_central_binom) = S ((S (n + n)) * bcf_row_scale_scale_bertrand_defined_central_binom)) /\ exists bcf_quotient_bertrand_defined_central_binom_decoded_row_scale. bcf_row_scale_code_bertrand_defined_central_binom = bcf_quotient_bertrand_defined_central_binom_decoded_row_scale * S ((S (n + n)) * bcf_row_scale_scale_bertrand_defined_central_binom) + (bcf_row_scale_bertrand_defined_central_binom))) /\ (((exists bcf_height_bertrand_defined_central_binom_decoded_value. bcf_height_bertrand_defined_central_binom_decoded_value + S (z) = S ((S (n)) * bcf_row_scale_bertrand_defined_central_binom)) /\ exists bcf_quotient_bertrand_defined_central_binom_decoded_value. bcf_row_code_bertrand_defined_central_binom = bcf_quotient_bertrand_defined_central_binom_decoded_value * S ((S (n)) * bcf_row_scale_bertrand_defined_central_binom) + (z))))))))

The unchanged native kernel never receives this surface symbol. Binder-safe expansion produces only its existing first-order syntax.

Direct definition dependencies

Definitions depending on this notation

none

Checked theorems using this definition