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
Sum(b,c,l,z) ∧ AllBits(b,c,l)
Only definitions earlier in this acyclic notation graph are used here.
Hygienic expanded first-order definition
((exists ff_u_defined_bit_count_sum ff_v_defined_bit_count_sum. ((((exists ff_h_defined_bit_count_sum_start. ff_h_defined_bit_count_sum_start + S (0) = S ((S (0)) * ff_v_defined_bit_count_sum)) /\ exists ff_q_defined_bit_count_sum_start. ff_u_defined_bit_count_sum = ff_q_defined_bit_count_sum_start * S ((S (0)) * ff_v_defined_bit_count_sum) + (0))) /\ ((((exists ff_h_defined_bit_count_sum_terminal. ff_h_defined_bit_count_sum_terminal + S (z) = S ((S (l)) * ff_v_defined_bit_count_sum)) /\ exists ff_q_defined_bit_count_sum_terminal. ff_u_defined_bit_count_sum = ff_q_defined_bit_count_sum_terminal * S ((S (l)) * ff_v_defined_bit_count_sum) + (z))) /\ forall ff_i_defined_bit_count_sum. (exists ff_lt_defined_bit_count_sum_bound. ff_lt_defined_bit_count_sum_bound + S ff_i_defined_bit_count_sum = l) -> exists ff_a_defined_bit_count_sum ff_r_defined_bit_count_sum ff_s_defined_bit_count_sum. ((((exists ff_h_defined_bit_count_sum_summand. ff_h_defined_bit_count_sum_summand + S (ff_a_defined_bit_count_sum) = S ((S (ff_i_defined_bit_count_sum)) * c)) /\ exists ff_q_defined_bit_count_sum_summand. b = ff_q_defined_bit_count_sum_summand * S ((S (ff_i_defined_bit_count_sum)) * c) + (ff_a_defined_bit_count_sum))) /\ ((((exists ff_h_defined_bit_count_sum_partial. ff_h_defined_bit_count_sum_partial + S (ff_r_defined_bit_count_sum) = S ((S (ff_i_defined_bit_count_sum)) * ff_v_defined_bit_count_sum)) /\ exists ff_q_defined_bit_count_sum_partial. ff_u_defined_bit_count_sum = ff_q_defined_bit_count_sum_partial * S ((S (ff_i_defined_bit_count_sum)) * ff_v_defined_bit_count_sum) + (ff_r_defined_bit_count_sum))) /\ ((((exists ff_h_defined_bit_count_sum_successor. ff_h_defined_bit_count_sum_successor + S (ff_s_defined_bit_count_sum) = S ((S (S ff_i_defined_bit_count_sum)) * ff_v_defined_bit_count_sum)) /\ exists ff_q_defined_bit_count_sum_successor. ff_u_defined_bit_count_sum = ff_q_defined_bit_count_sum_successor * S ((S (S ff_i_defined_bit_count_sum)) * ff_v_defined_bit_count_sum) + (ff_s_defined_bit_count_sum))) /\ ff_s_defined_bit_count_sum = ff_r_defined_bit_count_sum + ff_a_defined_bit_count_sum)))))) /\ (forall ff_i_defined_bit_count_bits. (exists ff_lt_defined_bit_count_bits_bound. ff_lt_defined_bit_count_bits_bound + S ff_i_defined_bit_count_bits = l) -> exists ff_bit_defined_bit_count_bits. ((((exists ff_h_defined_bit_count_bits_decoded. ff_h_defined_bit_count_bits_decoded + S (ff_bit_defined_bit_count_bits) = S ((S (ff_i_defined_bit_count_bits)) * c)) /\ exists ff_q_defined_bit_count_bits_decoded. b = ff_q_defined_bit_count_bits_decoded * S ((S (ff_i_defined_bit_count_bits)) * c) + (ff_bit_defined_bit_count_bits))) /\ (ff_bit_defined_bit_count_bits = 0 \/ ff_bit_defined_bit_count_bits = 1))))
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
CD0003 · finite_bit_count_positive_memberCD0005 · finite_bit_count_subset_leCD000A · finite_bit_member_count_nonzeroCD000C · finite_bit_count_proper_subset_ltCD000D · finite_bit_count_missing_zeroCD000E · finite_bit_count_two_nonzero_memberCD0012 · finite_bit_intersection_existsCD0013 · finite_bit_complement_existsCD0016 · finite_bit_union_existsCD001B · finite_bit_union_intersection_count_balanceCD0022 · finite_modular_set_pullback_existsCD002B · finite_bit_empty_countCD002F · finite_modular_sumset_prefix_existsCD0030 · finite_modular_sumset_existsCD0038 · finite_modular_dyson_transform_existsCD003E · finite_modular_dyson_strict_sizesCD0040 · finite_modular_singleton_cover_boundCD0041 · prime_modular_normalized_boundary_existsCD0042 · prime_cauchy_davenport_normalized_bounded_inductionCD0043 · prime_cauchy_davenport_normalized_cover_boundCD0046 · prime_cauchy_davenport_cover_boundCD0047 · prime_cauchy_davenport_sumset_boundCD0048 · prime_cauchy_davenport_sumset_exists