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.
Hygienic expanded first-order definition
(((n) = 0 /\ (ell) = 1) \/ exists ff_exponent_bl_transport ff_lower_bl_transport ff_upper_bl_transport. (((ell) = S ff_exponent_bl_transport) /\ ((exists ff_positive_bl_transport. ff_positive_bl_transport + 1 = (n)) /\ ((exists pa_b_bl_transport_lower pa_c_bl_transport_lower. ((forall pa_i_bl_transport_lower_repeat. (exists pa_lt_bl_transport_lower_repeat_bound. pa_lt_bl_transport_lower_repeat_bound + S pa_i_bl_transport_lower_repeat = ff_exponent_bl_transport) -> (((exists pa_h_bl_transport_lower_repeat_decoded. pa_h_bl_transport_lower_repeat_decoded + S (2) = S ((S (pa_i_bl_transport_lower_repeat)) * pa_c_bl_transport_lower)) /\ exists pa_q_bl_transport_lower_repeat_decoded. pa_b_bl_transport_lower = pa_q_bl_transport_lower_repeat_decoded * S ((S (pa_i_bl_transport_lower_repeat)) * pa_c_bl_transport_lower) + (2)))) /\ (exists pa_u_bl_transport_lower_product pa_v_bl_transport_lower_product. ((((exists pa_h_bl_transport_lower_product_start. pa_h_bl_transport_lower_product_start + S (1) = S ((S (0)) * pa_v_bl_transport_lower_product)) /\ exists pa_q_bl_transport_lower_product_start. pa_u_bl_transport_lower_product = pa_q_bl_transport_lower_product_start * S ((S (0)) * pa_v_bl_transport_lower_product) + (1))) /\ ((((exists pa_h_bl_transport_lower_product_terminal. pa_h_bl_transport_lower_product_terminal + S (ff_lower_bl_transport) = S ((S (ff_exponent_bl_transport)) * pa_v_bl_transport_lower_product)) /\ exists pa_q_bl_transport_lower_product_terminal. pa_u_bl_transport_lower_product = pa_q_bl_transport_lower_product_terminal * S ((S (ff_exponent_bl_transport)) * pa_v_bl_transport_lower_product) + (ff_lower_bl_transport))) /\ forall pa_i_bl_transport_lower_product. (exists pa_lt_bl_transport_lower_product_bound. pa_lt_bl_transport_lower_product_bound + S pa_i_bl_transport_lower_product = ff_exponent_bl_transport) -> exists pa_p_bl_transport_lower_product pa_r_bl_transport_lower_product pa_s_bl_transport_lower_product. ((((exists pa_h_bl_transport_lower_product_factor. pa_h_bl_transport_lower_product_factor + S (pa_p_bl_transport_lower_product) = S ((S (pa_i_bl_transport_lower_product)) * pa_c_bl_transport_lower)) /\ exists pa_q_bl_transport_lower_product_factor. pa_b_bl_transport_lower = pa_q_bl_transport_lower_product_factor * S ((S (pa_i_bl_transport_lower_product)) * pa_c_bl_transport_lower) + (pa_p_bl_transport_lower_product))) /\ ((((exists pa_h_bl_transport_lower_product_partial. pa_h_bl_transport_lower_product_partial + S (pa_r_bl_transport_lower_product) = S ((S (pa_i_bl_transport_lower_product)) * pa_v_bl_transport_lower_product)) /\ exists pa_q_bl_transport_lower_product_partial. pa_u_bl_transport_lower_product = pa_q_bl_transport_lower_product_partial * S ((S (pa_i_bl_transport_lower_product)) * pa_v_bl_transport_lower_product) + (pa_r_bl_transport_lower_product))) /\ ((((exists pa_h_bl_transport_lower_product_successor. pa_h_bl_transport_lower_product_successor + S (pa_s_bl_transport_lower_product) = S ((S (S pa_i_bl_transport_lower_product)) * pa_v_bl_transport_lower_product)) /\ exists pa_q_bl_transport_lower_product_successor. pa_u_bl_transport_lower_product = pa_q_bl_transport_lower_product_successor * S ((S (S pa_i_bl_transport_lower_product)) * pa_v_bl_transport_lower_product) + (pa_s_bl_transport_lower_product))) /\ pa_s_bl_transport_lower_product = pa_r_bl_transport_lower_product * pa_p_bl_transport_lower_product)))))))) /\ ((exists pa_b_bl_transport_upper pa_c_bl_transport_upper. ((forall pa_i_bl_transport_upper_repeat. (exists pa_lt_bl_transport_upper_repeat_bound. pa_lt_bl_transport_upper_repeat_bound + S pa_i_bl_transport_upper_repeat = ell) -> (((exists pa_h_bl_transport_upper_repeat_decoded. pa_h_bl_transport_upper_repeat_decoded + S (2) = S ((S (pa_i_bl_transport_upper_repeat)) * pa_c_bl_transport_upper)) /\ exists pa_q_bl_transport_upper_repeat_decoded. pa_b_bl_transport_upper = pa_q_bl_transport_upper_repeat_decoded * S ((S (pa_i_bl_transport_upper_repeat)) * pa_c_bl_transport_upper) + (2)))) /\ (exists pa_u_bl_transport_upper_product pa_v_bl_transport_upper_product. ((((exists pa_h_bl_transport_upper_product_start. pa_h_bl_transport_upper_product_start + S (1) = S ((S (0)) * pa_v_bl_transport_upper_product)) /\ exists pa_q_bl_transport_upper_product_start. pa_u_bl_transport_upper_product = pa_q_bl_transport_upper_product_start * S ((S (0)) * pa_v_bl_transport_upper_product) + (1))) /\ ((((exists pa_h_bl_transport_upper_product_terminal. pa_h_bl_transport_upper_product_terminal + S (ff_upper_bl_transport) = S ((S (ell)) * pa_v_bl_transport_upper_product)) /\ exists pa_q_bl_transport_upper_product_terminal. pa_u_bl_transport_upper_product = pa_q_bl_transport_upper_product_terminal * S ((S (ell)) * pa_v_bl_transport_upper_product) + (ff_upper_bl_transport))) /\ forall pa_i_bl_transport_upper_product. (exists pa_lt_bl_transport_upper_product_bound. pa_lt_bl_transport_upper_product_bound + S pa_i_bl_transport_upper_product = ell) -> exists pa_p_bl_transport_upper_product pa_r_bl_transport_upper_product pa_s_bl_transport_upper_product. ((((exists pa_h_bl_transport_upper_product_factor. pa_h_bl_transport_upper_product_factor + S (pa_p_bl_transport_upper_product) = S ((S (pa_i_bl_transport_upper_product)) * pa_c_bl_transport_upper)) /\ exists pa_q_bl_transport_upper_product_factor. pa_b_bl_transport_upper = pa_q_bl_transport_upper_product_factor * S ((S (pa_i_bl_transport_upper_product)) * pa_c_bl_transport_upper) + (pa_p_bl_transport_upper_product))) /\ ((((exists pa_h_bl_transport_upper_product_partial. pa_h_bl_transport_upper_product_partial + S (pa_r_bl_transport_upper_product) = S ((S (pa_i_bl_transport_upper_product)) * pa_v_bl_transport_upper_product)) /\ exists pa_q_bl_transport_upper_product_partial. pa_u_bl_transport_upper_product = pa_q_bl_transport_upper_product_partial * S ((S (pa_i_bl_transport_upper_product)) * pa_v_bl_transport_upper_product) + (pa_r_bl_transport_upper_product))) /\ ((((exists pa_h_bl_transport_upper_product_successor. pa_h_bl_transport_upper_product_successor + S (pa_s_bl_transport_upper_product) = S ((S (S pa_i_bl_transport_upper_product)) * pa_v_bl_transport_upper_product)) /\ exists pa_q_bl_transport_upper_product_successor. pa_u_bl_transport_upper_product = pa_q_bl_transport_upper_product_successor * S ((S (S pa_i_bl_transport_upper_product)) * pa_v_bl_transport_upper_product) + (pa_s_bl_transport_upper_product))) /\ pa_s_bl_transport_upper_product = pa_r_bl_transport_upper_product * pa_p_bl_transport_upper_product)))))))) /\ ((exists ff_lower_gap_bl_transport. ff_lower_gap_bl_transport + (ff_lower_bl_transport) = (n)) /\ (exists ff_upper_gap_bl_transport. ff_upper_gap_bl_transport + S (n) = (ff_upper_bl_transport))))))))
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
none directly; see definition consumers