Theorems and inherited prerequisites
euler_coprime_mod_transport
read theorem
Bundle node 177; exact statement SHA-256 7062f086d29001d616e94defb389843ee39504a89cba651b0252442fba50700d
Exact first-order statement
forall m a b. (forall eut_divisor_eu_transport_old. (exists eut_left_eu_transport_old. (a) = eut_divisor_eu_transport_old * eut_left_eu_transport_old) -> (exists eut_right_eu_transport_old. (m) = eut_divisor_eu_transport_old * eut_right_eu_transport_old) -> eut_divisor_eu_transport_old = 1) -> (exists eu_mod_left_transport eu_mod_right_transport. (a) + (m) * eu_mod_left_transport = (b) + (m) * eu_mod_right_transport) -> (forall eut_divisor_eu_transport_new. (exists eut_left_eu_transport_new. (b) = eut_divisor_eu_transport_new * eut_left_eu_transport_new) -> (exists eut_right_eu_transport_new. (m) = eut_divisor_eu_transport_new * eut_right_eu_transport_new) -> eut_divisor_eu_transport_new = 1)
euler_multiplier_coprime_iff
read theorem
Bundle node 178; exact statement SHA-256 f57e70aacb5f1b988c88c32532b2e7eb847865ea595b5ddde73ee3e0967dba18
Exact first-order statement
forall a m i r. (forall eut_divisor_eu_multiplier_unit. (exists eut_left_eu_multiplier_unit. (a) = eut_divisor_eu_multiplier_unit * eut_left_eu_multiplier_unit) -> (exists eut_right_eu_multiplier_unit. (m) = eut_divisor_eu_multiplier_unit * eut_right_eu_multiplier_unit) -> eut_divisor_eu_multiplier_unit = 1) -> (exists eu_mod_left_multiplier_congruence eu_mod_right_multiplier_congruence. (a*i) + (m) * eu_mod_left_multiplier_congruence = (r) + (m) * eu_mod_right_multiplier_congruence) -> (((forall eut_divisor_eu_source_unit. (exists eut_left_eu_source_unit. (i) = eut_divisor_eu_source_unit * eut_left_eu_source_unit) -> (exists eut_right_eu_source_unit. (m) = eut_divisor_eu_source_unit * eut_right_eu_source_unit) -> eut_divisor_eu_source_unit = 1) -> (forall eut_divisor_eu_target_unit. (exists eut_left_eu_target_unit. (r) = eut_divisor_eu_target_unit * eut_left_eu_target_unit) -> (exists eut_right_eu_target_unit. (m) = eut_divisor_eu_target_unit * eut_right_eu_target_unit) -> eut_divisor_eu_target_unit = 1)) /\ ((forall eut_divisor_eu_target_unit_back. (exists eut_left_eu_target_unit_back. (r) = eut_divisor_eu_target_unit_back * eut_left_eu_target_unit_back) -> (exists eut_right_eu_target_unit_back. (m) = eut_divisor_eu_target_unit_back * eut_right_eu_target_unit_back) -> eut_divisor_eu_target_unit_back = 1) -> (forall eut_divisor_eu_source_unit_back. (exists eut_left_eu_source_unit_back. (i) = eut_divisor_eu_source_unit_back * eut_left_eu_source_unit_back) -> (exists eut_right_eu_source_unit_back. (m) = eut_divisor_eu_source_unit_back * eut_right_eu_source_unit_back) -> eut_divisor_eu_source_unit_back = 1)))
euler_modular_unit_coprime
read theorem
Bundle node 179; exact statement SHA-256 b1bf1e0c0f5b08003abcb58464799ae1246411e44aceb18259e086b5c06dad1e
Exact first-order statement
forall a m. ((exists eut_gap_eu_unit_given_domain. eut_gap_eu_unit_given_domain + S (1) = (m)) /\ exists eu_inverse_unit_given. (exists eut_gap_eu_unit_given_bound. eut_gap_eu_unit_given_bound + S (eu_inverse_unit_given) = (m)) /\ (exists eu_mod_left_unit_given_inverse eu_mod_right_unit_given_inverse. ((a)*eu_inverse_unit_given) + (m) * eu_mod_left_unit_given_inverse = (1) + (m) * eu_mod_right_unit_given_inverse)) -> (forall eut_divisor_eu_unit_coprime. (exists eut_left_eu_unit_coprime. (a) = eut_divisor_eu_unit_coprime * eut_left_eu_unit_coprime) -> (exists eut_right_eu_unit_coprime. (m) = eut_divisor_eu_unit_coprime * eut_right_eu_unit_coprime) -> eut_divisor_eu_unit_coprime = 1)
euler_coprime_modular_unit
read theorem
Bundle node 180; exact statement SHA-256 f7e48360a26f60feecd3230bc7763645cdc4030776feedf1c54f3ee570b2f482
Exact first-order statement
forall a m. (exists eut_gap_eu_unit_domain. eut_gap_eu_unit_domain + S (1) = (m)) -> (forall eut_divisor_eu_unit_coprime_given. (exists eut_left_eu_unit_coprime_given. (a) = eut_divisor_eu_unit_coprime_given * eut_left_eu_unit_coprime_given) -> (exists eut_right_eu_unit_coprime_given. (m) = eut_divisor_eu_unit_coprime_given * eut_right_eu_unit_coprime_given) -> eut_divisor_eu_unit_coprime_given = 1) -> ((exists eut_gap_eu_unit_built_domain. eut_gap_eu_unit_built_domain + S (1) = (m)) /\ exists eu_inverse_unit_built. (exists eut_gap_eu_unit_built_bound. eut_gap_eu_unit_built_bound + S (eu_inverse_unit_built) = (m)) /\ (exists eu_mod_left_unit_built_inverse eu_mod_right_unit_built_inverse. ((a)*eu_inverse_unit_built) + (m) * eu_mod_left_unit_built_inverse = (1) + (m) * eu_mod_right_unit_built_inverse))
euler_multiplier_residue_exists
read theorem
Bundle node 181; exact statement SHA-256 9de1021720684713e7efde8d1798e1cbe3983071c36344c9344c633378ea7546
Exact first-order statement
forall a m i. ~(m=0) -> exists r. (exists eut_gap_eu_residue_bound. eut_gap_eu_residue_bound + S (r) = (m)) /\ (exists eu_mod_left_residue_congruence eu_mod_right_residue_congruence. (a*i) + (m) * eu_mod_left_residue_congruence = (r) + (m) * eu_mod_right_residue_congruence)
euler_multiplier_prefix_empty
read theorem
Bundle node 182; exact statement SHA-256 2c4467d8202daf7fdae1277f192069305523d8f825ee9d9b832e5133125b9031
Exact first-order statement
forall a m b c. forall eu_index_map_empty. (exists eut_gap_eu_map_empty_index. eut_gap_eu_map_empty_index + S (eu_index_map_empty) = (0)) -> exists eu_residue_map_empty. (((exists fs_h_eu_map_empty_at. fs_h_eu_map_empty_at + S (eu_residue_map_empty) = S ((S (eu_index_map_empty)) * c)) /\ exists fs_q_eu_map_empty_at. b = fs_q_eu_map_empty_at * S ((S (eu_index_map_empty)) * c) + (eu_residue_map_empty))) /\ ((exists eut_gap_eu_map_empty_bound. eut_gap_eu_map_empty_bound + S (eu_residue_map_empty) = (m)) /\ (exists eu_mod_left_map_empty_mod eu_mod_right_map_empty_mod. ((a)*eu_index_map_empty) + (m) * eu_mod_left_map_empty_mod = (eu_residue_map_empty) + (m) * eu_mod_right_map_empty_mod))
euler_multiplier_prefix_extend
read theorem
Bundle node 183; exact statement SHA-256 edbbb58982e8d7c1c2ddb8b11be96b7299b5dfc1373475558cb65a0a95bb7cac
Exact first-order statement
forall a m b c l r. (forall eu_index_map_extend_old. (exists eut_gap_eu_map_extend_old_index. eut_gap_eu_map_extend_old_index + S (eu_index_map_extend_old) = (l)) -> exists eu_residue_map_extend_old. (((exists fs_h_eu_map_extend_old_at. fs_h_eu_map_extend_old_at + S (eu_residue_map_extend_old) = S ((S (eu_index_map_extend_old)) * c)) /\ exists fs_q_eu_map_extend_old_at. b = fs_q_eu_map_extend_old_at * S ((S (eu_index_map_extend_old)) * c) + (eu_residue_map_extend_old))) /\ ((exists eut_gap_eu_map_extend_old_bound. eut_gap_eu_map_extend_old_bound + S (eu_residue_map_extend_old) = (m)) /\ (exists eu_mod_left_map_extend_old_mod eu_mod_right_map_extend_old_mod. ((a)*eu_index_map_extend_old) + (m) * eu_mod_left_map_extend_old_mod = (eu_residue_map_extend_old) + (m) * eu_mod_right_map_extend_old_mod))) -> (exists eut_gap_eu_extend_bound. eut_gap_eu_extend_bound + S (r) = (m)) -> (exists eu_mod_left_extend_last_mod eu_mod_right_extend_last_mod. (a*l) + (m) * eu_mod_left_extend_last_mod = (r) + (m) * eu_mod_right_extend_last_mod) -> exists d e. (forall eu_index_map_extend_new. (exists eut_gap_eu_map_extend_new_index. eut_gap_eu_map_extend_new_index + S (eu_index_map_extend_new) = (S l)) -> exists eu_residue_map_extend_new. (((exists fs_h_eu_map_extend_new_at. fs_h_eu_map_extend_new_at + S (eu_residue_map_extend_new) = S ((S (eu_index_map_extend_new)) * e)) /\ exists fs_q_eu_map_extend_new_at. d = fs_q_eu_map_extend_new_at * S ((S (eu_index_map_extend_new)) * e) + (eu_residue_map_extend_new))) /\ ((exists eut_gap_eu_map_extend_new_bound. eut_gap_eu_map_extend_new_bound + S (eu_residue_map_extend_new) = (m)) /\ (exists eu_mod_left_map_extend_new_mod eu_mod_right_map_extend_new_mod. ((a)*eu_index_map_extend_new) + (m) * eu_mod_left_map_extend_new_mod = (eu_residue_map_extend_new) + (m) * eu_mod_right_map_extend_new_mod)))
euler_multiplier_prefix_exists
read theorem
Bundle node 184; exact statement SHA-256 412a351b42c3e450b545606ea9294da3998ee0979028ad2ddc0428b3e9d52845
Exact first-order statement
forall a m l. ~(m=0) -> exists b c. (forall eu_index_map_exists. (exists eut_gap_eu_map_exists_index. eut_gap_eu_map_exists_index + S (eu_index_map_exists) = (l)) -> exists eu_residue_map_exists. (((exists fs_h_eu_map_exists_at. fs_h_eu_map_exists_at + S (eu_residue_map_exists) = S ((S (eu_index_map_exists)) * c)) /\ exists fs_q_eu_map_exists_at. b = fs_q_eu_map_exists_at * S ((S (eu_index_map_exists)) * c) + (eu_residue_map_exists))) /\ ((exists eut_gap_eu_map_exists_bound. eut_gap_eu_map_exists_bound + S (eu_residue_map_exists) = (m)) /\ (exists eu_mod_left_map_exists_mod eu_mod_right_map_exists_mod. ((a)*eu_index_map_exists) + (m) * eu_mod_left_map_exists_mod = (eu_residue_map_exists) + (m) * eu_mod_right_map_exists_mod)))
euler_multiplier_prefix_entry
read theorem
Bundle node 185; exact statement SHA-256 afc11650b48d7885f40955397d542280506adb9faa472af3255487bd9bec6d0a
Exact first-order statement
forall a m b c l i r. (forall eu_index_map_entry. (exists eut_gap_eu_map_entry_index. eut_gap_eu_map_entry_index + S (eu_index_map_entry) = (l)) -> exists eu_residue_map_entry. (((exists fs_h_eu_map_entry_at. fs_h_eu_map_entry_at + S (eu_residue_map_entry) = S ((S (eu_index_map_entry)) * c)) /\ exists fs_q_eu_map_entry_at. b = fs_q_eu_map_entry_at * S ((S (eu_index_map_entry)) * c) + (eu_residue_map_entry))) /\ ((exists eut_gap_eu_map_entry_bound. eut_gap_eu_map_entry_bound + S (eu_residue_map_entry) = (m)) /\ (exists eu_mod_left_map_entry_mod eu_mod_right_map_entry_mod. ((a)*eu_index_map_entry) + (m) * eu_mod_left_map_entry_mod = (eu_residue_map_entry) + (m) * eu_mod_right_map_entry_mod))) -> (exists eut_gap_eu_entry_index. eut_gap_eu_entry_index + S (i) = (l)) -> (((exists fs_h_eu_entry_given. fs_h_eu_entry_given + S (r) = S ((S (i)) * c)) /\ exists fs_q_eu_entry_given. b = fs_q_eu_entry_given * S ((S (i)) * c) + (r))) -> (exists eut_gap_eu_entry_bound. eut_gap_eu_entry_bound + S (r) = (m)) /\ (exists eu_mod_left_entry_mod eu_mod_right_entry_mod. (a*i) + (m) * eu_mod_left_entry_mod = (r) + (m) * eu_mod_right_entry_mod)
euler_multiplier_prefix_bounded_injective
read theorem
Bundle node 186; exact statement SHA-256 e452a7c7a56663212d442f6c0fe3f94ffe1af9d54374de440bdcf6ca35b6b5dd
Exact first-order statement
forall a m b c. ~(m=0) -> (forall eut_divisor_eu_permutation_unit. (exists eut_left_eu_permutation_unit. (a) = eut_divisor_eu_permutation_unit * eut_left_eu_permutation_unit) -> (exists eut_right_eu_permutation_unit. (m) = eut_divisor_eu_permutation_unit * eut_right_eu_permutation_unit) -> eut_divisor_eu_permutation_unit = 1) -> (forall eu_index_map_full. (exists eut_gap_eu_map_full_index. eut_gap_eu_map_full_index + S (eu_index_map_full) = (m)) -> exists eu_residue_map_full. (((exists fs_h_eu_map_full_at. fs_h_eu_map_full_at + S (eu_residue_map_full) = S ((S (eu_index_map_full)) * c)) /\ exists fs_q_eu_map_full_at. b = fs_q_eu_map_full_at * S ((S (eu_index_map_full)) * c) + (eu_residue_map_full))) /\ ((exists eut_gap_eu_map_full_bound. eut_gap_eu_map_full_bound + S (eu_residue_map_full) = (m)) /\ (exists eu_mod_left_map_full_mod eu_mod_right_map_full_mod. ((a)*eu_index_map_full) + (m) * eu_mod_left_map_full_mod = (eu_residue_map_full) + (m) * eu_mod_right_map_full_mod))) -> (forall fp_i_eu_bounded. (exists fp_gap_eu_bounded_index. fp_gap_eu_bounded_index + S fp_i_eu_bounded = m) -> exists fp_value_eu_bounded. ((((exists ff_h_eu_bounded_entry. ff_h_eu_bounded_entry + S (fp_value_eu_bounded) = S ((S (fp_i_eu_bounded)) * c)) /\ exists ff_q_eu_bounded_entry. b = ff_q_eu_bounded_entry * S ((S (fp_i_eu_bounded)) * c) + (fp_value_eu_bounded))) /\ (exists fp_gap_eu_bounded_value. fp_gap_eu_bounded_value + S fp_value_eu_bounded = m))) /\ (forall fp_i_eu_injective fp_j_eu_injective fp_value_eu_injective. (exists fp_gap_eu_injective_i. fp_gap_eu_injective_i + S fp_i_eu_injective = m) -> (exists fp_gap_eu_injective_j. fp_gap_eu_injective_j + S fp_j_eu_injective = m) -> (((exists ff_h_eu_injective_left. ff_h_eu_injective_left + S (fp_value_eu_injective) = S ((S (fp_i_eu_injective)) * c)) /\ exists ff_q_eu_injective_left. b = ff_q_eu_injective_left * S ((S (fp_i_eu_injective)) * c) + (fp_value_eu_injective))) -> (((exists ff_h_eu_injective_right. ff_h_eu_injective_right + S (fp_value_eu_injective) = S ((S (fp_j_eu_injective)) * c)) /\ exists ff_q_eu_injective_right. b = ff_q_eu_injective_right * S ((S (fp_j_eu_injective)) * c) + (fp_value_eu_injective))) -> fp_i_eu_injective = fp_j_eu_injective)
euler_multiplier_prefix_permutation
read theorem
Bundle node 187; exact statement SHA-256 8bf2f9b81d905047940e3c674cc2a1bf0c81ecbfdf8d62bbf330fdd56628bad2
Exact first-order statement
forall a m b c. ~(m=0) -> (forall eut_divisor_eu_permutation_coprime. (exists eut_left_eu_permutation_coprime. (a) = eut_divisor_eu_permutation_coprime * eut_left_eu_permutation_coprime) -> (exists eut_right_eu_permutation_coprime. (m) = eut_divisor_eu_permutation_coprime * eut_right_eu_permutation_coprime) -> eut_divisor_eu_permutation_coprime = 1) -> (forall eu_index_permutation_map. (exists eut_gap_eu_permutation_map_index. eut_gap_eu_permutation_map_index + S (eu_index_permutation_map) = (m)) -> exists eu_residue_permutation_map. (((exists fs_h_eu_permutation_map_at. fs_h_eu_permutation_map_at + S (eu_residue_permutation_map) = S ((S (eu_index_permutation_map)) * c)) /\ exists fs_q_eu_permutation_map_at. b = fs_q_eu_permutation_map_at * S ((S (eu_index_permutation_map)) * c) + (eu_residue_permutation_map))) /\ ((exists eut_gap_eu_permutation_map_bound. eut_gap_eu_permutation_map_bound + S (eu_residue_permutation_map) = (m)) /\ (exists eu_mod_left_permutation_map_mod eu_mod_right_permutation_map_mod. ((a)*eu_index_permutation_map) + (m) * eu_mod_left_permutation_map_mod = (eu_residue_permutation_map) + (m) * eu_mod_right_permutation_map_mod))) -> (((forall fp_i_eu_actual_permutation_bounded. (exists fp_gap_eu_actual_permutation_bounded_index. fp_gap_eu_actual_permutation_bounded_index + S fp_i_eu_actual_permutation_bounded = m) -> exists fp_value_eu_actual_permutation_bounded. ((((exists ff_h_eu_actual_permutation_bounded_entry. ff_h_eu_actual_permutation_bounded_entry + S (fp_value_eu_actual_permutation_bounded) = S ((S (fp_i_eu_actual_permutation_bounded)) * c)) /\ exists ff_q_eu_actual_permutation_bounded_entry. b = ff_q_eu_actual_permutation_bounded_entry * S ((S (fp_i_eu_actual_permutation_bounded)) * c) + (fp_value_eu_actual_permutation_bounded))) /\ (exists fp_gap_eu_actual_permutation_bounded_value. fp_gap_eu_actual_permutation_bounded_value + S fp_value_eu_actual_permutation_bounded = m))) /\ ((forall fp_i_eu_actual_permutation_injective fp_j_eu_actual_permutation_injective fp_value_eu_actual_permutation_injective. (exists fp_gap_eu_actual_permutation_injective_i. fp_gap_eu_actual_permutation_injective_i + S fp_i_eu_actual_permutation_injective = m) -> (exists fp_gap_eu_actual_permutation_injective_j. fp_gap_eu_actual_permutation_injective_j + S fp_j_eu_actual_permutation_injective = m) -> (((exists ff_h_eu_actual_permutation_injective_left. ff_h_eu_actual_permutation_injective_left + S (fp_value_eu_actual_permutation_injective) = S ((S (fp_i_eu_actual_permutation_injective)) * c)) /\ exists ff_q_eu_actual_permutation_injective_left. b = ff_q_eu_actual_permutation_injective_left * S ((S (fp_i_eu_actual_permutation_injective)) * c) + (fp_value_eu_actual_permutation_injective))) -> (((exists ff_h_eu_actual_permutation_injective_right. ff_h_eu_actual_permutation_injective_right + S (fp_value_eu_actual_permutation_injective) = S ((S (fp_j_eu_actual_permutation_injective)) * c)) /\ exists ff_q_eu_actual_permutation_injective_right. b = ff_q_eu_actual_permutation_injective_right * S ((S (fp_j_eu_actual_permutation_injective)) * c) + (fp_value_eu_actual_permutation_injective))) -> fp_i_eu_actual_permutation_injective = fp_j_eu_actual_permutation_injective) /\ (forall fp_value_eu_actual_permutation_surjective. (exists fp_gap_eu_actual_permutation_surjective_value. fp_gap_eu_actual_permutation_surjective_value + S fp_value_eu_actual_permutation_surjective = m) -> exists fp_i_eu_actual_permutation_surjective. ((exists fp_gap_eu_actual_permutation_surjective_index. fp_gap_eu_actual_permutation_surjective_index + S fp_i_eu_actual_permutation_surjective = m) /\ (((exists ff_h_eu_actual_permutation_surjective_entry. ff_h_eu_actual_permutation_surjective_entry + S (fp_value_eu_actual_permutation_surjective) = S ((S (fp_i_eu_actual_permutation_surjective)) * c)) /\ exists ff_q_eu_actual_permutation_surjective_entry. b = ff_q_eu_actual_permutation_surjective_entry * S ((S (fp_i_eu_actual_permutation_surjective)) * c) + (fp_value_eu_actual_permutation_surjective))))))))
euler_multiplier_permutation_exists
read theorem
Bundle node 188; exact statement SHA-256 ee049e3a4d625ec0da3ab6d4ecff22da14d26fb3d4297031b23b2ece92c14fec
Exact first-order statement
forall a m. ~(m=0) -> (forall eut_divisor_eu_exists_unit. (exists eut_left_eu_exists_unit. (a) = eut_divisor_eu_exists_unit * eut_left_eu_exists_unit) -> (exists eut_right_eu_exists_unit. (m) = eut_divisor_eu_exists_unit * eut_right_eu_exists_unit) -> eut_divisor_eu_exists_unit = 1) -> exists b c. (forall eu_index_exists_map. (exists eut_gap_eu_exists_map_index. eut_gap_eu_exists_map_index + S (eu_index_exists_map) = (m)) -> exists eu_residue_exists_map. (((exists fs_h_eu_exists_map_at. fs_h_eu_exists_map_at + S (eu_residue_exists_map) = S ((S (eu_index_exists_map)) * c)) /\ exists fs_q_eu_exists_map_at. b = fs_q_eu_exists_map_at * S ((S (eu_index_exists_map)) * c) + (eu_residue_exists_map))) /\ ((exists eut_gap_eu_exists_map_bound. eut_gap_eu_exists_map_bound + S (eu_residue_exists_map) = (m)) /\ (exists eu_mod_left_exists_map_mod eu_mod_right_exists_map_mod. ((a)*eu_index_exists_map) + (m) * eu_mod_left_exists_map_mod = (eu_residue_exists_map) + (m) * eu_mod_right_exists_map_mod))) /\ (((forall fp_i_eu_exists_permutation_bounded. (exists fp_gap_eu_exists_permutation_bounded_index. fp_gap_eu_exists_permutation_bounded_index + S fp_i_eu_exists_permutation_bounded = m) -> exists fp_value_eu_exists_permutation_bounded. ((((exists ff_h_eu_exists_permutation_bounded_entry. ff_h_eu_exists_permutation_bounded_entry + S (fp_value_eu_exists_permutation_bounded) = S ((S (fp_i_eu_exists_permutation_bounded)) * c)) /\ exists ff_q_eu_exists_permutation_bounded_entry. b = ff_q_eu_exists_permutation_bounded_entry * S ((S (fp_i_eu_exists_permutation_bounded)) * c) + (fp_value_eu_exists_permutation_bounded))) /\ (exists fp_gap_eu_exists_permutation_bounded_value. fp_gap_eu_exists_permutation_bounded_value + S fp_value_eu_exists_permutation_bounded = m))) /\ ((forall fp_i_eu_exists_permutation_injective fp_j_eu_exists_permutation_injective fp_value_eu_exists_permutation_injective. (exists fp_gap_eu_exists_permutation_injective_i. fp_gap_eu_exists_permutation_injective_i + S fp_i_eu_exists_permutation_injective = m) -> (exists fp_gap_eu_exists_permutation_injective_j. fp_gap_eu_exists_permutation_injective_j + S fp_j_eu_exists_permutation_injective = m) -> (((exists ff_h_eu_exists_permutation_injective_left. ff_h_eu_exists_permutation_injective_left + S (fp_value_eu_exists_permutation_injective) = S ((S (fp_i_eu_exists_permutation_injective)) * c)) /\ exists ff_q_eu_exists_permutation_injective_left. b = ff_q_eu_exists_permutation_injective_left * S ((S (fp_i_eu_exists_permutation_injective)) * c) + (fp_value_eu_exists_permutation_injective))) -> (((exists ff_h_eu_exists_permutation_injective_right. ff_h_eu_exists_permutation_injective_right + S (fp_value_eu_exists_permutation_injective) = S ((S (fp_j_eu_exists_permutation_injective)) * c)) /\ exists ff_q_eu_exists_permutation_injective_right. b = ff_q_eu_exists_permutation_injective_right * S ((S (fp_j_eu_exists_permutation_injective)) * c) + (fp_value_eu_exists_permutation_injective))) -> fp_i_eu_exists_permutation_injective = fp_j_eu_exists_permutation_injective) /\ (forall fp_value_eu_exists_permutation_surjective. (exists fp_gap_eu_exists_permutation_surjective_value. fp_gap_eu_exists_permutation_surjective_value + S fp_value_eu_exists_permutation_surjective = m) -> exists fp_i_eu_exists_permutation_surjective. ((exists fp_gap_eu_exists_permutation_surjective_index. fp_gap_eu_exists_permutation_surjective_index + S fp_i_eu_exists_permutation_surjective = m) /\ (((exists ff_h_eu_exists_permutation_surjective_entry. ff_h_eu_exists_permutation_surjective_entry + S (fp_value_eu_exists_permutation_surjective) = S ((S (fp_i_eu_exists_permutation_surjective)) * c)) /\ exists ff_q_eu_exists_permutation_surjective_entry. b = ff_q_eu_exists_permutation_surjective_entry * S ((S (fp_i_eu_exists_permutation_surjective)) * c) + (fp_value_eu_exists_permutation_surjective))))))))
euler_unit_product_factor_exists
read theorem
Bundle node 189; exact statement SHA-256 d464f429c73c1db9580e1ef98ebc51c22866737f9ccbd11ddf368371fe89e0d8
Exact first-order statement
forall m i. exists v. ((((forall eut_divisor_eu_factor_exists_coprime. (exists eut_left_eu_factor_exists_coprime. (i) = eut_divisor_eu_factor_exists_coprime * eut_left_eu_factor_exists_coprime) -> (exists eut_right_eu_factor_exists_coprime. (m) = eut_divisor_eu_factor_exists_coprime * eut_right_eu_factor_exists_coprime) -> eut_divisor_eu_factor_exists_coprime = 1) /\ (v)=(i)) \/ (~(forall eut_divisor_eu_factor_exists_coprime. (exists eut_left_eu_factor_exists_coprime. (i) = eut_divisor_eu_factor_exists_coprime * eut_left_eu_factor_exists_coprime) -> (exists eut_right_eu_factor_exists_coprime. (m) = eut_divisor_eu_factor_exists_coprime * eut_right_eu_factor_exists_coprime) -> eut_divisor_eu_factor_exists_coprime = 1) /\ (v)=1)))
euler_unit_product_factor_unit_value
read theorem
Bundle node 190; exact statement SHA-256 4d337f58a62df33f6427d404a65b684aa7ad253a9ae5dee15010334e25f54f2f
Exact first-order statement
forall m i v. (forall eut_divisor_eu_factor_unit. (exists eut_left_eu_factor_unit. (i) = eut_divisor_eu_factor_unit * eut_left_eu_factor_unit) -> (exists eut_right_eu_factor_unit. (m) = eut_divisor_eu_factor_unit * eut_right_eu_factor_unit) -> eut_divisor_eu_factor_unit = 1) -> ((((forall eut_divisor_eu_factor_unit_coprime. (exists eut_left_eu_factor_unit_coprime. (i) = eut_divisor_eu_factor_unit_coprime * eut_left_eu_factor_unit_coprime) -> (exists eut_right_eu_factor_unit_coprime. (m) = eut_divisor_eu_factor_unit_coprime * eut_right_eu_factor_unit_coprime) -> eut_divisor_eu_factor_unit_coprime = 1) /\ (v)=(i)) \/ (~(forall eut_divisor_eu_factor_unit_coprime. (exists eut_left_eu_factor_unit_coprime. (i) = eut_divisor_eu_factor_unit_coprime * eut_left_eu_factor_unit_coprime) -> (exists eut_right_eu_factor_unit_coprime. (m) = eut_divisor_eu_factor_unit_coprime * eut_right_eu_factor_unit_coprime) -> eut_divisor_eu_factor_unit_coprime = 1) /\ (v)=1))) -> v=i
euler_unit_product_factor_nonunit_value
read theorem
Bundle node 191; exact statement SHA-256 bec2a490e13b80421a93f41f9dcf212a93f646804dc7ef416083a718eaf4cd34
Exact first-order statement
forall m i v. ~(forall eut_divisor_eu_factor_nonunit. (exists eut_left_eu_factor_nonunit. (i) = eut_divisor_eu_factor_nonunit * eut_left_eu_factor_nonunit) -> (exists eut_right_eu_factor_nonunit. (m) = eut_divisor_eu_factor_nonunit * eut_right_eu_factor_nonunit) -> eut_divisor_eu_factor_nonunit = 1) -> ((((forall eut_divisor_eu_factor_nonunit_coprime. (exists eut_left_eu_factor_nonunit_coprime. (i) = eut_divisor_eu_factor_nonunit_coprime * eut_left_eu_factor_nonunit_coprime) -> (exists eut_right_eu_factor_nonunit_coprime. (m) = eut_divisor_eu_factor_nonunit_coprime * eut_right_eu_factor_nonunit_coprime) -> eut_divisor_eu_factor_nonunit_coprime = 1) /\ (v)=(i)) \/ (~(forall eut_divisor_eu_factor_nonunit_coprime. (exists eut_left_eu_factor_nonunit_coprime. (i) = eut_divisor_eu_factor_nonunit_coprime * eut_left_eu_factor_nonunit_coprime) -> (exists eut_right_eu_factor_nonunit_coprime. (m) = eut_divisor_eu_factor_nonunit_coprime * eut_right_eu_factor_nonunit_coprime) -> eut_divisor_eu_factor_nonunit_coprime = 1) /\ (v)=1))) -> v=1
euler_unit_product_factor_coprime
read theorem
Bundle node 192; exact statement SHA-256 933a0cc3eb6dc3db2a7da526b41e1ff8c6c427564b67358e500febf948111283
Exact first-order statement
forall m i v. ((((forall eut_divisor_eu_factor_coprime_coprime. (exists eut_left_eu_factor_coprime_coprime. (i) = eut_divisor_eu_factor_coprime_coprime * eut_left_eu_factor_coprime_coprime) -> (exists eut_right_eu_factor_coprime_coprime. (m) = eut_divisor_eu_factor_coprime_coprime * eut_right_eu_factor_coprime_coprime) -> eut_divisor_eu_factor_coprime_coprime = 1) /\ (v)=(i)) \/ (~(forall eut_divisor_eu_factor_coprime_coprime. (exists eut_left_eu_factor_coprime_coprime. (i) = eut_divisor_eu_factor_coprime_coprime * eut_left_eu_factor_coprime_coprime) -> (exists eut_right_eu_factor_coprime_coprime. (m) = eut_divisor_eu_factor_coprime_coprime * eut_right_eu_factor_coprime_coprime) -> eut_divisor_eu_factor_coprime_coprime = 1) /\ (v)=1))) -> (forall eut_divisor_eu_factor_result_coprime. (exists eut_left_eu_factor_result_coprime. (v) = eut_divisor_eu_factor_result_coprime * eut_left_eu_factor_result_coprime) -> (exists eut_right_eu_factor_result_coprime. (m) = eut_divisor_eu_factor_result_coprime * eut_right_eu_factor_result_coprime) -> eut_divisor_eu_factor_result_coprime = 1)
euler_unit_product_prefix_empty
read theorem
Bundle node 193; exact statement SHA-256 f5b0dce226c5c248d56cff9ddc6ce17272fac3e29724222c309a7e6b1de43103
Exact first-order statement
forall m b c. (forall eu_factor_index_factors_empty. (exists eut_gap_eu_factors_empty_index. eut_gap_eu_factors_empty_index + S (eu_factor_index_factors_empty) = (0)) -> exists eu_factor_value_factors_empty. (((exists fs_h_eu_factors_empty_at. fs_h_eu_factors_empty_at + S (eu_factor_value_factors_empty) = S ((S (eu_factor_index_factors_empty)) * c)) /\ exists fs_q_eu_factors_empty_at. b = fs_q_eu_factors_empty_at * S ((S (eu_factor_index_factors_empty)) * c) + (eu_factor_value_factors_empty))) /\ ((((forall eut_divisor_eu_factors_empty_choice_coprime. (exists eut_left_eu_factors_empty_choice_coprime. (eu_factor_index_factors_empty) = eut_divisor_eu_factors_empty_choice_coprime * eut_left_eu_factors_empty_choice_coprime) -> (exists eut_right_eu_factors_empty_choice_coprime. (m) = eut_divisor_eu_factors_empty_choice_coprime * eut_right_eu_factors_empty_choice_coprime) -> eut_divisor_eu_factors_empty_choice_coprime = 1) /\ (eu_factor_value_factors_empty)=(eu_factor_index_factors_empty)) \/ (~(forall eut_divisor_eu_factors_empty_choice_coprime. (exists eut_left_eu_factors_empty_choice_coprime. (eu_factor_index_factors_empty) = eut_divisor_eu_factors_empty_choice_coprime * eut_left_eu_factors_empty_choice_coprime) -> (exists eut_right_eu_factors_empty_choice_coprime. (m) = eut_divisor_eu_factors_empty_choice_coprime * eut_right_eu_factors_empty_choice_coprime) -> eut_divisor_eu_factors_empty_choice_coprime = 1) /\ (eu_factor_value_factors_empty)=1))))
euler_unit_product_prefix_extend
read theorem
Bundle node 194; exact statement SHA-256 bbe6fc05890ef26713fe18288fa56b338c231987b8dc350297254f79c255dfeb
Exact first-order statement
forall m b c l v. (forall eu_factor_index_factors_extend_old. (exists eut_gap_eu_factors_extend_old_index. eut_gap_eu_factors_extend_old_index + S (eu_factor_index_factors_extend_old) = (l)) -> exists eu_factor_value_factors_extend_old. (((exists fs_h_eu_factors_extend_old_at. fs_h_eu_factors_extend_old_at + S (eu_factor_value_factors_extend_old) = S ((S (eu_factor_index_factors_extend_old)) * c)) /\ exists fs_q_eu_factors_extend_old_at. b = fs_q_eu_factors_extend_old_at * S ((S (eu_factor_index_factors_extend_old)) * c) + (eu_factor_value_factors_extend_old))) /\ ((((forall eut_divisor_eu_factors_extend_old_choice_coprime. (exists eut_left_eu_factors_extend_old_choice_coprime. (eu_factor_index_factors_extend_old) = eut_divisor_eu_factors_extend_old_choice_coprime * eut_left_eu_factors_extend_old_choice_coprime) -> (exists eut_right_eu_factors_extend_old_choice_coprime. (m) = eut_divisor_eu_factors_extend_old_choice_coprime * eut_right_eu_factors_extend_old_choice_coprime) -> eut_divisor_eu_factors_extend_old_choice_coprime = 1) /\ (eu_factor_value_factors_extend_old)=(eu_factor_index_factors_extend_old)) \/ (~(forall eut_divisor_eu_factors_extend_old_choice_coprime. (exists eut_left_eu_factors_extend_old_choice_coprime. (eu_factor_index_factors_extend_old) = eut_divisor_eu_factors_extend_old_choice_coprime * eut_left_eu_factors_extend_old_choice_coprime) -> (exists eut_right_eu_factors_extend_old_choice_coprime. (m) = eut_divisor_eu_factors_extend_old_choice_coprime * eut_right_eu_factors_extend_old_choice_coprime) -> eut_divisor_eu_factors_extend_old_choice_coprime = 1) /\ (eu_factor_value_factors_extend_old)=1)))) -> ((((forall eut_divisor_eu_factor_extend_last_coprime. (exists eut_left_eu_factor_extend_last_coprime. (l) = eut_divisor_eu_factor_extend_last_coprime * eut_left_eu_factor_extend_last_coprime) -> (exists eut_right_eu_factor_extend_last_coprime. (m) = eut_divisor_eu_factor_extend_last_coprime * eut_right_eu_factor_extend_last_coprime) -> eut_divisor_eu_factor_extend_last_coprime = 1) /\ (v)=(l)) \/ (~(forall eut_divisor_eu_factor_extend_last_coprime. (exists eut_left_eu_factor_extend_last_coprime. (l) = eut_divisor_eu_factor_extend_last_coprime * eut_left_eu_factor_extend_last_coprime) -> (exists eut_right_eu_factor_extend_last_coprime. (m) = eut_divisor_eu_factor_extend_last_coprime * eut_right_eu_factor_extend_last_coprime) -> eut_divisor_eu_factor_extend_last_coprime = 1) /\ (v)=1))) -> exists d e. (forall eu_factor_index_factors_extend_new. (exists eut_gap_eu_factors_extend_new_index. eut_gap_eu_factors_extend_new_index + S (eu_factor_index_factors_extend_new) = (S l)) -> exists eu_factor_value_factors_extend_new. (((exists fs_h_eu_factors_extend_new_at. fs_h_eu_factors_extend_new_at + S (eu_factor_value_factors_extend_new) = S ((S (eu_factor_index_factors_extend_new)) * e)) /\ exists fs_q_eu_factors_extend_new_at. d = fs_q_eu_factors_extend_new_at * S ((S (eu_factor_index_factors_extend_new)) * e) + (eu_factor_value_factors_extend_new))) /\ ((((forall eut_divisor_eu_factors_extend_new_choice_coprime. (exists eut_left_eu_factors_extend_new_choice_coprime. (eu_factor_index_factors_extend_new) = eut_divisor_eu_factors_extend_new_choice_coprime * eut_left_eu_factors_extend_new_choice_coprime) -> (exists eut_right_eu_factors_extend_new_choice_coprime. (m) = eut_divisor_eu_factors_extend_new_choice_coprime * eut_right_eu_factors_extend_new_choice_coprime) -> eut_divisor_eu_factors_extend_new_choice_coprime = 1) /\ (eu_factor_value_factors_extend_new)=(eu_factor_index_factors_extend_new)) \/ (~(forall eut_divisor_eu_factors_extend_new_choice_coprime. (exists eut_left_eu_factors_extend_new_choice_coprime. (eu_factor_index_factors_extend_new) = eut_divisor_eu_factors_extend_new_choice_coprime * eut_left_eu_factors_extend_new_choice_coprime) -> (exists eut_right_eu_factors_extend_new_choice_coprime. (m) = eut_divisor_eu_factors_extend_new_choice_coprime * eut_right_eu_factors_extend_new_choice_coprime) -> eut_divisor_eu_factors_extend_new_choice_coprime = 1) /\ (eu_factor_value_factors_extend_new)=1))))
euler_unit_product_prefix_exists
read theorem
Bundle node 195; exact statement SHA-256 de45c6bd8d75a991c06a3907d7dcabaf48bc9ef10d67c244e52825809427c063
Exact first-order statement
forall m l. exists b c. (forall eu_factor_index_factors_exists. (exists eut_gap_eu_factors_exists_index. eut_gap_eu_factors_exists_index + S (eu_factor_index_factors_exists) = (l)) -> exists eu_factor_value_factors_exists. (((exists fs_h_eu_factors_exists_at. fs_h_eu_factors_exists_at + S (eu_factor_value_factors_exists) = S ((S (eu_factor_index_factors_exists)) * c)) /\ exists fs_q_eu_factors_exists_at. b = fs_q_eu_factors_exists_at * S ((S (eu_factor_index_factors_exists)) * c) + (eu_factor_value_factors_exists))) /\ ((((forall eut_divisor_eu_factors_exists_choice_coprime. (exists eut_left_eu_factors_exists_choice_coprime. (eu_factor_index_factors_exists) = eut_divisor_eu_factors_exists_choice_coprime * eut_left_eu_factors_exists_choice_coprime) -> (exists eut_right_eu_factors_exists_choice_coprime. (m) = eut_divisor_eu_factors_exists_choice_coprime * eut_right_eu_factors_exists_choice_coprime) -> eut_divisor_eu_factors_exists_choice_coprime = 1) /\ (eu_factor_value_factors_exists)=(eu_factor_index_factors_exists)) \/ (~(forall eut_divisor_eu_factors_exists_choice_coprime. (exists eut_left_eu_factors_exists_choice_coprime. (eu_factor_index_factors_exists) = eut_divisor_eu_factors_exists_choice_coprime * eut_left_eu_factors_exists_choice_coprime) -> (exists eut_right_eu_factors_exists_choice_coprime. (m) = eut_divisor_eu_factors_exists_choice_coprime * eut_right_eu_factors_exists_choice_coprime) -> eut_divisor_eu_factors_exists_choice_coprime = 1) /\ (eu_factor_value_factors_exists)=1))))
euler_unit_product_prefix_drop_last
read theorem
Bundle node 196; exact statement SHA-256 31393dd2e1e7a0007d76f77cd03e34ce7303fccdb7f0a33a96acc43c9a9e5916
Exact first-order statement
forall m b c l. (forall eu_factor_index_factors_drop_old. (exists eut_gap_eu_factors_drop_old_index. eut_gap_eu_factors_drop_old_index + S (eu_factor_index_factors_drop_old) = (S l)) -> exists eu_factor_value_factors_drop_old. (((exists fs_h_eu_factors_drop_old_at. fs_h_eu_factors_drop_old_at + S (eu_factor_value_factors_drop_old) = S ((S (eu_factor_index_factors_drop_old)) * c)) /\ exists fs_q_eu_factors_drop_old_at. b = fs_q_eu_factors_drop_old_at * S ((S (eu_factor_index_factors_drop_old)) * c) + (eu_factor_value_factors_drop_old))) /\ ((((forall eut_divisor_eu_factors_drop_old_choice_coprime. (exists eut_left_eu_factors_drop_old_choice_coprime. (eu_factor_index_factors_drop_old) = eut_divisor_eu_factors_drop_old_choice_coprime * eut_left_eu_factors_drop_old_choice_coprime) -> (exists eut_right_eu_factors_drop_old_choice_coprime. (m) = eut_divisor_eu_factors_drop_old_choice_coprime * eut_right_eu_factors_drop_old_choice_coprime) -> eut_divisor_eu_factors_drop_old_choice_coprime = 1) /\ (eu_factor_value_factors_drop_old)=(eu_factor_index_factors_drop_old)) \/ (~(forall eut_divisor_eu_factors_drop_old_choice_coprime. (exists eut_left_eu_factors_drop_old_choice_coprime. (eu_factor_index_factors_drop_old) = eut_divisor_eu_factors_drop_old_choice_coprime * eut_left_eu_factors_drop_old_choice_coprime) -> (exists eut_right_eu_factors_drop_old_choice_coprime. (m) = eut_divisor_eu_factors_drop_old_choice_coprime * eut_right_eu_factors_drop_old_choice_coprime) -> eut_divisor_eu_factors_drop_old_choice_coprime = 1) /\ (eu_factor_value_factors_drop_old)=1)))) -> (forall eu_factor_index_factors_drop_new. (exists eut_gap_eu_factors_drop_new_index. eut_gap_eu_factors_drop_new_index + S (eu_factor_index_factors_drop_new) = (l)) -> exists eu_factor_value_factors_drop_new. (((exists fs_h_eu_factors_drop_new_at. fs_h_eu_factors_drop_new_at + S (eu_factor_value_factors_drop_new) = S ((S (eu_factor_index_factors_drop_new)) * c)) /\ exists fs_q_eu_factors_drop_new_at. b = fs_q_eu_factors_drop_new_at * S ((S (eu_factor_index_factors_drop_new)) * c) + (eu_factor_value_factors_drop_new))) /\ ((((forall eut_divisor_eu_factors_drop_new_choice_coprime. (exists eut_left_eu_factors_drop_new_choice_coprime. (eu_factor_index_factors_drop_new) = eut_divisor_eu_factors_drop_new_choice_coprime * eut_left_eu_factors_drop_new_choice_coprime) -> (exists eut_right_eu_factors_drop_new_choice_coprime. (m) = eut_divisor_eu_factors_drop_new_choice_coprime * eut_right_eu_factors_drop_new_choice_coprime) -> eut_divisor_eu_factors_drop_new_choice_coprime = 1) /\ (eu_factor_value_factors_drop_new)=(eu_factor_index_factors_drop_new)) \/ (~(forall eut_divisor_eu_factors_drop_new_choice_coprime. (exists eut_left_eu_factors_drop_new_choice_coprime. (eu_factor_index_factors_drop_new) = eut_divisor_eu_factors_drop_new_choice_coprime * eut_left_eu_factors_drop_new_choice_coprime) -> (exists eut_right_eu_factors_drop_new_choice_coprime. (m) = eut_divisor_eu_factors_drop_new_choice_coprime * eut_right_eu_factors_drop_new_choice_coprime) -> eut_divisor_eu_factors_drop_new_choice_coprime = 1) /\ (eu_factor_value_factors_drop_new)=1))))
euler_unit_product_prefix_entry
read theorem
Bundle node 197; exact statement SHA-256 cde130018d9fe14836650745f70eae3cc5588c7d7b998b2b0f72b4c4b28cd41e
Exact first-order statement
forall m b c l i v. (forall eu_factor_index_factors_entry. (exists eut_gap_eu_factors_entry_index. eut_gap_eu_factors_entry_index + S (eu_factor_index_factors_entry) = (l)) -> exists eu_factor_value_factors_entry. (((exists fs_h_eu_factors_entry_at. fs_h_eu_factors_entry_at + S (eu_factor_value_factors_entry) = S ((S (eu_factor_index_factors_entry)) * c)) /\ exists fs_q_eu_factors_entry_at. b = fs_q_eu_factors_entry_at * S ((S (eu_factor_index_factors_entry)) * c) + (eu_factor_value_factors_entry))) /\ ((((forall eut_divisor_eu_factors_entry_choice_coprime. (exists eut_left_eu_factors_entry_choice_coprime. (eu_factor_index_factors_entry) = eut_divisor_eu_factors_entry_choice_coprime * eut_left_eu_factors_entry_choice_coprime) -> (exists eut_right_eu_factors_entry_choice_coprime. (m) = eut_divisor_eu_factors_entry_choice_coprime * eut_right_eu_factors_entry_choice_coprime) -> eut_divisor_eu_factors_entry_choice_coprime = 1) /\ (eu_factor_value_factors_entry)=(eu_factor_index_factors_entry)) \/ (~(forall eut_divisor_eu_factors_entry_choice_coprime. (exists eut_left_eu_factors_entry_choice_coprime. (eu_factor_index_factors_entry) = eut_divisor_eu_factors_entry_choice_coprime * eut_left_eu_factors_entry_choice_coprime) -> (exists eut_right_eu_factors_entry_choice_coprime. (m) = eut_divisor_eu_factors_entry_choice_coprime * eut_right_eu_factors_entry_choice_coprime) -> eut_divisor_eu_factors_entry_choice_coprime = 1) /\ (eu_factor_value_factors_entry)=1)))) -> (exists eut_gap_eu_factor_entry_bound. eut_gap_eu_factor_entry_bound + S (i) = (l)) -> (((exists fs_h_eu_factor_entry_given. fs_h_eu_factor_entry_given + S (v) = S ((S (i)) * c)) /\ exists fs_q_eu_factor_entry_given. b = fs_q_eu_factor_entry_given * S ((S (i)) * c) + (v))) -> ((((forall eut_divisor_eu_factor_entry_coprime. (exists eut_left_eu_factor_entry_coprime. (i) = eut_divisor_eu_factor_entry_coprime * eut_left_eu_factor_entry_coprime) -> (exists eut_right_eu_factor_entry_coprime. (m) = eut_divisor_eu_factor_entry_coprime * eut_right_eu_factor_entry_coprime) -> eut_divisor_eu_factor_entry_coprime = 1) /\ (v)=(i)) \/ (~(forall eut_divisor_eu_factor_entry_coprime. (exists eut_left_eu_factor_entry_coprime. (i) = eut_divisor_eu_factor_entry_coprime * eut_left_eu_factor_entry_coprime) -> (exists eut_right_eu_factor_entry_coprime. (m) = eut_divisor_eu_factor_entry_coprime * eut_right_eu_factor_entry_coprime) -> eut_divisor_eu_factor_entry_coprime = 1) /\ (v)=1)))
euler_unit_product_coprime
read theorem
Bundle node 198; exact statement SHA-256 d916c0ca5702f2b839e086c3921bc113ea614f0eb2564ab86f034bc8c1ae39d6
Exact first-order statement
forall l m b c P. (forall eu_factor_index_product_coprime_factors. (exists eut_gap_eu_product_coprime_factors_index. eut_gap_eu_product_coprime_factors_index + S (eu_factor_index_product_coprime_factors) = (l)) -> exists eu_factor_value_product_coprime_factors. (((exists fs_h_eu_product_coprime_factors_at. fs_h_eu_product_coprime_factors_at + S (eu_factor_value_product_coprime_factors) = S ((S (eu_factor_index_product_coprime_factors)) * c)) /\ exists fs_q_eu_product_coprime_factors_at. b = fs_q_eu_product_coprime_factors_at * S ((S (eu_factor_index_product_coprime_factors)) * c) + (eu_factor_value_product_coprime_factors))) /\ ((((forall eut_divisor_eu_product_coprime_factors_choice_coprime. (exists eut_left_eu_product_coprime_factors_choice_coprime. (eu_factor_index_product_coprime_factors) = eut_divisor_eu_product_coprime_factors_choice_coprime * eut_left_eu_product_coprime_factors_choice_coprime) -> (exists eut_right_eu_product_coprime_factors_choice_coprime. (m) = eut_divisor_eu_product_coprime_factors_choice_coprime * eut_right_eu_product_coprime_factors_choice_coprime) -> eut_divisor_eu_product_coprime_factors_choice_coprime = 1) /\ (eu_factor_value_product_coprime_factors)=(eu_factor_index_product_coprime_factors)) \/ (~(forall eut_divisor_eu_product_coprime_factors_choice_coprime. (exists eut_left_eu_product_coprime_factors_choice_coprime. (eu_factor_index_product_coprime_factors) = eut_divisor_eu_product_coprime_factors_choice_coprime * eut_left_eu_product_coprime_factors_choice_coprime) -> (exists eut_right_eu_product_coprime_factors_choice_coprime. (m) = eut_divisor_eu_product_coprime_factors_choice_coprime * eut_right_eu_product_coprime_factors_choice_coprime) -> eut_divisor_eu_product_coprime_factors_choice_coprime = 1) /\ (eu_factor_value_product_coprime_factors)=1)))) -> (exists ff_u_fsat_eu_product_coprime ff_v_fsat_eu_product_coprime. ((((exists ff_h_fsat_eu_product_coprime_start. ff_h_fsat_eu_product_coprime_start + S (1) = S ((S (0)) * ff_v_fsat_eu_product_coprime)) /\ exists ff_q_fsat_eu_product_coprime_start. ff_u_fsat_eu_product_coprime = ff_q_fsat_eu_product_coprime_start * S ((S (0)) * ff_v_fsat_eu_product_coprime) + (1))) /\ ((((exists ff_h_fsat_eu_product_coprime_terminal. ff_h_fsat_eu_product_coprime_terminal + S (P) = S ((S (l)) * ff_v_fsat_eu_product_coprime)) /\ exists ff_q_fsat_eu_product_coprime_terminal. ff_u_fsat_eu_product_coprime = ff_q_fsat_eu_product_coprime_terminal * S ((S (l)) * ff_v_fsat_eu_product_coprime) + (P))) /\ forall ff_i_fsat_eu_product_coprime. (exists ff_lt_fsat_eu_product_coprime_bound. ff_lt_fsat_eu_product_coprime_bound + S ff_i_fsat_eu_product_coprime = l) -> exists ff_p_fsat_eu_product_coprime ff_r_fsat_eu_product_coprime ff_s_fsat_eu_product_coprime. ((((exists ff_h_fsat_eu_product_coprime_factor. ff_h_fsat_eu_product_coprime_factor + S (ff_p_fsat_eu_product_coprime) = S ((S (ff_i_fsat_eu_product_coprime)) * c)) /\ exists ff_q_fsat_eu_product_coprime_factor. b = ff_q_fsat_eu_product_coprime_factor * S ((S (ff_i_fsat_eu_product_coprime)) * c) + (ff_p_fsat_eu_product_coprime))) /\ ((((exists ff_h_fsat_eu_product_coprime_partial. ff_h_fsat_eu_product_coprime_partial + S (ff_r_fsat_eu_product_coprime) = S ((S (ff_i_fsat_eu_product_coprime)) * ff_v_fsat_eu_product_coprime)) /\ exists ff_q_fsat_eu_product_coprime_partial. ff_u_fsat_eu_product_coprime = ff_q_fsat_eu_product_coprime_partial * S ((S (ff_i_fsat_eu_product_coprime)) * ff_v_fsat_eu_product_coprime) + (ff_r_fsat_eu_product_coprime))) /\ ((((exists ff_h_fsat_eu_product_coprime_successor. ff_h_fsat_eu_product_coprime_successor + S (ff_s_fsat_eu_product_coprime) = S ((S (S ff_i_fsat_eu_product_coprime)) * ff_v_fsat_eu_product_coprime)) /\ exists ff_q_fsat_eu_product_coprime_successor. ff_u_fsat_eu_product_coprime = ff_q_fsat_eu_product_coprime_successor * S ((S (S ff_i_fsat_eu_product_coprime)) * ff_v_fsat_eu_product_coprime) + (ff_s_fsat_eu_product_coprime))) /\ ff_s_fsat_eu_product_coprime = ff_r_fsat_eu_product_coprime * ff_p_fsat_eu_product_coprime)))))) -> (forall eut_divisor_eu_product_coprime. (exists eut_left_eu_product_coprime. (P) = eut_divisor_eu_product_coprime * eut_left_eu_product_coprime) -> (exists eut_right_eu_product_coprime. (m) = eut_divisor_eu_product_coprime * eut_right_eu_product_coprime) -> eut_divisor_eu_product_coprime = 1)
euler_unit_factor_scaled_congruence
read theorem
Bundle node 199; exact statement SHA-256 74d6703066307aa5051b402474ee0f77ca6cf55b18889ccced90a986544e56c4
Exact first-order statement
forall a m i r u v. (forall eut_divisor_eu_scale_multiplier. (exists eut_left_eu_scale_multiplier. (a) = eut_divisor_eu_scale_multiplier * eut_left_eu_scale_multiplier) -> (exists eut_right_eu_scale_multiplier. (m) = eut_divisor_eu_scale_multiplier * eut_right_eu_scale_multiplier) -> eut_divisor_eu_scale_multiplier = 1) -> (exists eu_mod_left_scale_residue eu_mod_right_scale_residue. (a*i) + (m) * eu_mod_left_scale_residue = (r) + (m) * eu_mod_right_scale_residue) -> ((((forall eut_divisor_eu_scale_source_coprime. (exists eut_left_eu_scale_source_coprime. (i) = eut_divisor_eu_scale_source_coprime * eut_left_eu_scale_source_coprime) -> (exists eut_right_eu_scale_source_coprime. (m) = eut_divisor_eu_scale_source_coprime * eut_right_eu_scale_source_coprime) -> eut_divisor_eu_scale_source_coprime = 1) /\ (u)=(i)) \/ (~(forall eut_divisor_eu_scale_source_coprime. (exists eut_left_eu_scale_source_coprime. (i) = eut_divisor_eu_scale_source_coprime * eut_left_eu_scale_source_coprime) -> (exists eut_right_eu_scale_source_coprime. (m) = eut_divisor_eu_scale_source_coprime * eut_right_eu_scale_source_coprime) -> eut_divisor_eu_scale_source_coprime = 1) /\ (u)=1))) -> ((((forall eut_divisor_eu_scale_target_coprime. (exists eut_left_eu_scale_target_coprime. (r) = eut_divisor_eu_scale_target_coprime * eut_left_eu_scale_target_coprime) -> (exists eut_right_eu_scale_target_coprime. (m) = eut_divisor_eu_scale_target_coprime * eut_right_eu_scale_target_coprime) -> eut_divisor_eu_scale_target_coprime = 1) /\ (v)=(r)) \/ (~(forall eut_divisor_eu_scale_target_coprime. (exists eut_left_eu_scale_target_coprime. (r) = eut_divisor_eu_scale_target_coprime * eut_left_eu_scale_target_coprime) -> (exists eut_right_eu_scale_target_coprime. (m) = eut_divisor_eu_scale_target_coprime * eut_right_eu_scale_target_coprime) -> eut_divisor_eu_scale_target_coprime = 1) /\ (v)=1))) -> (forall eut_divisor_eu_scale_index_unit. (exists eut_left_eu_scale_index_unit. (i) = eut_divisor_eu_scale_index_unit * eut_left_eu_scale_index_unit) -> (exists eut_right_eu_scale_index_unit. (m) = eut_divisor_eu_scale_index_unit * eut_right_eu_scale_index_unit) -> eut_divisor_eu_scale_index_unit = 1) -> (exists eu_mod_left_scale_result eu_mod_right_scale_result. (a*u) + (m) * eu_mod_left_scale_result = (v) + (m) * eu_mod_right_scale_result)
euler_nonunit_factor_unchanged_congruence
read theorem
Bundle node 200; exact statement SHA-256 7877925743897554942af46b999efcba072ee5a494d05a0cbe22bb3bd019f448
Exact first-order statement
forall a m i r u v. (forall eut_divisor_eu_no_scale_multiplier. (exists eut_left_eu_no_scale_multiplier. (a) = eut_divisor_eu_no_scale_multiplier * eut_left_eu_no_scale_multiplier) -> (exists eut_right_eu_no_scale_multiplier. (m) = eut_divisor_eu_no_scale_multiplier * eut_right_eu_no_scale_multiplier) -> eut_divisor_eu_no_scale_multiplier = 1) -> (exists eu_mod_left_no_scale_residue eu_mod_right_no_scale_residue. (a*i) + (m) * eu_mod_left_no_scale_residue = (r) + (m) * eu_mod_right_no_scale_residue) -> ((((forall eut_divisor_eu_no_scale_source_coprime. (exists eut_left_eu_no_scale_source_coprime. (i) = eut_divisor_eu_no_scale_source_coprime * eut_left_eu_no_scale_source_coprime) -> (exists eut_right_eu_no_scale_source_coprime. (m) = eut_divisor_eu_no_scale_source_coprime * eut_right_eu_no_scale_source_coprime) -> eut_divisor_eu_no_scale_source_coprime = 1) /\ (u)=(i)) \/ (~(forall eut_divisor_eu_no_scale_source_coprime. (exists eut_left_eu_no_scale_source_coprime. (i) = eut_divisor_eu_no_scale_source_coprime * eut_left_eu_no_scale_source_coprime) -> (exists eut_right_eu_no_scale_source_coprime. (m) = eut_divisor_eu_no_scale_source_coprime * eut_right_eu_no_scale_source_coprime) -> eut_divisor_eu_no_scale_source_coprime = 1) /\ (u)=1))) -> ((((forall eut_divisor_eu_no_scale_target_coprime. (exists eut_left_eu_no_scale_target_coprime. (r) = eut_divisor_eu_no_scale_target_coprime * eut_left_eu_no_scale_target_coprime) -> (exists eut_right_eu_no_scale_target_coprime. (m) = eut_divisor_eu_no_scale_target_coprime * eut_right_eu_no_scale_target_coprime) -> eut_divisor_eu_no_scale_target_coprime = 1) /\ (v)=(r)) \/ (~(forall eut_divisor_eu_no_scale_target_coprime. (exists eut_left_eu_no_scale_target_coprime. (r) = eut_divisor_eu_no_scale_target_coprime * eut_left_eu_no_scale_target_coprime) -> (exists eut_right_eu_no_scale_target_coprime. (m) = eut_divisor_eu_no_scale_target_coprime * eut_right_eu_no_scale_target_coprime) -> eut_divisor_eu_no_scale_target_coprime = 1) /\ (v)=1))) -> ~(forall eut_divisor_eu_no_scale_index. (exists eut_left_eu_no_scale_index. (i) = eut_divisor_eu_no_scale_index * eut_left_eu_no_scale_index) -> (exists eut_right_eu_no_scale_index. (m) = eut_divisor_eu_no_scale_index * eut_right_eu_no_scale_index) -> eut_divisor_eu_no_scale_index = 1) -> (exists eu_mod_left_no_scale_result eu_mod_right_no_scale_result. (u) + (m) * eu_mod_left_no_scale_result = (v) + (m) * eu_mod_right_no_scale_result)
euler_unit_scaled_prefix_drop_last
read theorem
Bundle node 201; exact statement SHA-256 ee71d6a86b08a8c02a5e75164d7249fd034e668ced74ed4f3b36587a1a77b02e
Exact first-order statement
forall a m b c d e l. (forall eu_scale_index_scale_drop_old eu_scale_source_scale_drop_old eu_scale_target_scale_drop_old. (exists eut_gap_eu_scale_drop_old_index. eut_gap_eu_scale_drop_old_index + S (eu_scale_index_scale_drop_old) = (S l)) -> (((exists fs_h_eu_scale_drop_old_source. fs_h_eu_scale_drop_old_source + S (eu_scale_source_scale_drop_old) = S ((S (eu_scale_index_scale_drop_old)) * c)) /\ exists fs_q_eu_scale_drop_old_source. b = fs_q_eu_scale_drop_old_source * S ((S (eu_scale_index_scale_drop_old)) * c) + (eu_scale_source_scale_drop_old))) -> (((exists fs_h_eu_scale_drop_old_target. fs_h_eu_scale_drop_old_target + S (eu_scale_target_scale_drop_old) = S ((S (eu_scale_index_scale_drop_old)) * e)) /\ exists fs_q_eu_scale_drop_old_target. d = fs_q_eu_scale_drop_old_target * S ((S (eu_scale_index_scale_drop_old)) * e) + (eu_scale_target_scale_drop_old))) -> (((forall eut_divisor_eu_scale_drop_old_unit. (exists eut_left_eu_scale_drop_old_unit. (eu_scale_index_scale_drop_old) = eut_divisor_eu_scale_drop_old_unit * eut_left_eu_scale_drop_old_unit) -> (exists eut_right_eu_scale_drop_old_unit. (m) = eut_divisor_eu_scale_drop_old_unit * eut_right_eu_scale_drop_old_unit) -> eut_divisor_eu_scale_drop_old_unit = 1) -> (exists eu_mod_left_scale_drop_old_scaled eu_mod_right_scale_drop_old_scaled. ((a)*eu_scale_source_scale_drop_old) + (m) * eu_mod_left_scale_drop_old_scaled = (eu_scale_target_scale_drop_old) + (m) * eu_mod_right_scale_drop_old_scaled)) /\ (~(forall eut_divisor_eu_scale_drop_old_unit. (exists eut_left_eu_scale_drop_old_unit. (eu_scale_index_scale_drop_old) = eut_divisor_eu_scale_drop_old_unit * eut_left_eu_scale_drop_old_unit) -> (exists eut_right_eu_scale_drop_old_unit. (m) = eut_divisor_eu_scale_drop_old_unit * eut_right_eu_scale_drop_old_unit) -> eut_divisor_eu_scale_drop_old_unit = 1) -> (exists eu_mod_left_scale_drop_old_unchanged eu_mod_right_scale_drop_old_unchanged. (eu_scale_source_scale_drop_old) + (m) * eu_mod_left_scale_drop_old_unchanged = (eu_scale_target_scale_drop_old) + (m) * eu_mod_right_scale_drop_old_unchanged)))) -> (forall eu_scale_index_scale_drop_new eu_scale_source_scale_drop_new eu_scale_target_scale_drop_new. (exists eut_gap_eu_scale_drop_new_index. eut_gap_eu_scale_drop_new_index + S (eu_scale_index_scale_drop_new) = (l)) -> (((exists fs_h_eu_scale_drop_new_source. fs_h_eu_scale_drop_new_source + S (eu_scale_source_scale_drop_new) = S ((S (eu_scale_index_scale_drop_new)) * c)) /\ exists fs_q_eu_scale_drop_new_source. b = fs_q_eu_scale_drop_new_source * S ((S (eu_scale_index_scale_drop_new)) * c) + (eu_scale_source_scale_drop_new))) -> (((exists fs_h_eu_scale_drop_new_target. fs_h_eu_scale_drop_new_target + S (eu_scale_target_scale_drop_new) = S ((S (eu_scale_index_scale_drop_new)) * e)) /\ exists fs_q_eu_scale_drop_new_target. d = fs_q_eu_scale_drop_new_target * S ((S (eu_scale_index_scale_drop_new)) * e) + (eu_scale_target_scale_drop_new))) -> (((forall eut_divisor_eu_scale_drop_new_unit. (exists eut_left_eu_scale_drop_new_unit. (eu_scale_index_scale_drop_new) = eut_divisor_eu_scale_drop_new_unit * eut_left_eu_scale_drop_new_unit) -> (exists eut_right_eu_scale_drop_new_unit. (m) = eut_divisor_eu_scale_drop_new_unit * eut_right_eu_scale_drop_new_unit) -> eut_divisor_eu_scale_drop_new_unit = 1) -> (exists eu_mod_left_scale_drop_new_scaled eu_mod_right_scale_drop_new_scaled. ((a)*eu_scale_source_scale_drop_new) + (m) * eu_mod_left_scale_drop_new_scaled = (eu_scale_target_scale_drop_new) + (m) * eu_mod_right_scale_drop_new_scaled)) /\ (~(forall eut_divisor_eu_scale_drop_new_unit. (exists eut_left_eu_scale_drop_new_unit. (eu_scale_index_scale_drop_new) = eut_divisor_eu_scale_drop_new_unit * eut_left_eu_scale_drop_new_unit) -> (exists eut_right_eu_scale_drop_new_unit. (m) = eut_divisor_eu_scale_drop_new_unit * eut_right_eu_scale_drop_new_unit) -> eut_divisor_eu_scale_drop_new_unit = 1) -> (exists eu_mod_left_scale_drop_new_unchanged eu_mod_right_scale_drop_new_unchanged. (eu_scale_source_scale_drop_new) + (m) * eu_mod_left_scale_drop_new_unchanged = (eu_scale_target_scale_drop_new) + (m) * eu_mod_right_scale_drop_new_unchanged))))
euler_unit_product_reindex_scale
read theorem
Bundle node 202; exact statement SHA-256 391ddd7444ca43df4a15af4adf699dd2e6394fdb26ef4fad2e88a3bcc3d3c374
Exact first-order statement
forall a m r s b c z d. (forall eut_divisor_eu_reindex_unit. (exists eut_left_eu_reindex_unit. (a) = eut_divisor_eu_reindex_unit * eut_left_eu_reindex_unit) -> (exists eut_right_eu_reindex_unit. (m) = eut_divisor_eu_reindex_unit * eut_right_eu_reindex_unit) -> eut_divisor_eu_reindex_unit = 1) -> (forall eu_index_reindex_map. (exists eut_gap_eu_reindex_map_index. eut_gap_eu_reindex_map_index + S (eu_index_reindex_map) = (m)) -> exists eu_residue_reindex_map. (((exists fs_h_eu_reindex_map_at. fs_h_eu_reindex_map_at + S (eu_residue_reindex_map) = S ((S (eu_index_reindex_map)) * s)) /\ exists fs_q_eu_reindex_map_at. r = fs_q_eu_reindex_map_at * S ((S (eu_index_reindex_map)) * s) + (eu_residue_reindex_map))) /\ ((exists eut_gap_eu_reindex_map_bound. eut_gap_eu_reindex_map_bound + S (eu_residue_reindex_map) = (m)) /\ (exists eu_mod_left_reindex_map_mod eu_mod_right_reindex_map_mod. ((a)*eu_index_reindex_map) + (m) * eu_mod_left_reindex_map_mod = (eu_residue_reindex_map) + (m) * eu_mod_right_reindex_map_mod))) -> (forall eu_factor_index_reindex_factors. (exists eut_gap_eu_reindex_factors_index. eut_gap_eu_reindex_factors_index + S (eu_factor_index_reindex_factors) = (m)) -> exists eu_factor_value_reindex_factors. (((exists fs_h_eu_reindex_factors_at. fs_h_eu_reindex_factors_at + S (eu_factor_value_reindex_factors) = S ((S (eu_factor_index_reindex_factors)) * c)) /\ exists fs_q_eu_reindex_factors_at. b = fs_q_eu_reindex_factors_at * S ((S (eu_factor_index_reindex_factors)) * c) + (eu_factor_value_reindex_factors))) /\ ((((forall eut_divisor_eu_reindex_factors_choice_coprime. (exists eut_left_eu_reindex_factors_choice_coprime. (eu_factor_index_reindex_factors) = eut_divisor_eu_reindex_factors_choice_coprime * eut_left_eu_reindex_factors_choice_coprime) -> (exists eut_right_eu_reindex_factors_choice_coprime. (m) = eut_divisor_eu_reindex_factors_choice_coprime * eut_right_eu_reindex_factors_choice_coprime) -> eut_divisor_eu_reindex_factors_choice_coprime = 1) /\ (eu_factor_value_reindex_factors)=(eu_factor_index_reindex_factors)) \/ (~(forall eut_divisor_eu_reindex_factors_choice_coprime. (exists eut_left_eu_reindex_factors_choice_coprime. (eu_factor_index_reindex_factors) = eut_divisor_eu_reindex_factors_choice_coprime * eut_left_eu_reindex_factors_choice_coprime) -> (exists eut_right_eu_reindex_factors_choice_coprime. (m) = eut_divisor_eu_reindex_factors_choice_coprime * eut_right_eu_reindex_factors_choice_coprime) -> eut_divisor_eu_reindex_factors_choice_coprime = 1) /\ (eu_factor_value_reindex_factors)=1)))) -> (forall fms_i_eu_reindex_composition fms_j_eu_reindex_composition fms_v_eu_reindex_composition. (exists fms_gap_eu_reindex_composition. fms_gap_eu_reindex_composition + S (fms_i_eu_reindex_composition) = (m)) -> (((exists fs_h_fms_eu_reindex_composition_index. fs_h_fms_eu_reindex_composition_index + S (fms_j_eu_reindex_composition) = S ((S (fms_i_eu_reindex_composition)) * s)) /\ exists fs_q_fms_eu_reindex_composition_index. r = fs_q_fms_eu_reindex_composition_index * S ((S (fms_i_eu_reindex_composition)) * s) + (fms_j_eu_reindex_composition))) -> (((exists fs_h_fms_eu_reindex_composition_source. fs_h_fms_eu_reindex_composition_source + S (fms_v_eu_reindex_composition) = S ((S (fms_j_eu_reindex_composition)) * c)) /\ exists fs_q_fms_eu_reindex_composition_source. b = fs_q_fms_eu_reindex_composition_source * S ((S (fms_j_eu_reindex_composition)) * c) + (fms_v_eu_reindex_composition))) -> (((exists fs_h_fms_eu_reindex_composition_target. fs_h_fms_eu_reindex_composition_target + S (fms_v_eu_reindex_composition) = S ((S (fms_i_eu_reindex_composition)) * d)) /\ exists fs_q_fms_eu_reindex_composition_target. z = fs_q_fms_eu_reindex_composition_target * S ((S (fms_i_eu_reindex_composition)) * d) + (fms_v_eu_reindex_composition)))) -> (forall eu_scale_index_reindex_scale eu_scale_source_reindex_scale eu_scale_target_reindex_scale. (exists eut_gap_eu_reindex_scale_index. eut_gap_eu_reindex_scale_index + S (eu_scale_index_reindex_scale) = (m)) -> (((exists fs_h_eu_reindex_scale_source. fs_h_eu_reindex_scale_source + S (eu_scale_source_reindex_scale) = S ((S (eu_scale_index_reindex_scale)) * c)) /\ exists fs_q_eu_reindex_scale_source. b = fs_q_eu_reindex_scale_source * S ((S (eu_scale_index_reindex_scale)) * c) + (eu_scale_source_reindex_scale))) -> (((exists fs_h_eu_reindex_scale_target. fs_h_eu_reindex_scale_target + S (eu_scale_target_reindex_scale) = S ((S (eu_scale_index_reindex_scale)) * d)) /\ exists fs_q_eu_reindex_scale_target. z = fs_q_eu_reindex_scale_target * S ((S (eu_scale_index_reindex_scale)) * d) + (eu_scale_target_reindex_scale))) -> (((forall eut_divisor_eu_reindex_scale_unit. (exists eut_left_eu_reindex_scale_unit. (eu_scale_index_reindex_scale) = eut_divisor_eu_reindex_scale_unit * eut_left_eu_reindex_scale_unit) -> (exists eut_right_eu_reindex_scale_unit. (m) = eut_divisor_eu_reindex_scale_unit * eut_right_eu_reindex_scale_unit) -> eut_divisor_eu_reindex_scale_unit = 1) -> (exists eu_mod_left_reindex_scale_scaled eu_mod_right_reindex_scale_scaled. ((a)*eu_scale_source_reindex_scale) + (m) * eu_mod_left_reindex_scale_scaled = (eu_scale_target_reindex_scale) + (m) * eu_mod_right_reindex_scale_scaled)) /\ (~(forall eut_divisor_eu_reindex_scale_unit. (exists eut_left_eu_reindex_scale_unit. (eu_scale_index_reindex_scale) = eut_divisor_eu_reindex_scale_unit * eut_left_eu_reindex_scale_unit) -> (exists eut_right_eu_reindex_scale_unit. (m) = eut_divisor_eu_reindex_scale_unit * eut_right_eu_reindex_scale_unit) -> eut_divisor_eu_reindex_scale_unit = 1) -> (exists eu_mod_left_reindex_scale_unchanged eu_mod_right_reindex_scale_unchanged. (eu_scale_source_reindex_scale) + (m) * eu_mod_left_reindex_scale_unchanged = (eu_scale_target_reindex_scale) + (m) * eu_mod_right_reindex_scale_unchanged))))
euler_coprime_weighted_product_cancel
read theorem
Bundle node 203; exact statement SHA-256 d11e2c14bfdc12464ac540d1414e627c4159a010ddb46d7c019f971fd2f4fc36
Exact first-order statement
forall m P w. ~(m=0) -> (forall eut_divisor_eu_cancel_product. (exists eut_left_eu_cancel_product. (P) = eut_divisor_eu_cancel_product * eut_left_eu_cancel_product) -> (exists eut_right_eu_cancel_product. (m) = eut_divisor_eu_cancel_product * eut_right_eu_cancel_product) -> eut_divisor_eu_cancel_product = 1) -> (exists eu_mod_left_cancel_balance eu_mod_right_cancel_balance. (w*P) + (m) * eu_mod_left_cancel_balance = (P) + (m) * eu_mod_right_cancel_balance) -> (exists eu_mod_left_cancel_result eu_mod_right_cancel_result. (w) + (m) * eu_mod_left_cancel_result = (1) + (m) * eu_mod_right_cancel_result)
euler_unit_count_product_balance
read theorem
Bundle node 204; exact statement SHA-256 a3514f1c5b92ba0b29541eb681b313f98d01a910aa26f25044e29fc13ebc6fbd
Exact first-order statement
forall l a m b c d e t P Q w. (exists eut_code_eu_balance_count eut_scale_eu_balance_count. (forall eut_index_eu_balance_count_mask. (exists eut_gap_eu_balance_count_mask_bound. eut_gap_eu_balance_count_mask_bound + S (eut_index_eu_balance_count_mask) = (l)) -> exists eut_bit_eu_balance_count_mask. (((exists fs_h_eut_eu_balance_count_mask_entry. fs_h_eut_eu_balance_count_mask_entry + S (eut_bit_eu_balance_count_mask) = S ((S (eut_index_eu_balance_count_mask)) * eut_scale_eu_balance_count)) /\ exists fs_q_eut_eu_balance_count_mask_entry. eut_code_eu_balance_count = fs_q_eut_eu_balance_count_mask_entry * S ((S (eut_index_eu_balance_count_mask)) * eut_scale_eu_balance_count) + (eut_bit_eu_balance_count_mask))) /\ ((((forall eut_divisor_eu_balance_count_mask_choice_coprime. (exists eut_left_eu_balance_count_mask_choice_coprime. (eut_index_eu_balance_count_mask) = eut_divisor_eu_balance_count_mask_choice_coprime * eut_left_eu_balance_count_mask_choice_coprime) -> (exists eut_right_eu_balance_count_mask_choice_coprime. (m) = eut_divisor_eu_balance_count_mask_choice_coprime * eut_right_eu_balance_count_mask_choice_coprime) -> eut_divisor_eu_balance_count_mask_choice_coprime = 1) /\ (eut_bit_eu_balance_count_mask) = 1) \/ (~(forall eut_divisor_eu_balance_count_mask_choice_coprime. (exists eut_left_eu_balance_count_mask_choice_coprime. (eut_index_eu_balance_count_mask) = eut_divisor_eu_balance_count_mask_choice_coprime * eut_left_eu_balance_count_mask_choice_coprime) -> (exists eut_right_eu_balance_count_mask_choice_coprime. (m) = eut_divisor_eu_balance_count_mask_choice_coprime * eut_right_eu_balance_count_mask_choice_coprime) -> eut_divisor_eu_balance_count_mask_choice_coprime = 1) /\ (eut_bit_eu_balance_count_mask) = 0)))) /\ (exists fs_u_eut_eu_balance_count_sum fs_v_eut_eu_balance_count_sum. ((((exists fs_h_eut_eu_balance_count_sum_body_start. fs_h_eut_eu_balance_count_sum_body_start + S (0) = S ((S (0)) * fs_v_eut_eu_balance_count_sum)) /\ exists fs_q_eut_eu_balance_count_sum_body_start. fs_u_eut_eu_balance_count_sum = fs_q_eut_eu_balance_count_sum_body_start * S ((S (0)) * fs_v_eut_eu_balance_count_sum) + (0))) /\ ((((exists fs_h_eut_eu_balance_count_sum_body_terminal. fs_h_eut_eu_balance_count_sum_body_terminal + S (t) = S ((S (l)) * fs_v_eut_eu_balance_count_sum)) /\ exists fs_q_eut_eu_balance_count_sum_body_terminal. fs_u_eut_eu_balance_count_sum = fs_q_eut_eu_balance_count_sum_body_terminal * S ((S (l)) * fs_v_eut_eu_balance_count_sum) + (t))) /\ forall fs_i_eut_eu_balance_count_sum_body_steps. (exists fs_lt_eut_eu_balance_count_sum_body_steps_bound. fs_lt_eut_eu_balance_count_sum_body_steps_bound + S fs_i_eut_eu_balance_count_sum_body_steps = l) -> exists fs_a_eut_eu_balance_count_sum_body_steps fs_r_eut_eu_balance_count_sum_body_steps fs_s_eut_eu_balance_count_sum_body_steps. ((((exists fs_h_eut_eu_balance_count_sum_body_steps_summand. fs_h_eut_eu_balance_count_sum_body_steps_summand + S (fs_a_eut_eu_balance_count_sum_body_steps) = S ((S (fs_i_eut_eu_balance_count_sum_body_steps)) * eut_scale_eu_balance_count)) /\ exists fs_q_eut_eu_balance_count_sum_body_steps_summand. eut_code_eu_balance_count = fs_q_eut_eu_balance_count_sum_body_steps_summand * S ((S (fs_i_eut_eu_balance_count_sum_body_steps)) * eut_scale_eu_balance_count) + (fs_a_eut_eu_balance_count_sum_body_steps))) /\ ((((exists fs_h_eut_eu_balance_count_sum_body_steps_partial. fs_h_eut_eu_balance_count_sum_body_steps_partial + S (fs_r_eut_eu_balance_count_sum_body_steps) = S ((S (fs_i_eut_eu_balance_count_sum_body_steps)) * fs_v_eut_eu_balance_count_sum)) /\ exists fs_q_eut_eu_balance_count_sum_body_steps_partial. fs_u_eut_eu_balance_count_sum = fs_q_eut_eu_balance_count_sum_body_steps_partial * S ((S (fs_i_eut_eu_balance_count_sum_body_steps)) * fs_v_eut_eu_balance_count_sum) + (fs_r_eut_eu_balance_count_sum_body_steps))) /\ ((((exists fs_h_eut_eu_balance_count_sum_body_steps_successor. fs_h_eut_eu_balance_count_sum_body_steps_successor + S (fs_s_eut_eu_balance_count_sum_body_steps) = S ((S (S fs_i_eut_eu_balance_count_sum_body_steps)) * fs_v_eut_eu_balance_count_sum)) /\ exists fs_q_eut_eu_balance_count_sum_body_steps_successor. fs_u_eut_eu_balance_count_sum = fs_q_eut_eu_balance_count_sum_body_steps_successor * S ((S (S fs_i_eut_eu_balance_count_sum_body_steps)) * fs_v_eut_eu_balance_count_sum) + (fs_s_eut_eu_balance_count_sum_body_steps))) /\ fs_s_eut_eu_balance_count_sum_body_steps = fs_r_eut_eu_balance_count_sum_body_steps + fs_a_eut_eu_balance_count_sum_body_steps))))))) -> (forall eu_scale_index_balance_scale eu_scale_source_balance_scale eu_scale_target_balance_scale. (exists eut_gap_eu_balance_scale_index. eut_gap_eu_balance_scale_index + S (eu_scale_index_balance_scale) = (l)) -> (((exists fs_h_eu_balance_scale_source. fs_h_eu_balance_scale_source + S (eu_scale_source_balance_scale) = S ((S (eu_scale_index_balance_scale)) * c)) /\ exists fs_q_eu_balance_scale_source. b = fs_q_eu_balance_scale_source * S ((S (eu_scale_index_balance_scale)) * c) + (eu_scale_source_balance_scale))) -> (((exists fs_h_eu_balance_scale_target. fs_h_eu_balance_scale_target + S (eu_scale_target_balance_scale) = S ((S (eu_scale_index_balance_scale)) * e)) /\ exists fs_q_eu_balance_scale_target. d = fs_q_eu_balance_scale_target * S ((S (eu_scale_index_balance_scale)) * e) + (eu_scale_target_balance_scale))) -> (((forall eut_divisor_eu_balance_scale_unit. (exists eut_left_eu_balance_scale_unit. (eu_scale_index_balance_scale) = eut_divisor_eu_balance_scale_unit * eut_left_eu_balance_scale_unit) -> (exists eut_right_eu_balance_scale_unit. (m) = eut_divisor_eu_balance_scale_unit * eut_right_eu_balance_scale_unit) -> eut_divisor_eu_balance_scale_unit = 1) -> (exists eu_mod_left_balance_scale_scaled eu_mod_right_balance_scale_scaled. ((a)*eu_scale_source_balance_scale) + (m) * eu_mod_left_balance_scale_scaled = (eu_scale_target_balance_scale) + (m) * eu_mod_right_balance_scale_scaled)) /\ (~(forall eut_divisor_eu_balance_scale_unit. (exists eut_left_eu_balance_scale_unit. (eu_scale_index_balance_scale) = eut_divisor_eu_balance_scale_unit * eut_left_eu_balance_scale_unit) -> (exists eut_right_eu_balance_scale_unit. (m) = eut_divisor_eu_balance_scale_unit * eut_right_eu_balance_scale_unit) -> eut_divisor_eu_balance_scale_unit = 1) -> (exists eu_mod_left_balance_scale_unchanged eu_mod_right_balance_scale_unchanged. (eu_scale_source_balance_scale) + (m) * eu_mod_left_balance_scale_unchanged = (eu_scale_target_balance_scale) + (m) * eu_mod_right_balance_scale_unchanged)))) -> (exists ff_u_fsat_eu_balance_source ff_v_fsat_eu_balance_source. ((((exists ff_h_fsat_eu_balance_source_start. ff_h_fsat_eu_balance_source_start + S (1) = S ((S (0)) * ff_v_fsat_eu_balance_source)) /\ exists ff_q_fsat_eu_balance_source_start. ff_u_fsat_eu_balance_source = ff_q_fsat_eu_balance_source_start * S ((S (0)) * ff_v_fsat_eu_balance_source) + (1))) /\ ((((exists ff_h_fsat_eu_balance_source_terminal. ff_h_fsat_eu_balance_source_terminal + S (P) = S ((S (l)) * ff_v_fsat_eu_balance_source)) /\ exists ff_q_fsat_eu_balance_source_terminal. ff_u_fsat_eu_balance_source = ff_q_fsat_eu_balance_source_terminal * S ((S (l)) * ff_v_fsat_eu_balance_source) + (P))) /\ forall ff_i_fsat_eu_balance_source. (exists ff_lt_fsat_eu_balance_source_bound. ff_lt_fsat_eu_balance_source_bound + S ff_i_fsat_eu_balance_source = l) -> exists ff_p_fsat_eu_balance_source ff_r_fsat_eu_balance_source ff_s_fsat_eu_balance_source. ((((exists ff_h_fsat_eu_balance_source_factor. ff_h_fsat_eu_balance_source_factor + S (ff_p_fsat_eu_balance_source) = S ((S (ff_i_fsat_eu_balance_source)) * c)) /\ exists ff_q_fsat_eu_balance_source_factor. b = ff_q_fsat_eu_balance_source_factor * S ((S (ff_i_fsat_eu_balance_source)) * c) + (ff_p_fsat_eu_balance_source))) /\ ((((exists ff_h_fsat_eu_balance_source_partial. ff_h_fsat_eu_balance_source_partial + S (ff_r_fsat_eu_balance_source) = S ((S (ff_i_fsat_eu_balance_source)) * ff_v_fsat_eu_balance_source)) /\ exists ff_q_fsat_eu_balance_source_partial. ff_u_fsat_eu_balance_source = ff_q_fsat_eu_balance_source_partial * S ((S (ff_i_fsat_eu_balance_source)) * ff_v_fsat_eu_balance_source) + (ff_r_fsat_eu_balance_source))) /\ ((((exists ff_h_fsat_eu_balance_source_successor. ff_h_fsat_eu_balance_source_successor + S (ff_s_fsat_eu_balance_source) = S ((S (S ff_i_fsat_eu_balance_source)) * ff_v_fsat_eu_balance_source)) /\ exists ff_q_fsat_eu_balance_source_successor. ff_u_fsat_eu_balance_source = ff_q_fsat_eu_balance_source_successor * S ((S (S ff_i_fsat_eu_balance_source)) * ff_v_fsat_eu_balance_source) + (ff_s_fsat_eu_balance_source))) /\ ff_s_fsat_eu_balance_source = ff_r_fsat_eu_balance_source * ff_p_fsat_eu_balance_source)))))) -> (exists ff_u_fsat_eu_balance_target ff_v_fsat_eu_balance_target. ((((exists ff_h_fsat_eu_balance_target_start. ff_h_fsat_eu_balance_target_start + S (1) = S ((S (0)) * ff_v_fsat_eu_balance_target)) /\ exists ff_q_fsat_eu_balance_target_start. ff_u_fsat_eu_balance_target = ff_q_fsat_eu_balance_target_start * S ((S (0)) * ff_v_fsat_eu_balance_target) + (1))) /\ ((((exists ff_h_fsat_eu_balance_target_terminal. ff_h_fsat_eu_balance_target_terminal + S (Q) = S ((S (l)) * ff_v_fsat_eu_balance_target)) /\ exists ff_q_fsat_eu_balance_target_terminal. ff_u_fsat_eu_balance_target = ff_q_fsat_eu_balance_target_terminal * S ((S (l)) * ff_v_fsat_eu_balance_target) + (Q))) /\ forall ff_i_fsat_eu_balance_target. (exists ff_lt_fsat_eu_balance_target_bound. ff_lt_fsat_eu_balance_target_bound + S ff_i_fsat_eu_balance_target = l) -> exists ff_p_fsat_eu_balance_target ff_r_fsat_eu_balance_target ff_s_fsat_eu_balance_target. ((((exists ff_h_fsat_eu_balance_target_factor. ff_h_fsat_eu_balance_target_factor + S (ff_p_fsat_eu_balance_target) = S ((S (ff_i_fsat_eu_balance_target)) * e)) /\ exists ff_q_fsat_eu_balance_target_factor. d = ff_q_fsat_eu_balance_target_factor * S ((S (ff_i_fsat_eu_balance_target)) * e) + (ff_p_fsat_eu_balance_target))) /\ ((((exists ff_h_fsat_eu_balance_target_partial. ff_h_fsat_eu_balance_target_partial + S (ff_r_fsat_eu_balance_target) = S ((S (ff_i_fsat_eu_balance_target)) * ff_v_fsat_eu_balance_target)) /\ exists ff_q_fsat_eu_balance_target_partial. ff_u_fsat_eu_balance_target = ff_q_fsat_eu_balance_target_partial * S ((S (ff_i_fsat_eu_balance_target)) * ff_v_fsat_eu_balance_target) + (ff_r_fsat_eu_balance_target))) /\ ((((exists ff_h_fsat_eu_balance_target_successor. ff_h_fsat_eu_balance_target_successor + S (ff_s_fsat_eu_balance_target) = S ((S (S ff_i_fsat_eu_balance_target)) * ff_v_fsat_eu_balance_target)) /\ exists ff_q_fsat_eu_balance_target_successor. ff_u_fsat_eu_balance_target = ff_q_fsat_eu_balance_target_successor * S ((S (S ff_i_fsat_eu_balance_target)) * ff_v_fsat_eu_balance_target) + (ff_s_fsat_eu_balance_target))) /\ ff_s_fsat_eu_balance_target = ff_r_fsat_eu_balance_target * ff_p_fsat_eu_balance_target)))))) -> (exists pa_b_euta_eu_balance_power pa_c_euta_eu_balance_power. ((forall pa_i_euta_eu_balance_power_repeat. (exists pa_lt_euta_eu_balance_power_repeat_bound. pa_lt_euta_eu_balance_power_repeat_bound + S pa_i_euta_eu_balance_power_repeat = t) -> (((exists pa_h_euta_eu_balance_power_repeat_decoded. pa_h_euta_eu_balance_power_repeat_decoded + S (a) = S ((S (pa_i_euta_eu_balance_power_repeat)) * pa_c_euta_eu_balance_power)) /\ exists pa_q_euta_eu_balance_power_repeat_decoded. pa_b_euta_eu_balance_power = pa_q_euta_eu_balance_power_repeat_decoded * S ((S (pa_i_euta_eu_balance_power_repeat)) * pa_c_euta_eu_balance_power) + (a)))) /\ (exists pa_u_euta_eu_balance_power_product pa_v_euta_eu_balance_power_product. ((((exists pa_h_euta_eu_balance_power_product_start. pa_h_euta_eu_balance_power_product_start + S (1) = S ((S (0)) * pa_v_euta_eu_balance_power_product)) /\ exists pa_q_euta_eu_balance_power_product_start. pa_u_euta_eu_balance_power_product = pa_q_euta_eu_balance_power_product_start * S ((S (0)) * pa_v_euta_eu_balance_power_product) + (1))) /\ ((((exists pa_h_euta_eu_balance_power_product_terminal. pa_h_euta_eu_balance_power_product_terminal + S (w) = S ((S (t)) * pa_v_euta_eu_balance_power_product)) /\ exists pa_q_euta_eu_balance_power_product_terminal. pa_u_euta_eu_balance_power_product = pa_q_euta_eu_balance_power_product_terminal * S ((S (t)) * pa_v_euta_eu_balance_power_product) + (w))) /\ forall pa_i_euta_eu_balance_power_product. (exists pa_lt_euta_eu_balance_power_product_bound. pa_lt_euta_eu_balance_power_product_bound + S pa_i_euta_eu_balance_power_product = t) -> exists pa_p_euta_eu_balance_power_product pa_r_euta_eu_balance_power_product pa_s_euta_eu_balance_power_product. ((((exists pa_h_euta_eu_balance_power_product_factor. pa_h_euta_eu_balance_power_product_factor + S (pa_p_euta_eu_balance_power_product) = S ((S (pa_i_euta_eu_balance_power_product)) * pa_c_euta_eu_balance_power)) /\ exists pa_q_euta_eu_balance_power_product_factor. pa_b_euta_eu_balance_power = pa_q_euta_eu_balance_power_product_factor * S ((S (pa_i_euta_eu_balance_power_product)) * pa_c_euta_eu_balance_power) + (pa_p_euta_eu_balance_power_product))) /\ ((((exists pa_h_euta_eu_balance_power_product_partial. pa_h_euta_eu_balance_power_product_partial + S (pa_r_euta_eu_balance_power_product) = S ((S (pa_i_euta_eu_balance_power_product)) * pa_v_euta_eu_balance_power_product)) /\ exists pa_q_euta_eu_balance_power_product_partial. pa_u_euta_eu_balance_power_product = pa_q_euta_eu_balance_power_product_partial * S ((S (pa_i_euta_eu_balance_power_product)) * pa_v_euta_eu_balance_power_product) + (pa_r_euta_eu_balance_power_product))) /\ ((((exists pa_h_euta_eu_balance_power_product_successor. pa_h_euta_eu_balance_power_product_successor + S (pa_s_euta_eu_balance_power_product) = S ((S (S pa_i_euta_eu_balance_power_product)) * pa_v_euta_eu_balance_power_product)) /\ exists pa_q_euta_eu_balance_power_product_successor. pa_u_euta_eu_balance_power_product = pa_q_euta_eu_balance_power_product_successor * S ((S (S pa_i_euta_eu_balance_power_product)) * pa_v_euta_eu_balance_power_product) + (pa_s_euta_eu_balance_power_product))) /\ pa_s_euta_eu_balance_power_product = pa_r_euta_eu_balance_power_product * pa_p_euta_eu_balance_power_product)))))))) -> (exists eu_mod_left_balance_result eu_mod_right_balance_result. (w*P) + (m) * eu_mod_left_balance_result = (Q) + (m) * eu_mod_right_balance_result)
euler_coprime_totient_power_value
read theorem
Bundle node 205; exact statement SHA-256 62401bc3ae6050ed789b54eb3028512546c4c3f927f19bda5ca6ce77dc293f55
Exact first-order statement
forall a m t w. ~(m=0) -> (forall eut_divisor_eu_endpoint_coprime. (exists eut_left_eu_endpoint_coprime. (a) = eut_divisor_eu_endpoint_coprime * eut_left_eu_endpoint_coprime) -> (exists eut_right_eu_endpoint_coprime. (m) = eut_divisor_eu_endpoint_coprime * eut_right_eu_endpoint_coprime) -> eut_divisor_eu_endpoint_coprime = 1) -> ((~((m)=0) /\ (exists eut_code_eu_endpoint_phi_count eut_scale_eu_endpoint_phi_count. (forall eut_index_eu_endpoint_phi_count_mask. (exists eut_gap_eu_endpoint_phi_count_mask_bound. eut_gap_eu_endpoint_phi_count_mask_bound + S (eut_index_eu_endpoint_phi_count_mask) = (m)) -> exists eut_bit_eu_endpoint_phi_count_mask. (((exists fs_h_eut_eu_endpoint_phi_count_mask_entry. fs_h_eut_eu_endpoint_phi_count_mask_entry + S (eut_bit_eu_endpoint_phi_count_mask) = S ((S (eut_index_eu_endpoint_phi_count_mask)) * eut_scale_eu_endpoint_phi_count)) /\ exists fs_q_eut_eu_endpoint_phi_count_mask_entry. eut_code_eu_endpoint_phi_count = fs_q_eut_eu_endpoint_phi_count_mask_entry * S ((S (eut_index_eu_endpoint_phi_count_mask)) * eut_scale_eu_endpoint_phi_count) + (eut_bit_eu_endpoint_phi_count_mask))) /\ ((((forall eut_divisor_eu_endpoint_phi_count_mask_choice_coprime. (exists eut_left_eu_endpoint_phi_count_mask_choice_coprime. (eut_index_eu_endpoint_phi_count_mask) = eut_divisor_eu_endpoint_phi_count_mask_choice_coprime * eut_left_eu_endpoint_phi_count_mask_choice_coprime) -> (exists eut_right_eu_endpoint_phi_count_mask_choice_coprime. (m) = eut_divisor_eu_endpoint_phi_count_mask_choice_coprime * eut_right_eu_endpoint_phi_count_mask_choice_coprime) -> eut_divisor_eu_endpoint_phi_count_mask_choice_coprime = 1) /\ (eut_bit_eu_endpoint_phi_count_mask) = 1) \/ (~(forall eut_divisor_eu_endpoint_phi_count_mask_choice_coprime. (exists eut_left_eu_endpoint_phi_count_mask_choice_coprime. (eut_index_eu_endpoint_phi_count_mask) = eut_divisor_eu_endpoint_phi_count_mask_choice_coprime * eut_left_eu_endpoint_phi_count_mask_choice_coprime) -> (exists eut_right_eu_endpoint_phi_count_mask_choice_coprime. (m) = eut_divisor_eu_endpoint_phi_count_mask_choice_coprime * eut_right_eu_endpoint_phi_count_mask_choice_coprime) -> eut_divisor_eu_endpoint_phi_count_mask_choice_coprime = 1) /\ (eut_bit_eu_endpoint_phi_count_mask) = 0)))) /\ (exists fs_u_eut_eu_endpoint_phi_count_sum fs_v_eut_eu_endpoint_phi_count_sum. ((((exists fs_h_eut_eu_endpoint_phi_count_sum_body_start. fs_h_eut_eu_endpoint_phi_count_sum_body_start + S (0) = S ((S (0)) * fs_v_eut_eu_endpoint_phi_count_sum)) /\ exists fs_q_eut_eu_endpoint_phi_count_sum_body_start. fs_u_eut_eu_endpoint_phi_count_sum = fs_q_eut_eu_endpoint_phi_count_sum_body_start * S ((S (0)) * fs_v_eut_eu_endpoint_phi_count_sum) + (0))) /\ ((((exists fs_h_eut_eu_endpoint_phi_count_sum_body_terminal. fs_h_eut_eu_endpoint_phi_count_sum_body_terminal + S (t) = S ((S (m)) * fs_v_eut_eu_endpoint_phi_count_sum)) /\ exists fs_q_eut_eu_endpoint_phi_count_sum_body_terminal. fs_u_eut_eu_endpoint_phi_count_sum = fs_q_eut_eu_endpoint_phi_count_sum_body_terminal * S ((S (m)) * fs_v_eut_eu_endpoint_phi_count_sum) + (t))) /\ forall fs_i_eut_eu_endpoint_phi_count_sum_body_steps. (exists fs_lt_eut_eu_endpoint_phi_count_sum_body_steps_bound. fs_lt_eut_eu_endpoint_phi_count_sum_body_steps_bound + S fs_i_eut_eu_endpoint_phi_count_sum_body_steps = m) -> exists fs_a_eut_eu_endpoint_phi_count_sum_body_steps fs_r_eut_eu_endpoint_phi_count_sum_body_steps fs_s_eut_eu_endpoint_phi_count_sum_body_steps. ((((exists fs_h_eut_eu_endpoint_phi_count_sum_body_steps_summand. fs_h_eut_eu_endpoint_phi_count_sum_body_steps_summand + S (fs_a_eut_eu_endpoint_phi_count_sum_body_steps) = S ((S (fs_i_eut_eu_endpoint_phi_count_sum_body_steps)) * eut_scale_eu_endpoint_phi_count)) /\ exists fs_q_eut_eu_endpoint_phi_count_sum_body_steps_summand. eut_code_eu_endpoint_phi_count = fs_q_eut_eu_endpoint_phi_count_sum_body_steps_summand * S ((S (fs_i_eut_eu_endpoint_phi_count_sum_body_steps)) * eut_scale_eu_endpoint_phi_count) + (fs_a_eut_eu_endpoint_phi_count_sum_body_steps))) /\ ((((exists fs_h_eut_eu_endpoint_phi_count_sum_body_steps_partial. fs_h_eut_eu_endpoint_phi_count_sum_body_steps_partial + S (fs_r_eut_eu_endpoint_phi_count_sum_body_steps) = S ((S (fs_i_eut_eu_endpoint_phi_count_sum_body_steps)) * fs_v_eut_eu_endpoint_phi_count_sum)) /\ exists fs_q_eut_eu_endpoint_phi_count_sum_body_steps_partial. fs_u_eut_eu_endpoint_phi_count_sum = fs_q_eut_eu_endpoint_phi_count_sum_body_steps_partial * S ((S (fs_i_eut_eu_endpoint_phi_count_sum_body_steps)) * fs_v_eut_eu_endpoint_phi_count_sum) + (fs_r_eut_eu_endpoint_phi_count_sum_body_steps))) /\ ((((exists fs_h_eut_eu_endpoint_phi_count_sum_body_steps_successor. fs_h_eut_eu_endpoint_phi_count_sum_body_steps_successor + S (fs_s_eut_eu_endpoint_phi_count_sum_body_steps) = S ((S (S fs_i_eut_eu_endpoint_phi_count_sum_body_steps)) * fs_v_eut_eu_endpoint_phi_count_sum)) /\ exists fs_q_eut_eu_endpoint_phi_count_sum_body_steps_successor. fs_u_eut_eu_endpoint_phi_count_sum = fs_q_eut_eu_endpoint_phi_count_sum_body_steps_successor * S ((S (S fs_i_eut_eu_endpoint_phi_count_sum_body_steps)) * fs_v_eut_eu_endpoint_phi_count_sum) + (fs_s_eut_eu_endpoint_phi_count_sum_body_steps))) /\ fs_s_eut_eu_endpoint_phi_count_sum_body_steps = fs_r_eut_eu_endpoint_phi_count_sum_body_steps + fs_a_eut_eu_endpoint_phi_count_sum_body_steps))))))))) -> (exists pa_b_euta_eu_endpoint_power pa_c_euta_eu_endpoint_power. ((forall pa_i_euta_eu_endpoint_power_repeat. (exists pa_lt_euta_eu_endpoint_power_repeat_bound. pa_lt_euta_eu_endpoint_power_repeat_bound + S pa_i_euta_eu_endpoint_power_repeat = t) -> (((exists pa_h_euta_eu_endpoint_power_repeat_decoded. pa_h_euta_eu_endpoint_power_repeat_decoded + S (a) = S ((S (pa_i_euta_eu_endpoint_power_repeat)) * pa_c_euta_eu_endpoint_power)) /\ exists pa_q_euta_eu_endpoint_power_repeat_decoded. pa_b_euta_eu_endpoint_power = pa_q_euta_eu_endpoint_power_repeat_decoded * S ((S (pa_i_euta_eu_endpoint_power_repeat)) * pa_c_euta_eu_endpoint_power) + (a)))) /\ (exists pa_u_euta_eu_endpoint_power_product pa_v_euta_eu_endpoint_power_product. ((((exists pa_h_euta_eu_endpoint_power_product_start. pa_h_euta_eu_endpoint_power_product_start + S (1) = S ((S (0)) * pa_v_euta_eu_endpoint_power_product)) /\ exists pa_q_euta_eu_endpoint_power_product_start. pa_u_euta_eu_endpoint_power_product = pa_q_euta_eu_endpoint_power_product_start * S ((S (0)) * pa_v_euta_eu_endpoint_power_product) + (1))) /\ ((((exists pa_h_euta_eu_endpoint_power_product_terminal. pa_h_euta_eu_endpoint_power_product_terminal + S (w) = S ((S (t)) * pa_v_euta_eu_endpoint_power_product)) /\ exists pa_q_euta_eu_endpoint_power_product_terminal. pa_u_euta_eu_endpoint_power_product = pa_q_euta_eu_endpoint_power_product_terminal * S ((S (t)) * pa_v_euta_eu_endpoint_power_product) + (w))) /\ forall pa_i_euta_eu_endpoint_power_product. (exists pa_lt_euta_eu_endpoint_power_product_bound. pa_lt_euta_eu_endpoint_power_product_bound + S pa_i_euta_eu_endpoint_power_product = t) -> exists pa_p_euta_eu_endpoint_power_product pa_r_euta_eu_endpoint_power_product pa_s_euta_eu_endpoint_power_product. ((((exists pa_h_euta_eu_endpoint_power_product_factor. pa_h_euta_eu_endpoint_power_product_factor + S (pa_p_euta_eu_endpoint_power_product) = S ((S (pa_i_euta_eu_endpoint_power_product)) * pa_c_euta_eu_endpoint_power)) /\ exists pa_q_euta_eu_endpoint_power_product_factor. pa_b_euta_eu_endpoint_power = pa_q_euta_eu_endpoint_power_product_factor * S ((S (pa_i_euta_eu_endpoint_power_product)) * pa_c_euta_eu_endpoint_power) + (pa_p_euta_eu_endpoint_power_product))) /\ ((((exists pa_h_euta_eu_endpoint_power_product_partial. pa_h_euta_eu_endpoint_power_product_partial + S (pa_r_euta_eu_endpoint_power_product) = S ((S (pa_i_euta_eu_endpoint_power_product)) * pa_v_euta_eu_endpoint_power_product)) /\ exists pa_q_euta_eu_endpoint_power_product_partial. pa_u_euta_eu_endpoint_power_product = pa_q_euta_eu_endpoint_power_product_partial * S ((S (pa_i_euta_eu_endpoint_power_product)) * pa_v_euta_eu_endpoint_power_product) + (pa_r_euta_eu_endpoint_power_product))) /\ ((((exists pa_h_euta_eu_endpoint_power_product_successor. pa_h_euta_eu_endpoint_power_product_successor + S (pa_s_euta_eu_endpoint_power_product) = S ((S (S pa_i_euta_eu_endpoint_power_product)) * pa_v_euta_eu_endpoint_power_product)) /\ exists pa_q_euta_eu_endpoint_power_product_successor. pa_u_euta_eu_endpoint_power_product = pa_q_euta_eu_endpoint_power_product_successor * S ((S (S pa_i_euta_eu_endpoint_power_product)) * pa_v_euta_eu_endpoint_power_product) + (pa_s_euta_eu_endpoint_power_product))) /\ pa_s_euta_eu_endpoint_power_product = pa_r_euta_eu_endpoint_power_product * pa_p_euta_eu_endpoint_power_product)))))))) -> (exists eu_mod_left_endpoint_result eu_mod_right_endpoint_result. (w) + (m) * eu_mod_left_endpoint_result = (1) + (m) * eu_mod_right_endpoint_result)
euler_coprime_totient_power
read theorem
Bundle node 206; exact statement SHA-256 4f3533b3d207055a1f56ca77655cf26a381735fa3999f34a0a2c7935a21497e4
Exact first-order statement
forall a m t. ~(m=0) -> (forall eut_divisor_eu_exists_coprime. (exists eut_left_eu_exists_coprime. (a) = eut_divisor_eu_exists_coprime * eut_left_eu_exists_coprime) -> (exists eut_right_eu_exists_coprime. (m) = eut_divisor_eu_exists_coprime * eut_right_eu_exists_coprime) -> eut_divisor_eu_exists_coprime = 1) -> ((~((m)=0) /\ (exists eut_code_eu_exists_phi_count eut_scale_eu_exists_phi_count. (forall eut_index_eu_exists_phi_count_mask. (exists eut_gap_eu_exists_phi_count_mask_bound. eut_gap_eu_exists_phi_count_mask_bound + S (eut_index_eu_exists_phi_count_mask) = (m)) -> exists eut_bit_eu_exists_phi_count_mask. (((exists fs_h_eut_eu_exists_phi_count_mask_entry. fs_h_eut_eu_exists_phi_count_mask_entry + S (eut_bit_eu_exists_phi_count_mask) = S ((S (eut_index_eu_exists_phi_count_mask)) * eut_scale_eu_exists_phi_count)) /\ exists fs_q_eut_eu_exists_phi_count_mask_entry. eut_code_eu_exists_phi_count = fs_q_eut_eu_exists_phi_count_mask_entry * S ((S (eut_index_eu_exists_phi_count_mask)) * eut_scale_eu_exists_phi_count) + (eut_bit_eu_exists_phi_count_mask))) /\ ((((forall eut_divisor_eu_exists_phi_count_mask_choice_coprime. (exists eut_left_eu_exists_phi_count_mask_choice_coprime. (eut_index_eu_exists_phi_count_mask) = eut_divisor_eu_exists_phi_count_mask_choice_coprime * eut_left_eu_exists_phi_count_mask_choice_coprime) -> (exists eut_right_eu_exists_phi_count_mask_choice_coprime. (m) = eut_divisor_eu_exists_phi_count_mask_choice_coprime * eut_right_eu_exists_phi_count_mask_choice_coprime) -> eut_divisor_eu_exists_phi_count_mask_choice_coprime = 1) /\ (eut_bit_eu_exists_phi_count_mask) = 1) \/ (~(forall eut_divisor_eu_exists_phi_count_mask_choice_coprime. (exists eut_left_eu_exists_phi_count_mask_choice_coprime. (eut_index_eu_exists_phi_count_mask) = eut_divisor_eu_exists_phi_count_mask_choice_coprime * eut_left_eu_exists_phi_count_mask_choice_coprime) -> (exists eut_right_eu_exists_phi_count_mask_choice_coprime. (m) = eut_divisor_eu_exists_phi_count_mask_choice_coprime * eut_right_eu_exists_phi_count_mask_choice_coprime) -> eut_divisor_eu_exists_phi_count_mask_choice_coprime = 1) /\ (eut_bit_eu_exists_phi_count_mask) = 0)))) /\ (exists fs_u_eut_eu_exists_phi_count_sum fs_v_eut_eu_exists_phi_count_sum. ((((exists fs_h_eut_eu_exists_phi_count_sum_body_start. fs_h_eut_eu_exists_phi_count_sum_body_start + S (0) = S ((S (0)) * fs_v_eut_eu_exists_phi_count_sum)) /\ exists fs_q_eut_eu_exists_phi_count_sum_body_start. fs_u_eut_eu_exists_phi_count_sum = fs_q_eut_eu_exists_phi_count_sum_body_start * S ((S (0)) * fs_v_eut_eu_exists_phi_count_sum) + (0))) /\ ((((exists fs_h_eut_eu_exists_phi_count_sum_body_terminal. fs_h_eut_eu_exists_phi_count_sum_body_terminal + S (t) = S ((S (m)) * fs_v_eut_eu_exists_phi_count_sum)) /\ exists fs_q_eut_eu_exists_phi_count_sum_body_terminal. fs_u_eut_eu_exists_phi_count_sum = fs_q_eut_eu_exists_phi_count_sum_body_terminal * S ((S (m)) * fs_v_eut_eu_exists_phi_count_sum) + (t))) /\ forall fs_i_eut_eu_exists_phi_count_sum_body_steps. (exists fs_lt_eut_eu_exists_phi_count_sum_body_steps_bound. fs_lt_eut_eu_exists_phi_count_sum_body_steps_bound + S fs_i_eut_eu_exists_phi_count_sum_body_steps = m) -> exists fs_a_eut_eu_exists_phi_count_sum_body_steps fs_r_eut_eu_exists_phi_count_sum_body_steps fs_s_eut_eu_exists_phi_count_sum_body_steps. ((((exists fs_h_eut_eu_exists_phi_count_sum_body_steps_summand. fs_h_eut_eu_exists_phi_count_sum_body_steps_summand + S (fs_a_eut_eu_exists_phi_count_sum_body_steps) = S ((S (fs_i_eut_eu_exists_phi_count_sum_body_steps)) * eut_scale_eu_exists_phi_count)) /\ exists fs_q_eut_eu_exists_phi_count_sum_body_steps_summand. eut_code_eu_exists_phi_count = fs_q_eut_eu_exists_phi_count_sum_body_steps_summand * S ((S (fs_i_eut_eu_exists_phi_count_sum_body_steps)) * eut_scale_eu_exists_phi_count) + (fs_a_eut_eu_exists_phi_count_sum_body_steps))) /\ ((((exists fs_h_eut_eu_exists_phi_count_sum_body_steps_partial. fs_h_eut_eu_exists_phi_count_sum_body_steps_partial + S (fs_r_eut_eu_exists_phi_count_sum_body_steps) = S ((S (fs_i_eut_eu_exists_phi_count_sum_body_steps)) * fs_v_eut_eu_exists_phi_count_sum)) /\ exists fs_q_eut_eu_exists_phi_count_sum_body_steps_partial. fs_u_eut_eu_exists_phi_count_sum = fs_q_eut_eu_exists_phi_count_sum_body_steps_partial * S ((S (fs_i_eut_eu_exists_phi_count_sum_body_steps)) * fs_v_eut_eu_exists_phi_count_sum) + (fs_r_eut_eu_exists_phi_count_sum_body_steps))) /\ ((((exists fs_h_eut_eu_exists_phi_count_sum_body_steps_successor. fs_h_eut_eu_exists_phi_count_sum_body_steps_successor + S (fs_s_eut_eu_exists_phi_count_sum_body_steps) = S ((S (S fs_i_eut_eu_exists_phi_count_sum_body_steps)) * fs_v_eut_eu_exists_phi_count_sum)) /\ exists fs_q_eut_eu_exists_phi_count_sum_body_steps_successor. fs_u_eut_eu_exists_phi_count_sum = fs_q_eut_eu_exists_phi_count_sum_body_steps_successor * S ((S (S fs_i_eut_eu_exists_phi_count_sum_body_steps)) * fs_v_eut_eu_exists_phi_count_sum) + (fs_s_eut_eu_exists_phi_count_sum_body_steps))) /\ fs_s_eut_eu_exists_phi_count_sum_body_steps = fs_r_eut_eu_exists_phi_count_sum_body_steps + fs_a_eut_eu_exists_phi_count_sum_body_steps))))))))) -> exists w. (exists pa_b_euta_eu_exists_power pa_c_euta_eu_exists_power. ((forall pa_i_euta_eu_exists_power_repeat. (exists pa_lt_euta_eu_exists_power_repeat_bound. pa_lt_euta_eu_exists_power_repeat_bound + S pa_i_euta_eu_exists_power_repeat = t) -> (((exists pa_h_euta_eu_exists_power_repeat_decoded. pa_h_euta_eu_exists_power_repeat_decoded + S (a) = S ((S (pa_i_euta_eu_exists_power_repeat)) * pa_c_euta_eu_exists_power)) /\ exists pa_q_euta_eu_exists_power_repeat_decoded. pa_b_euta_eu_exists_power = pa_q_euta_eu_exists_power_repeat_decoded * S ((S (pa_i_euta_eu_exists_power_repeat)) * pa_c_euta_eu_exists_power) + (a)))) /\ (exists pa_u_euta_eu_exists_power_product pa_v_euta_eu_exists_power_product. ((((exists pa_h_euta_eu_exists_power_product_start. pa_h_euta_eu_exists_power_product_start + S (1) = S ((S (0)) * pa_v_euta_eu_exists_power_product)) /\ exists pa_q_euta_eu_exists_power_product_start. pa_u_euta_eu_exists_power_product = pa_q_euta_eu_exists_power_product_start * S ((S (0)) * pa_v_euta_eu_exists_power_product) + (1))) /\ ((((exists pa_h_euta_eu_exists_power_product_terminal. pa_h_euta_eu_exists_power_product_terminal + S (w) = S ((S (t)) * pa_v_euta_eu_exists_power_product)) /\ exists pa_q_euta_eu_exists_power_product_terminal. pa_u_euta_eu_exists_power_product = pa_q_euta_eu_exists_power_product_terminal * S ((S (t)) * pa_v_euta_eu_exists_power_product) + (w))) /\ forall pa_i_euta_eu_exists_power_product. (exists pa_lt_euta_eu_exists_power_product_bound. pa_lt_euta_eu_exists_power_product_bound + S pa_i_euta_eu_exists_power_product = t) -> exists pa_p_euta_eu_exists_power_product pa_r_euta_eu_exists_power_product pa_s_euta_eu_exists_power_product. ((((exists pa_h_euta_eu_exists_power_product_factor. pa_h_euta_eu_exists_power_product_factor + S (pa_p_euta_eu_exists_power_product) = S ((S (pa_i_euta_eu_exists_power_product)) * pa_c_euta_eu_exists_power)) /\ exists pa_q_euta_eu_exists_power_product_factor. pa_b_euta_eu_exists_power = pa_q_euta_eu_exists_power_product_factor * S ((S (pa_i_euta_eu_exists_power_product)) * pa_c_euta_eu_exists_power) + (pa_p_euta_eu_exists_power_product))) /\ ((((exists pa_h_euta_eu_exists_power_product_partial. pa_h_euta_eu_exists_power_product_partial + S (pa_r_euta_eu_exists_power_product) = S ((S (pa_i_euta_eu_exists_power_product)) * pa_v_euta_eu_exists_power_product)) /\ exists pa_q_euta_eu_exists_power_product_partial. pa_u_euta_eu_exists_power_product = pa_q_euta_eu_exists_power_product_partial * S ((S (pa_i_euta_eu_exists_power_product)) * pa_v_euta_eu_exists_power_product) + (pa_r_euta_eu_exists_power_product))) /\ ((((exists pa_h_euta_eu_exists_power_product_successor. pa_h_euta_eu_exists_power_product_successor + S (pa_s_euta_eu_exists_power_product) = S ((S (S pa_i_euta_eu_exists_power_product)) * pa_v_euta_eu_exists_power_product)) /\ exists pa_q_euta_eu_exists_power_product_successor. pa_u_euta_eu_exists_power_product = pa_q_euta_eu_exists_power_product_successor * S ((S (S pa_i_euta_eu_exists_power_product)) * pa_v_euta_eu_exists_power_product) + (pa_s_euta_eu_exists_power_product))) /\ pa_s_euta_eu_exists_power_product = pa_r_euta_eu_exists_power_product * pa_p_euta_eu_exists_power_product)))))))) /\ (exists eu_mod_left_exists_result eu_mod_right_exists_result. (w) + (m) * eu_mod_left_exists_result = (1) + (m) * eu_mod_right_exists_result)
euler_modular_unit_totient_power
read theorem
Bundle node 207; exact statement SHA-256 9640b53a89a7ed7e2e15db573380a9a7133af60e7ebed2215390034354b4a4d6
Exact first-order statement
forall a m t. ((exists eut_gap_eu_unit_endpoint_domain. eut_gap_eu_unit_endpoint_domain + S (1) = (m)) /\ exists eu_inverse_unit_endpoint. (exists eut_gap_eu_unit_endpoint_bound. eut_gap_eu_unit_endpoint_bound + S (eu_inverse_unit_endpoint) = (m)) /\ (exists eu_mod_left_unit_endpoint_inverse eu_mod_right_unit_endpoint_inverse. ((a)*eu_inverse_unit_endpoint) + (m) * eu_mod_left_unit_endpoint_inverse = (1) + (m) * eu_mod_right_unit_endpoint_inverse)) -> ((~((m)=0) /\ (exists eut_code_eu_unit_endpoint_phi_count eut_scale_eu_unit_endpoint_phi_count. (forall eut_index_eu_unit_endpoint_phi_count_mask. (exists eut_gap_eu_unit_endpoint_phi_count_mask_bound. eut_gap_eu_unit_endpoint_phi_count_mask_bound + S (eut_index_eu_unit_endpoint_phi_count_mask) = (m)) -> exists eut_bit_eu_unit_endpoint_phi_count_mask. (((exists fs_h_eut_eu_unit_endpoint_phi_count_mask_entry. fs_h_eut_eu_unit_endpoint_phi_count_mask_entry + S (eut_bit_eu_unit_endpoint_phi_count_mask) = S ((S (eut_index_eu_unit_endpoint_phi_count_mask)) * eut_scale_eu_unit_endpoint_phi_count)) /\ exists fs_q_eut_eu_unit_endpoint_phi_count_mask_entry. eut_code_eu_unit_endpoint_phi_count = fs_q_eut_eu_unit_endpoint_phi_count_mask_entry * S ((S (eut_index_eu_unit_endpoint_phi_count_mask)) * eut_scale_eu_unit_endpoint_phi_count) + (eut_bit_eu_unit_endpoint_phi_count_mask))) /\ ((((forall eut_divisor_eu_unit_endpoint_phi_count_mask_choice_coprime. (exists eut_left_eu_unit_endpoint_phi_count_mask_choice_coprime. (eut_index_eu_unit_endpoint_phi_count_mask) = eut_divisor_eu_unit_endpoint_phi_count_mask_choice_coprime * eut_left_eu_unit_endpoint_phi_count_mask_choice_coprime) -> (exists eut_right_eu_unit_endpoint_phi_count_mask_choice_coprime. (m) = eut_divisor_eu_unit_endpoint_phi_count_mask_choice_coprime * eut_right_eu_unit_endpoint_phi_count_mask_choice_coprime) -> eut_divisor_eu_unit_endpoint_phi_count_mask_choice_coprime = 1) /\ (eut_bit_eu_unit_endpoint_phi_count_mask) = 1) \/ (~(forall eut_divisor_eu_unit_endpoint_phi_count_mask_choice_coprime. (exists eut_left_eu_unit_endpoint_phi_count_mask_choice_coprime. (eut_index_eu_unit_endpoint_phi_count_mask) = eut_divisor_eu_unit_endpoint_phi_count_mask_choice_coprime * eut_left_eu_unit_endpoint_phi_count_mask_choice_coprime) -> (exists eut_right_eu_unit_endpoint_phi_count_mask_choice_coprime. (m) = eut_divisor_eu_unit_endpoint_phi_count_mask_choice_coprime * eut_right_eu_unit_endpoint_phi_count_mask_choice_coprime) -> eut_divisor_eu_unit_endpoint_phi_count_mask_choice_coprime = 1) /\ (eut_bit_eu_unit_endpoint_phi_count_mask) = 0)))) /\ (exists fs_u_eut_eu_unit_endpoint_phi_count_sum fs_v_eut_eu_unit_endpoint_phi_count_sum. ((((exists fs_h_eut_eu_unit_endpoint_phi_count_sum_body_start. fs_h_eut_eu_unit_endpoint_phi_count_sum_body_start + S (0) = S ((S (0)) * fs_v_eut_eu_unit_endpoint_phi_count_sum)) /\ exists fs_q_eut_eu_unit_endpoint_phi_count_sum_body_start. fs_u_eut_eu_unit_endpoint_phi_count_sum = fs_q_eut_eu_unit_endpoint_phi_count_sum_body_start * S ((S (0)) * fs_v_eut_eu_unit_endpoint_phi_count_sum) + (0))) /\ ((((exists fs_h_eut_eu_unit_endpoint_phi_count_sum_body_terminal. fs_h_eut_eu_unit_endpoint_phi_count_sum_body_terminal + S (t) = S ((S (m)) * fs_v_eut_eu_unit_endpoint_phi_count_sum)) /\ exists fs_q_eut_eu_unit_endpoint_phi_count_sum_body_terminal. fs_u_eut_eu_unit_endpoint_phi_count_sum = fs_q_eut_eu_unit_endpoint_phi_count_sum_body_terminal * S ((S (m)) * fs_v_eut_eu_unit_endpoint_phi_count_sum) + (t))) /\ forall fs_i_eut_eu_unit_endpoint_phi_count_sum_body_steps. (exists fs_lt_eut_eu_unit_endpoint_phi_count_sum_body_steps_bound. fs_lt_eut_eu_unit_endpoint_phi_count_sum_body_steps_bound + S fs_i_eut_eu_unit_endpoint_phi_count_sum_body_steps = m) -> exists fs_a_eut_eu_unit_endpoint_phi_count_sum_body_steps fs_r_eut_eu_unit_endpoint_phi_count_sum_body_steps fs_s_eut_eu_unit_endpoint_phi_count_sum_body_steps. ((((exists fs_h_eut_eu_unit_endpoint_phi_count_sum_body_steps_summand. fs_h_eut_eu_unit_endpoint_phi_count_sum_body_steps_summand + S (fs_a_eut_eu_unit_endpoint_phi_count_sum_body_steps) = S ((S (fs_i_eut_eu_unit_endpoint_phi_count_sum_body_steps)) * eut_scale_eu_unit_endpoint_phi_count)) /\ exists fs_q_eut_eu_unit_endpoint_phi_count_sum_body_steps_summand. eut_code_eu_unit_endpoint_phi_count = fs_q_eut_eu_unit_endpoint_phi_count_sum_body_steps_summand * S ((S (fs_i_eut_eu_unit_endpoint_phi_count_sum_body_steps)) * eut_scale_eu_unit_endpoint_phi_count) + (fs_a_eut_eu_unit_endpoint_phi_count_sum_body_steps))) /\ ((((exists fs_h_eut_eu_unit_endpoint_phi_count_sum_body_steps_partial. fs_h_eut_eu_unit_endpoint_phi_count_sum_body_steps_partial + S (fs_r_eut_eu_unit_endpoint_phi_count_sum_body_steps) = S ((S (fs_i_eut_eu_unit_endpoint_phi_count_sum_body_steps)) * fs_v_eut_eu_unit_endpoint_phi_count_sum)) /\ exists fs_q_eut_eu_unit_endpoint_phi_count_sum_body_steps_partial. fs_u_eut_eu_unit_endpoint_phi_count_sum = fs_q_eut_eu_unit_endpoint_phi_count_sum_body_steps_partial * S ((S (fs_i_eut_eu_unit_endpoint_phi_count_sum_body_steps)) * fs_v_eut_eu_unit_endpoint_phi_count_sum) + (fs_r_eut_eu_unit_endpoint_phi_count_sum_body_steps))) /\ ((((exists fs_h_eut_eu_unit_endpoint_phi_count_sum_body_steps_successor. fs_h_eut_eu_unit_endpoint_phi_count_sum_body_steps_successor + S (fs_s_eut_eu_unit_endpoint_phi_count_sum_body_steps) = S ((S (S fs_i_eut_eu_unit_endpoint_phi_count_sum_body_steps)) * fs_v_eut_eu_unit_endpoint_phi_count_sum)) /\ exists fs_q_eut_eu_unit_endpoint_phi_count_sum_body_steps_successor. fs_u_eut_eu_unit_endpoint_phi_count_sum = fs_q_eut_eu_unit_endpoint_phi_count_sum_body_steps_successor * S ((S (S fs_i_eut_eu_unit_endpoint_phi_count_sum_body_steps)) * fs_v_eut_eu_unit_endpoint_phi_count_sum) + (fs_s_eut_eu_unit_endpoint_phi_count_sum_body_steps))) /\ fs_s_eut_eu_unit_endpoint_phi_count_sum_body_steps = fs_r_eut_eu_unit_endpoint_phi_count_sum_body_steps + fs_a_eut_eu_unit_endpoint_phi_count_sum_body_steps))))))))) -> exists w. (exists pa_b_euta_eu_unit_endpoint_power pa_c_euta_eu_unit_endpoint_power. ((forall pa_i_euta_eu_unit_endpoint_power_repeat. (exists pa_lt_euta_eu_unit_endpoint_power_repeat_bound. pa_lt_euta_eu_unit_endpoint_power_repeat_bound + S pa_i_euta_eu_unit_endpoint_power_repeat = t) -> (((exists pa_h_euta_eu_unit_endpoint_power_repeat_decoded. pa_h_euta_eu_unit_endpoint_power_repeat_decoded + S (a) = S ((S (pa_i_euta_eu_unit_endpoint_power_repeat)) * pa_c_euta_eu_unit_endpoint_power)) /\ exists pa_q_euta_eu_unit_endpoint_power_repeat_decoded. pa_b_euta_eu_unit_endpoint_power = pa_q_euta_eu_unit_endpoint_power_repeat_decoded * S ((S (pa_i_euta_eu_unit_endpoint_power_repeat)) * pa_c_euta_eu_unit_endpoint_power) + (a)))) /\ (exists pa_u_euta_eu_unit_endpoint_power_product pa_v_euta_eu_unit_endpoint_power_product. ((((exists pa_h_euta_eu_unit_endpoint_power_product_start. pa_h_euta_eu_unit_endpoint_power_product_start + S (1) = S ((S (0)) * pa_v_euta_eu_unit_endpoint_power_product)) /\ exists pa_q_euta_eu_unit_endpoint_power_product_start. pa_u_euta_eu_unit_endpoint_power_product = pa_q_euta_eu_unit_endpoint_power_product_start * S ((S (0)) * pa_v_euta_eu_unit_endpoint_power_product) + (1))) /\ ((((exists pa_h_euta_eu_unit_endpoint_power_product_terminal. pa_h_euta_eu_unit_endpoint_power_product_terminal + S (w) = S ((S (t)) * pa_v_euta_eu_unit_endpoint_power_product)) /\ exists pa_q_euta_eu_unit_endpoint_power_product_terminal. pa_u_euta_eu_unit_endpoint_power_product = pa_q_euta_eu_unit_endpoint_power_product_terminal * S ((S (t)) * pa_v_euta_eu_unit_endpoint_power_product) + (w))) /\ forall pa_i_euta_eu_unit_endpoint_power_product. (exists pa_lt_euta_eu_unit_endpoint_power_product_bound. pa_lt_euta_eu_unit_endpoint_power_product_bound + S pa_i_euta_eu_unit_endpoint_power_product = t) -> exists pa_p_euta_eu_unit_endpoint_power_product pa_r_euta_eu_unit_endpoint_power_product pa_s_euta_eu_unit_endpoint_power_product. ((((exists pa_h_euta_eu_unit_endpoint_power_product_factor. pa_h_euta_eu_unit_endpoint_power_product_factor + S (pa_p_euta_eu_unit_endpoint_power_product) = S ((S (pa_i_euta_eu_unit_endpoint_power_product)) * pa_c_euta_eu_unit_endpoint_power)) /\ exists pa_q_euta_eu_unit_endpoint_power_product_factor. pa_b_euta_eu_unit_endpoint_power = pa_q_euta_eu_unit_endpoint_power_product_factor * S ((S (pa_i_euta_eu_unit_endpoint_power_product)) * pa_c_euta_eu_unit_endpoint_power) + (pa_p_euta_eu_unit_endpoint_power_product))) /\ ((((exists pa_h_euta_eu_unit_endpoint_power_product_partial. pa_h_euta_eu_unit_endpoint_power_product_partial + S (pa_r_euta_eu_unit_endpoint_power_product) = S ((S (pa_i_euta_eu_unit_endpoint_power_product)) * pa_v_euta_eu_unit_endpoint_power_product)) /\ exists pa_q_euta_eu_unit_endpoint_power_product_partial. pa_u_euta_eu_unit_endpoint_power_product = pa_q_euta_eu_unit_endpoint_power_product_partial * S ((S (pa_i_euta_eu_unit_endpoint_power_product)) * pa_v_euta_eu_unit_endpoint_power_product) + (pa_r_euta_eu_unit_endpoint_power_product))) /\ ((((exists pa_h_euta_eu_unit_endpoint_power_product_successor. pa_h_euta_eu_unit_endpoint_power_product_successor + S (pa_s_euta_eu_unit_endpoint_power_product) = S ((S (S pa_i_euta_eu_unit_endpoint_power_product)) * pa_v_euta_eu_unit_endpoint_power_product)) /\ exists pa_q_euta_eu_unit_endpoint_power_product_successor. pa_u_euta_eu_unit_endpoint_power_product = pa_q_euta_eu_unit_endpoint_power_product_successor * S ((S (S pa_i_euta_eu_unit_endpoint_power_product)) * pa_v_euta_eu_unit_endpoint_power_product) + (pa_s_euta_eu_unit_endpoint_power_product))) /\ pa_s_euta_eu_unit_endpoint_power_product = pa_r_euta_eu_unit_endpoint_power_product * pa_p_euta_eu_unit_endpoint_power_product)))))))) /\ (exists eu_mod_left_unit_endpoint_result eu_mod_right_unit_endpoint_result. (w) + (m) * eu_mod_left_unit_endpoint_result = (1) + (m) * eu_mod_right_unit_endpoint_result)
euler_theorem_for_units
read theorem
Bundle node 208; exact statement SHA-256 fcfb262cc347ec2cd7624dffba31f9ed519292b3ba5f1669682cee308cbac39d
Exact first-order statement
forall a m t. ((exists eut_gap_eu_G014_domain. eut_gap_eu_G014_domain + S (1) = (m)) /\ (((exists eut_gap_eu_G014_unit_domain. eut_gap_eu_G014_unit_domain + S (1) = (m)) /\ exists eu_inverse_G014_unit. (exists eut_gap_eu_G014_unit_bound. eut_gap_eu_G014_unit_bound + S (eu_inverse_G014_unit) = (m)) /\ (exists eu_mod_left_G014_unit_inverse eu_mod_right_G014_unit_inverse. ((a)*eu_inverse_G014_unit) + (m) * eu_mod_left_G014_unit_inverse = (1) + (m) * eu_mod_right_G014_unit_inverse)) /\ ((~((m)=0) /\ (exists eut_code_eu_G014_phi_count eut_scale_eu_G014_phi_count. (forall eut_index_eu_G014_phi_count_mask. (exists eut_gap_eu_G014_phi_count_mask_bound. eut_gap_eu_G014_phi_count_mask_bound + S (eut_index_eu_G014_phi_count_mask) = (m)) -> exists eut_bit_eu_G014_phi_count_mask. (((exists fs_h_eut_eu_G014_phi_count_mask_entry. fs_h_eut_eu_G014_phi_count_mask_entry + S (eut_bit_eu_G014_phi_count_mask) = S ((S (eut_index_eu_G014_phi_count_mask)) * eut_scale_eu_G014_phi_count)) /\ exists fs_q_eut_eu_G014_phi_count_mask_entry. eut_code_eu_G014_phi_count = fs_q_eut_eu_G014_phi_count_mask_entry * S ((S (eut_index_eu_G014_phi_count_mask)) * eut_scale_eu_G014_phi_count) + (eut_bit_eu_G014_phi_count_mask))) /\ ((((forall eut_divisor_eu_G014_phi_count_mask_choice_coprime. (exists eut_left_eu_G014_phi_count_mask_choice_coprime. (eut_index_eu_G014_phi_count_mask) = eut_divisor_eu_G014_phi_count_mask_choice_coprime * eut_left_eu_G014_phi_count_mask_choice_coprime) -> (exists eut_right_eu_G014_phi_count_mask_choice_coprime. (m) = eut_divisor_eu_G014_phi_count_mask_choice_coprime * eut_right_eu_G014_phi_count_mask_choice_coprime) -> eut_divisor_eu_G014_phi_count_mask_choice_coprime = 1) /\ (eut_bit_eu_G014_phi_count_mask) = 1) \/ (~(forall eut_divisor_eu_G014_phi_count_mask_choice_coprime. (exists eut_left_eu_G014_phi_count_mask_choice_coprime. (eut_index_eu_G014_phi_count_mask) = eut_divisor_eu_G014_phi_count_mask_choice_coprime * eut_left_eu_G014_phi_count_mask_choice_coprime) -> (exists eut_right_eu_G014_phi_count_mask_choice_coprime. (m) = eut_divisor_eu_G014_phi_count_mask_choice_coprime * eut_right_eu_G014_phi_count_mask_choice_coprime) -> eut_divisor_eu_G014_phi_count_mask_choice_coprime = 1) /\ (eut_bit_eu_G014_phi_count_mask) = 0)))) /\ (exists fs_u_eut_eu_G014_phi_count_sum fs_v_eut_eu_G014_phi_count_sum. ((((exists fs_h_eut_eu_G014_phi_count_sum_body_start. fs_h_eut_eu_G014_phi_count_sum_body_start + S (0) = S ((S (0)) * fs_v_eut_eu_G014_phi_count_sum)) /\ exists fs_q_eut_eu_G014_phi_count_sum_body_start. fs_u_eut_eu_G014_phi_count_sum = fs_q_eut_eu_G014_phi_count_sum_body_start * S ((S (0)) * fs_v_eut_eu_G014_phi_count_sum) + (0))) /\ ((((exists fs_h_eut_eu_G014_phi_count_sum_body_terminal. fs_h_eut_eu_G014_phi_count_sum_body_terminal + S (t) = S ((S (m)) * fs_v_eut_eu_G014_phi_count_sum)) /\ exists fs_q_eut_eu_G014_phi_count_sum_body_terminal. fs_u_eut_eu_G014_phi_count_sum = fs_q_eut_eu_G014_phi_count_sum_body_terminal * S ((S (m)) * fs_v_eut_eu_G014_phi_count_sum) + (t))) /\ forall fs_i_eut_eu_G014_phi_count_sum_body_steps. (exists fs_lt_eut_eu_G014_phi_count_sum_body_steps_bound. fs_lt_eut_eu_G014_phi_count_sum_body_steps_bound + S fs_i_eut_eu_G014_phi_count_sum_body_steps = m) -> exists fs_a_eut_eu_G014_phi_count_sum_body_steps fs_r_eut_eu_G014_phi_count_sum_body_steps fs_s_eut_eu_G014_phi_count_sum_body_steps. ((((exists fs_h_eut_eu_G014_phi_count_sum_body_steps_summand. fs_h_eut_eu_G014_phi_count_sum_body_steps_summand + S (fs_a_eut_eu_G014_phi_count_sum_body_steps) = S ((S (fs_i_eut_eu_G014_phi_count_sum_body_steps)) * eut_scale_eu_G014_phi_count)) /\ exists fs_q_eut_eu_G014_phi_count_sum_body_steps_summand. eut_code_eu_G014_phi_count = fs_q_eut_eu_G014_phi_count_sum_body_steps_summand * S ((S (fs_i_eut_eu_G014_phi_count_sum_body_steps)) * eut_scale_eu_G014_phi_count) + (fs_a_eut_eu_G014_phi_count_sum_body_steps))) /\ ((((exists fs_h_eut_eu_G014_phi_count_sum_body_steps_partial. fs_h_eut_eu_G014_phi_count_sum_body_steps_partial + S (fs_r_eut_eu_G014_phi_count_sum_body_steps) = S ((S (fs_i_eut_eu_G014_phi_count_sum_body_steps)) * fs_v_eut_eu_G014_phi_count_sum)) /\ exists fs_q_eut_eu_G014_phi_count_sum_body_steps_partial. fs_u_eut_eu_G014_phi_count_sum = fs_q_eut_eu_G014_phi_count_sum_body_steps_partial * S ((S (fs_i_eut_eu_G014_phi_count_sum_body_steps)) * fs_v_eut_eu_G014_phi_count_sum) + (fs_r_eut_eu_G014_phi_count_sum_body_steps))) /\ ((((exists fs_h_eut_eu_G014_phi_count_sum_body_steps_successor. fs_h_eut_eu_G014_phi_count_sum_body_steps_successor + S (fs_s_eut_eu_G014_phi_count_sum_body_steps) = S ((S (S fs_i_eut_eu_G014_phi_count_sum_body_steps)) * fs_v_eut_eu_G014_phi_count_sum)) /\ exists fs_q_eut_eu_G014_phi_count_sum_body_steps_successor. fs_u_eut_eu_G014_phi_count_sum = fs_q_eut_eu_G014_phi_count_sum_body_steps_successor * S ((S (S fs_i_eut_eu_G014_phi_count_sum_body_steps)) * fs_v_eut_eu_G014_phi_count_sum) + (fs_s_eut_eu_G014_phi_count_sum_body_steps))) /\ fs_s_eut_eu_G014_phi_count_sum_body_steps = fs_r_eut_eu_G014_phi_count_sum_body_steps + fs_a_eut_eu_G014_phi_count_sum_body_steps))))))))))) -> exists w. (exists pa_b_euta_eu_G014_power pa_c_euta_eu_G014_power. ((forall pa_i_euta_eu_G014_power_repeat. (exists pa_lt_euta_eu_G014_power_repeat_bound. pa_lt_euta_eu_G014_power_repeat_bound + S pa_i_euta_eu_G014_power_repeat = t) -> (((exists pa_h_euta_eu_G014_power_repeat_decoded. pa_h_euta_eu_G014_power_repeat_decoded + S (a) = S ((S (pa_i_euta_eu_G014_power_repeat)) * pa_c_euta_eu_G014_power)) /\ exists pa_q_euta_eu_G014_power_repeat_decoded. pa_b_euta_eu_G014_power = pa_q_euta_eu_G014_power_repeat_decoded * S ((S (pa_i_euta_eu_G014_power_repeat)) * pa_c_euta_eu_G014_power) + (a)))) /\ (exists pa_u_euta_eu_G014_power_product pa_v_euta_eu_G014_power_product. ((((exists pa_h_euta_eu_G014_power_product_start. pa_h_euta_eu_G014_power_product_start + S (1) = S ((S (0)) * pa_v_euta_eu_G014_power_product)) /\ exists pa_q_euta_eu_G014_power_product_start. pa_u_euta_eu_G014_power_product = pa_q_euta_eu_G014_power_product_start * S ((S (0)) * pa_v_euta_eu_G014_power_product) + (1))) /\ ((((exists pa_h_euta_eu_G014_power_product_terminal. pa_h_euta_eu_G014_power_product_terminal + S (w) = S ((S (t)) * pa_v_euta_eu_G014_power_product)) /\ exists pa_q_euta_eu_G014_power_product_terminal. pa_u_euta_eu_G014_power_product = pa_q_euta_eu_G014_power_product_terminal * S ((S (t)) * pa_v_euta_eu_G014_power_product) + (w))) /\ forall pa_i_euta_eu_G014_power_product. (exists pa_lt_euta_eu_G014_power_product_bound. pa_lt_euta_eu_G014_power_product_bound + S pa_i_euta_eu_G014_power_product = t) -> exists pa_p_euta_eu_G014_power_product pa_r_euta_eu_G014_power_product pa_s_euta_eu_G014_power_product. ((((exists pa_h_euta_eu_G014_power_product_factor. pa_h_euta_eu_G014_power_product_factor + S (pa_p_euta_eu_G014_power_product) = S ((S (pa_i_euta_eu_G014_power_product)) * pa_c_euta_eu_G014_power)) /\ exists pa_q_euta_eu_G014_power_product_factor. pa_b_euta_eu_G014_power = pa_q_euta_eu_G014_power_product_factor * S ((S (pa_i_euta_eu_G014_power_product)) * pa_c_euta_eu_G014_power) + (pa_p_euta_eu_G014_power_product))) /\ ((((exists pa_h_euta_eu_G014_power_product_partial. pa_h_euta_eu_G014_power_product_partial + S (pa_r_euta_eu_G014_power_product) = S ((S (pa_i_euta_eu_G014_power_product)) * pa_v_euta_eu_G014_power_product)) /\ exists pa_q_euta_eu_G014_power_product_partial. pa_u_euta_eu_G014_power_product = pa_q_euta_eu_G014_power_product_partial * S ((S (pa_i_euta_eu_G014_power_product)) * pa_v_euta_eu_G014_power_product) + (pa_r_euta_eu_G014_power_product))) /\ ((((exists pa_h_euta_eu_G014_power_product_successor. pa_h_euta_eu_G014_power_product_successor + S (pa_s_euta_eu_G014_power_product) = S ((S (S pa_i_euta_eu_G014_power_product)) * pa_v_euta_eu_G014_power_product)) /\ exists pa_q_euta_eu_G014_power_product_successor. pa_u_euta_eu_G014_power_product = pa_q_euta_eu_G014_power_product_successor * S ((S (S pa_i_euta_eu_G014_power_product)) * pa_v_euta_eu_G014_power_product) + (pa_s_euta_eu_G014_power_product))) /\ pa_s_euta_eu_G014_power_product = pa_r_euta_eu_G014_power_product * pa_p_euta_eu_G014_power_product)))))))) /\ (exists eu_mod_left_G014_result eu_mod_right_G014_result. (w) + (m) * eu_mod_left_G014_result = (1) + (m) * eu_mod_right_G014_result)
add_comm
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 2; exact statement SHA-256 d0964c9be754ff543a32b916d0b2a1bc278f849ba40378004f32a397d83a168c
Exact first-order statement
forall n m. n + m = m + n
beta_at_unique
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 89; exact statement SHA-256 eac0700b7c24aa059073c61ffdf1541dc02d23400571b003fe964b9df65f5afd
Exact first-order statement
forall b c i x y. ((exists h. h + S x = S ((S i) * c)) /\ exists q. b = q * S ((S i) * c) + x) -> ((exists h. h + S y = S ((S i) * c)) /\ exists q. b = q * S ((S i) * c) + y) -> x = y
beta_prefix_extend
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 117; exact statement SHA-256 292c7a2a1abbf591e9a3cfd77ad0533f12761f691460fca7a20f413c6f66a1e0
Exact first-order statement
forall k b e s. exists z c. (((exists h. h + S s = S ((S k) * c)) /\ exists q. z = q * S ((S k) * c) + s) /\ forall i a. (exists h. h + S i = k) -> ((exists h. h + S a = S ((S i) * e)) /\ exists q. b = q * S ((S i) * e) + a) -> ((exists h. h + S a = S ((S i) * c)) /\ exists q. z = q * S ((S i) * c) + a))
beta_product_exists
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 119; exact statement SHA-256 65955dade14a69f532b45f1541232206f1b80a684b8424f6b7b39f1d24df7bb3
Exact first-order statement
forall b c l. exists n u v. (((exists h. h + S 1 = S ((S 0) * v)) /\ exists q. u = q * S ((S 0) * v) + 1) /\ (((exists h. h + S n = S ((S l) * v)) /\ exists q. u = q * S ((S l) * v) + n) /\ forall i. (exists h. h + S i = l) -> exists p r s. (((exists h. h + S p = S ((S i) * c)) /\ exists q. b = q * S ((S i) * c) + p) /\ (((exists h. h + S r = S ((S i) * v)) /\ exists q. u = q * S ((S i) * v) + r) /\ (((exists h. h + S s = S ((S (S i)) * v)) /\ exists q. u = q * S ((S (S i)) * v) + s) /\ s = r * p)))))
beta_product_permutation_invariant
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 165; exact statement SHA-256 cde158e9d22685010c99290d6c139ce33e9feb5770fdc7f897fbf876d1ef98f2
Exact first-order statement
forall l r s b c z d p q. (forall fp_i_reindex_bounded. (exists fp_gap_reindex_bounded_index. fp_gap_reindex_bounded_index + S fp_i_reindex_bounded = l) -> exists fp_value_reindex_bounded. ((((exists ff_h_reindex_bounded_entry. ff_h_reindex_bounded_entry + S (fp_value_reindex_bounded) = S ((S (fp_i_reindex_bounded)) * s)) /\ exists ff_q_reindex_bounded_entry. r = ff_q_reindex_bounded_entry * S ((S (fp_i_reindex_bounded)) * s) + (fp_value_reindex_bounded))) /\ (exists fp_gap_reindex_bounded_value. fp_gap_reindex_bounded_value + S fp_value_reindex_bounded = l))) -> (forall fp_i_reindex_injective fp_j_reindex_injective fp_value_reindex_injective. (exists fp_gap_reindex_injective_i. fp_gap_reindex_injective_i + S fp_i_reindex_injective = l) -> (exists fp_gap_reindex_injective_j. fp_gap_reindex_injective_j + S fp_j_reindex_injective = l) -> (((exists ff_h_reindex_injective_left. ff_h_reindex_injective_left + S (fp_value_reindex_injective) = S ((S (fp_i_reindex_injective)) * s)) /\ exists ff_q_reindex_injective_left. r = ff_q_reindex_injective_left * S ((S (fp_i_reindex_injective)) * s) + (fp_value_reindex_injective))) -> (((exists ff_h_reindex_injective_right. ff_h_reindex_injective_right + S (fp_value_reindex_injective) = S ((S (fp_j_reindex_injective)) * s)) /\ exists ff_q_reindex_injective_right. r = ff_q_reindex_injective_right * S ((S (fp_j_reindex_injective)) * s) + (fp_value_reindex_injective))) -> fp_i_reindex_injective = fp_j_reindex_injective) -> (forall fpr_i_reindex_aligned fpr_j_reindex_aligned fpr_x_reindex_aligned. (exists fpr_h_reindex_aligned. fpr_h_reindex_aligned + S fpr_i_reindex_aligned = l) -> (((exists ff_h_reindex_aligned_map. ff_h_reindex_aligned_map + S (fpr_j_reindex_aligned) = S ((S (fpr_i_reindex_aligned)) * s)) /\ exists ff_q_reindex_aligned_map. r = ff_q_reindex_aligned_map * S ((S (fpr_i_reindex_aligned)) * s) + (fpr_j_reindex_aligned))) -> (((exists ff_h_reindex_aligned_source. ff_h_reindex_aligned_source + S (fpr_x_reindex_aligned) = S ((S (fpr_j_reindex_aligned)) * c)) /\ exists ff_q_reindex_aligned_source. b = ff_q_reindex_aligned_source * S ((S (fpr_j_reindex_aligned)) * c) + (fpr_x_reindex_aligned))) -> (((exists ff_h_reindex_aligned_target. ff_h_reindex_aligned_target + S (fpr_x_reindex_aligned) = S ((S (fpr_i_reindex_aligned)) * d)) /\ exists ff_q_reindex_aligned_target. z = ff_q_reindex_aligned_target * S ((S (fpr_i_reindex_aligned)) * d) + (fpr_x_reindex_aligned)))) -> (exists ff_u_reindex_source_product ff_v_reindex_source_product. ((((exists ff_h_reindex_source_product_start. ff_h_reindex_source_product_start + S (1) = S ((S (0)) * ff_v_reindex_source_product)) /\ exists ff_q_reindex_source_product_start. ff_u_reindex_source_product = ff_q_reindex_source_product_start * S ((S (0)) * ff_v_reindex_source_product) + (1))) /\ ((((exists ff_h_reindex_source_product_terminal. ff_h_reindex_source_product_terminal + S (p) = S ((S (l)) * ff_v_reindex_source_product)) /\ exists ff_q_reindex_source_product_terminal. ff_u_reindex_source_product = ff_q_reindex_source_product_terminal * S ((S (l)) * ff_v_reindex_source_product) + (p))) /\ forall ff_i_reindex_source_product. (exists ff_lt_reindex_source_product_bound. ff_lt_reindex_source_product_bound + S ff_i_reindex_source_product = l) -> exists ff_p_reindex_source_product ff_r_reindex_source_product ff_s_reindex_source_product. ((((exists ff_h_reindex_source_product_factor. ff_h_reindex_source_product_factor + S (ff_p_reindex_source_product) = S ((S (ff_i_reindex_source_product)) * c)) /\ exists ff_q_reindex_source_product_factor. b = ff_q_reindex_source_product_factor * S ((S (ff_i_reindex_source_product)) * c) + (ff_p_reindex_source_product))) /\ ((((exists ff_h_reindex_source_product_partial. ff_h_reindex_source_product_partial + S (ff_r_reindex_source_product) = S ((S (ff_i_reindex_source_product)) * ff_v_reindex_source_product)) /\ exists ff_q_reindex_source_product_partial. ff_u_reindex_source_product = ff_q_reindex_source_product_partial * S ((S (ff_i_reindex_source_product)) * ff_v_reindex_source_product) + (ff_r_reindex_source_product))) /\ ((((exists ff_h_reindex_source_product_successor. ff_h_reindex_source_product_successor + S (ff_s_reindex_source_product) = S ((S (S ff_i_reindex_source_product)) * ff_v_reindex_source_product)) /\ exists ff_q_reindex_source_product_successor. ff_u_reindex_source_product = ff_q_reindex_source_product_successor * S ((S (S ff_i_reindex_source_product)) * ff_v_reindex_source_product) + (ff_s_reindex_source_product))) /\ ff_s_reindex_source_product = ff_r_reindex_source_product * ff_p_reindex_source_product)))))) -> (exists ff_u_reindex_target_product ff_v_reindex_target_product. ((((exists ff_h_reindex_target_product_start. ff_h_reindex_target_product_start + S (1) = S ((S (0)) * ff_v_reindex_target_product)) /\ exists ff_q_reindex_target_product_start. ff_u_reindex_target_product = ff_q_reindex_target_product_start * S ((S (0)) * ff_v_reindex_target_product) + (1))) /\ ((((exists ff_h_reindex_target_product_terminal. ff_h_reindex_target_product_terminal + S (q) = S ((S (l)) * ff_v_reindex_target_product)) /\ exists ff_q_reindex_target_product_terminal. ff_u_reindex_target_product = ff_q_reindex_target_product_terminal * S ((S (l)) * ff_v_reindex_target_product) + (q))) /\ forall ff_i_reindex_target_product. (exists ff_lt_reindex_target_product_bound. ff_lt_reindex_target_product_bound + S ff_i_reindex_target_product = l) -> exists ff_p_reindex_target_product ff_r_reindex_target_product ff_s_reindex_target_product. ((((exists ff_h_reindex_target_product_factor. ff_h_reindex_target_product_factor + S (ff_p_reindex_target_product) = S ((S (ff_i_reindex_target_product)) * d)) /\ exists ff_q_reindex_target_product_factor. z = ff_q_reindex_target_product_factor * S ((S (ff_i_reindex_target_product)) * d) + (ff_p_reindex_target_product))) /\ ((((exists ff_h_reindex_target_product_partial. ff_h_reindex_target_product_partial + S (ff_r_reindex_target_product) = S ((S (ff_i_reindex_target_product)) * ff_v_reindex_target_product)) /\ exists ff_q_reindex_target_product_partial. ff_u_reindex_target_product = ff_q_reindex_target_product_partial * S ((S (ff_i_reindex_target_product)) * ff_v_reindex_target_product) + (ff_r_reindex_target_product))) /\ ((((exists ff_h_reindex_target_product_successor. ff_h_reindex_target_product_successor + S (ff_s_reindex_target_product) = S ((S (S ff_i_reindex_target_product)) * ff_v_reindex_target_product)) /\ exists ff_q_reindex_target_product_successor. ff_u_reindex_target_product = ff_q_reindex_target_product_successor * S ((S (S ff_i_reindex_target_product)) * ff_v_reindex_target_product) + (ff_s_reindex_target_product))) /\ ff_s_reindex_target_product = ff_r_reindex_target_product * ff_p_reindex_target_product)))))) -> p = q
beta_product_succ_decompose
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 122; exact statement SHA-256 03469f0a2a01256aebd276b930955e026afe285ea8143da27e5d07d19f70c6a2
Exact first-order statement
forall b c l n. (exists u v. (((exists h. h + S 1 = S ((S 0) * v)) /\ exists q. u = q * S ((S 0) * v) + 1) /\ (((exists h. h + S n = S ((S S l) * v)) /\ exists q. u = q * S ((S S l) * v) + n) /\ forall i. (exists h. h + S i = S l) -> exists p r s. (((exists h. h + S p = S ((S i) * c)) /\ exists q. b = q * S ((S i) * c) + p) /\ (((exists h. h + S r = S ((S i) * v)) /\ exists q. u = q * S ((S i) * v) + r) /\ (((exists h. h + S s = S ((S S i) * v)) /\ exists q. u = q * S ((S S i) * v) + s) /\ s = r * p)))))) -> exists p r. (((exists h. h + S p = S ((S l) * c)) /\ exists q. b = q * S ((S l) * c) + p) /\ ((exists u v. (((exists h. h + S 1 = S ((S 0) * v)) /\ exists q. u = q * S ((S 0) * v) + 1) /\ (((exists h. h + S r = S ((S l) * v)) /\ exists q. u = q * S ((S l) * v) + r) /\ forall i. (exists h. h + S i = l) -> exists p r s. (((exists h. h + S p = S ((S i) * c)) /\ exists q. b = q * S ((S i) * c) + p) /\ (((exists h. h + S r = S ((S i) * v)) /\ exists q. u = q * S ((S i) * v) + r) /\ (((exists h. h + S s = S ((S S i) * v)) /\ exists q. u = q * S ((S S i) * v) + s) /\ s = r * p)))))) /\ n = r * p))
beta_product_zero
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 121; exact statement SHA-256 311da073e3b279a1c8a11c70e0c320d5728c686f858c65882f380864943c904f
Exact first-order statement
forall b c n. (exists u v. (((exists h. h + S 1 = S ((S 0) * v)) /\ exists q. u = q * S ((S 0) * v) + 1) /\ (((exists h. h + S n = S ((S 0) * v)) /\ exists q. u = q * S ((S 0) * v) + n) /\ forall i. (exists h. h + S i = 0) -> exists p r s. (((exists h. h + S p = S ((S i) * c)) /\ exists q. b = q * S ((S i) * c) + p) /\ (((exists h. h + S r = S ((S i) * v)) /\ exists q. u = q * S ((S i) * v) + r) /\ (((exists h. h + S s = S ((S S i) * v)) /\ exists q. u = q * S ((S S i) * v) + s) /\ s = r * p)))))) -> n = 1
binary_modulus_nontrivial_nonzero
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 167; exact statement SHA-256 df3f3be5ae7d754326f0e766d53d1ffa784fcf4f01007049ff0c24ce56dceba0
Exact first-order statement
forall m. (exists ff_modulus_gap_binary_guard. ff_modulus_gap_binary_guard + S 1 = m) -> ~(m = 0)
coprime_bounded_mod_inverse
Inherited Alpha proof; no standalone historical explorer page · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 162; exact statement SHA-256 84b14ceae7ab398b01e4b2033fd192110eef89ab6f921aeecb0c24eac424c3e8
Exact first-order statement
forall a m. ~(m = 0) -> (forall hmi_divisor_assumption. (exists hmi_left_factor_assumption. a = hmi_divisor_assumption * hmi_left_factor_assumption) -> (exists hmi_right_factor_assumption. m = hmi_divisor_assumption * hmi_right_factor_assumption) -> hmi_divisor_assumption = 1) -> exists r. (exists hmi_gap_result_bound. hmi_gap_result_bound + S r = m) /\ (exists hmi_left_offset_result_inverse hmi_right_offset_result_inverse. a * r + m * hmi_left_offset_result_inverse = 1 + m * hmi_right_offset_result_inverse)
coprime_mul_left
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 103; exact statement SHA-256 1060b24a0e43b4388c2ac9ecac0e76f60914ccf6cd449d37592e4b4d22461735
Exact first-order statement
forall a b n. (forall d. (exists x. a = d * x) -> (exists y. n = d * y) -> d = 1) -> (forall d. (exists x. b = d * x) -> (exists y. n = d * y) -> d = 1) -> forall d. (exists x. a * b = d * x) -> (exists y. n = d * y) -> d = 1
coprime_one_left
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 64; exact statement SHA-256 344ae50f597ba7d8033e2f60d4d7d8ce9a304b49aa863298f875a28c7115cb69
Exact first-order statement
forall a d. (exists x. 1 = d * x) -> (exists y. a = d * y) -> d = 1
division_remainder_exists
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 41; exact statement SHA-256 5129cc09f73a6bfed8749bccdd181148e27fa13ee31c796f9e3a8010fb8197a0
Exact first-order statement
forall m n. ~(m = 0) -> exists q r. n = m * q + r /\ S r <= m
finite_beta_composition_exists
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 168; exact statement SHA-256 3c972da21b7d877122c0219ecf0762e5e2c824a0750416998ff0b594e9be2079
Exact first-order statement
forall r s b c l. exists z d. (forall fms_i_compose fms_j_compose fms_v_compose. (exists fms_gap_compose. fms_gap_compose + S (fms_i_compose) = (l)) -> (((exists fs_h_fms_compose_index. fs_h_fms_compose_index + S (fms_j_compose) = S ((S (fms_i_compose)) * s)) /\ exists fs_q_fms_compose_index. r = fs_q_fms_compose_index * S ((S (fms_i_compose)) * s) + (fms_j_compose))) -> (((exists fs_h_fms_compose_source. fs_h_fms_compose_source + S (fms_v_compose) = S ((S (fms_j_compose)) * c)) /\ exists fs_q_fms_compose_source. b = fs_q_fms_compose_source * S ((S (fms_j_compose)) * c) + (fms_v_compose))) -> (((exists fs_h_fms_compose_target. fs_h_fms_compose_target + S (fms_v_compose) = S ((S (fms_i_compose)) * d)) /\ exists fs_q_fms_compose_target. z = fs_q_fms_compose_target * S ((S (fms_i_compose)) * d) + (fms_v_compose))))
finite_bounded_injective_surjective
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 156; exact statement SHA-256 9e0cad653da9de17ab7bbac3cb3bf49bc6d4a1304bda508669943b25fd247257
Exact first-order statement
forall n b c. (forall fp_i_pigeon_bounded. (exists fp_gap_pigeon_bounded_index. fp_gap_pigeon_bounded_index + S fp_i_pigeon_bounded = n) -> exists fp_value_pigeon_bounded. ((((exists ff_h_pigeon_bounded_entry. ff_h_pigeon_bounded_entry + S (fp_value_pigeon_bounded) = S ((S (fp_i_pigeon_bounded)) * c)) /\ exists ff_q_pigeon_bounded_entry. b = ff_q_pigeon_bounded_entry * S ((S (fp_i_pigeon_bounded)) * c) + (fp_value_pigeon_bounded))) /\ (exists fp_gap_pigeon_bounded_value. fp_gap_pigeon_bounded_value + S fp_value_pigeon_bounded = n))) -> (forall fp_i_pigeon_injective fp_j_pigeon_injective fp_value_pigeon_injective. (exists fp_gap_pigeon_injective_i. fp_gap_pigeon_injective_i + S fp_i_pigeon_injective = n) -> (exists fp_gap_pigeon_injective_j. fp_gap_pigeon_injective_j + S fp_j_pigeon_injective = n) -> (((exists ff_h_pigeon_injective_left. ff_h_pigeon_injective_left + S (fp_value_pigeon_injective) = S ((S (fp_i_pigeon_injective)) * c)) /\ exists ff_q_pigeon_injective_left. b = ff_q_pigeon_injective_left * S ((S (fp_i_pigeon_injective)) * c) + (fp_value_pigeon_injective))) -> (((exists ff_h_pigeon_injective_right. ff_h_pigeon_injective_right + S (fp_value_pigeon_injective) = S ((S (fp_j_pigeon_injective)) * c)) /\ exists ff_q_pigeon_injective_right. b = ff_q_pigeon_injective_right * S ((S (fp_j_pigeon_injective)) * c) + (fp_value_pigeon_injective))) -> fp_i_pigeon_injective = fp_j_pigeon_injective) -> (forall fp_value_pigeon_surjective. (exists fp_gap_pigeon_surjective_value. fp_gap_pigeon_surjective_value + S fp_value_pigeon_surjective = n) -> exists fp_i_pigeon_surjective. ((exists fp_gap_pigeon_surjective_index. fp_gap_pigeon_surjective_index + S fp_i_pigeon_surjective = n) /\ (((exists ff_h_pigeon_surjective_entry. ff_h_pigeon_surjective_entry + S (fp_value_pigeon_surjective) = S ((S (fp_i_pigeon_surjective)) * c)) /\ exists ff_q_pigeon_surjective_entry. b = ff_q_pigeon_surjective_entry * S ((S (fp_i_pigeon_surjective)) * c) + (fp_value_pigeon_surjective)))))
finite_lt_succ_eq_or_lt
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 141; exact statement SHA-256 4829550fa55790a5ce617b99bbd357d27af724ca5316fbc0a5afef062fb3a1f6
Exact first-order statement
forall n x. (exists h. h + S x = S n) -> x = n \/ exists h. h + S x = n
le_refl
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 13; exact statement SHA-256 4a63925d2370803a106dd819be4a0b5369ca4575fd36d6bcdb133020703a17fd
Exact first-order statement
forall n. n <= n
le_succ
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 32; exact statement SHA-256 3adee5fa95d2437f4677d9f9a0937c5b48a7fcebb3350403b5be969ed30c7c50
Exact first-order statement
forall a b. (exists k. k + a = b) -> exists r. r + a = S b
lt_not_le
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 37; exact statement SHA-256 67ac242c268a6e5548258ffc82934cea4f21faded2a1a32553e05a7319fad23d
Exact first-order statement
forall a b. (exists k. k + S a = b) -> ~ (exists k. k + b = a)
mod_eq_bounded_unique
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 84; exact statement SHA-256 8e73abc172b556b5fb557c527977e6f07c1e366080b207163dd58b7931643c0d
Exact first-order statement
forall m a b. (exists ha. ha + S a = m) -> (exists hb. hb + S b = m) -> (exists u v. a + m * u = b + m * v) -> a = b
mod_eq_cancel_coprime
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 137; exact statement SHA-256 25429b6a168ea32f9f2bcedb519ade9e94bc947443204288d0f7b211278860ab
Exact first-order statement
forall m a x y. ~(m = 0) -> (forall d. (exists x. a = d * x) -> (exists y. m = d * y) -> d = 1) -> (exists u v. (a * x) + m * u = (a * y) + m * v) -> exists r s. x + m * r = y + m * s
mod_eq_mul
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 82; exact statement SHA-256 a3983a74ea581e76450a400c1ed5b4e06e6feac6ff9a6ebb90d8f82f3c316d2b
Exact first-order statement
forall m a b c d. (exists u v. a + m * u = b + m * v) -> (exists r s. c + m * r = d + m * s) -> exists x y. (a * c) + m * x = (b * d) + m * y
mod_eq_refl
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 76; exact statement SHA-256 fcff327b653f93b5a53460bbb0dc67a5e04ee9212c0d1a88a04bdecf93d17add
Exact first-order statement
forall m a. exists u v. a + m * u = a + m * v
mod_eq_symm
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 77; exact statement SHA-256 198ad914d976d480b8d9df5b0ada71e74e1be9e0b01656dd7e641038874ff27e
Exact first-order statement
forall m a b. (exists u v. a + m * u = b + m * v) -> exists r s. b + m * r = a + m * s
mod_eq_trans
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 78; exact statement SHA-256 07009140b6d6d7f4e1e34d6c33bf1b007ea29c26a14eeafa9b2fa3d377abe7a9
Exact first-order statement
forall m a b c. (exists u v. a + m * u = b + m * v) -> (exists r s. b + m * r = c + m * s) -> exists x y. a + m * x = c + m * y
mod_inverse_implies_coprime
Inherited Alpha proof; no standalone historical explorer page · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 163; exact statement SHA-256 e43d577e91195ee611ede2e8e3ad6511db34b1d45a22eb12d6b37b09f708d905
Exact first-order statement
forall a m z. (exists hmi_left_offset_converse_assumption hmi_right_offset_converse_assumption. a * z + m * hmi_left_offset_converse_assumption = 1 + m * hmi_right_offset_converse_assumption) -> (forall hmi_divisor_converse_result. (exists hmi_left_factor_converse_result. a = hmi_divisor_converse_result * hmi_left_factor_converse_result) -> (exists hmi_right_factor_converse_result. m = hmi_divisor_converse_result * hmi_right_factor_converse_result) -> hmi_divisor_converse_result = 1)
mul_assoc
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 8; exact statement SHA-256 085c35afadeb1fafeb905d334c75f2799104ead8ddd8e59a301230d6e5b290d6
Exact first-order statement
forall n m k. (n * m) * k = n * (m * k)
mul_comm
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 6; exact statement SHA-256 b5277583d2ad3b537c2ccf0fecc33912b9ff69674ec9659cf8d70f58b691b65d
Exact first-order statement
forall n m. n * m = m * n
mul_one
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 10; exact statement SHA-256 1c5292d92762aae47f3833dd3c85aa1275122554525aae695a40d1380c74c24e
Exact first-order statement
forall n. n * 1 = n
mul_shuffle_four
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 166; exact statement SHA-256 19b66d6067bb43e0b83b85fb2608c48f5a9ffd6b14f34b217c852b9e0820cb25
Exact first-order statement
forall a b c d. (a * b) * (c * d) = (a * c) * (b * d)
one_mul
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 9; exact statement SHA-256 a3fba3e972fc2ec6f5a274a8d21550e1081cf5f1581eda98922616aa20cda490
Exact first-order statement
forall n. 1 * n = n
pow_exists
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 129; exact statement SHA-256 b773cba57ba44f87431d84dcaeb85cdf6ee363ab259e593ad25aa0ba4ec81543
Exact first-order statement
forall a e. exists n. (exists ff_b_x ff_c_x. ((forall ff_i_x_repeat. (exists ff_lt_x_repeat_bound. ff_lt_x_repeat_bound + S ff_i_x_repeat = e) -> (((exists ff_h_x_repeat_decoded. ff_h_x_repeat_decoded + S (a) = S ((S (ff_i_x_repeat)) * ff_c_x)) /\ exists ff_q_x_repeat_decoded. ff_b_x = ff_q_x_repeat_decoded * S ((S (ff_i_x_repeat)) * ff_c_x) + (a)))) /\ (exists ff_u_x_product ff_v_x_product. ((((exists ff_h_x_product_start. ff_h_x_product_start + S (1) = S ((S (0)) * ff_v_x_product)) /\ exists ff_q_x_product_start. ff_u_x_product = ff_q_x_product_start * S ((S (0)) * ff_v_x_product) + (1))) /\ ((((exists ff_h_x_product_terminal. ff_h_x_product_terminal + S (n) = S ((S (e)) * ff_v_x_product)) /\ exists ff_q_x_product_terminal. ff_u_x_product = ff_q_x_product_terminal * S ((S (e)) * ff_v_x_product) + (n))) /\ forall ff_i_x_product. (exists ff_lt_x_product_bound. ff_lt_x_product_bound + S ff_i_x_product = e) -> exists ff_p_x_product ff_r_x_product ff_s_x_product. ((((exists ff_h_x_product_factor. ff_h_x_product_factor + S (ff_p_x_product) = S ((S (ff_i_x_product)) * ff_c_x)) /\ exists ff_q_x_product_factor. ff_b_x = ff_q_x_product_factor * S ((S (ff_i_x_product)) * ff_c_x) + (ff_p_x_product))) /\ ((((exists ff_h_x_product_partial. ff_h_x_product_partial + S (ff_r_x_product) = S ((S (ff_i_x_product)) * ff_v_x_product)) /\ exists ff_q_x_product_partial. ff_u_x_product = ff_q_x_product_partial * S ((S (ff_i_x_product)) * ff_v_x_product) + (ff_r_x_product))) /\ ((((exists ff_h_x_product_successor. ff_h_x_product_successor + S (ff_s_x_product) = S ((S (S ff_i_x_product)) * ff_v_x_product)) /\ exists ff_q_x_product_successor. ff_u_x_product = ff_q_x_product_successor * S ((S (S ff_i_x_product)) * ff_v_x_product) + (ff_s_x_product))) /\ ff_s_x_product = ff_r_x_product * ff_p_x_product))))))))
pow_functional
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 131; exact statement SHA-256 a165bbcd196d1d36843397b85e6b018527828d717d34f17691cd3330f97b751d
Exact first-order statement
forall a e n m. (exists ff_b_l ff_c_l. ((forall ff_i_l_repeat. (exists ff_lt_l_repeat_bound. ff_lt_l_repeat_bound + S ff_i_l_repeat = e) -> (((exists ff_h_l_repeat_decoded. ff_h_l_repeat_decoded + S (a) = S ((S (ff_i_l_repeat)) * ff_c_l)) /\ exists ff_q_l_repeat_decoded. ff_b_l = ff_q_l_repeat_decoded * S ((S (ff_i_l_repeat)) * ff_c_l) + (a)))) /\ (exists ff_u_l_product ff_v_l_product. ((((exists ff_h_l_product_start. ff_h_l_product_start + S (1) = S ((S (0)) * ff_v_l_product)) /\ exists ff_q_l_product_start. ff_u_l_product = ff_q_l_product_start * S ((S (0)) * ff_v_l_product) + (1))) /\ ((((exists ff_h_l_product_terminal. ff_h_l_product_terminal + S (n) = S ((S (e)) * ff_v_l_product)) /\ exists ff_q_l_product_terminal. ff_u_l_product = ff_q_l_product_terminal * S ((S (e)) * ff_v_l_product) + (n))) /\ forall ff_i_l_product. (exists ff_lt_l_product_bound. ff_lt_l_product_bound + S ff_i_l_product = e) -> exists ff_p_l_product ff_r_l_product ff_s_l_product. ((((exists ff_h_l_product_factor. ff_h_l_product_factor + S (ff_p_l_product) = S ((S (ff_i_l_product)) * ff_c_l)) /\ exists ff_q_l_product_factor. ff_b_l = ff_q_l_product_factor * S ((S (ff_i_l_product)) * ff_c_l) + (ff_p_l_product))) /\ ((((exists ff_h_l_product_partial. ff_h_l_product_partial + S (ff_r_l_product) = S ((S (ff_i_l_product)) * ff_v_l_product)) /\ exists ff_q_l_product_partial. ff_u_l_product = ff_q_l_product_partial * S ((S (ff_i_l_product)) * ff_v_l_product) + (ff_r_l_product))) /\ ((((exists ff_h_l_product_successor. ff_h_l_product_successor + S (ff_s_l_product) = S ((S (S ff_i_l_product)) * ff_v_l_product)) /\ exists ff_q_l_product_successor. ff_u_l_product = ff_q_l_product_successor * S ((S (S ff_i_l_product)) * ff_v_l_product) + (ff_s_l_product))) /\ ff_s_l_product = ff_r_l_product * ff_p_l_product)))))))) -> (exists ff_b_r ff_c_r. ((forall ff_i_r_repeat. (exists ff_lt_r_repeat_bound. ff_lt_r_repeat_bound + S ff_i_r_repeat = e) -> (((exists ff_h_r_repeat_decoded. ff_h_r_repeat_decoded + S (a) = S ((S (ff_i_r_repeat)) * ff_c_r)) /\ exists ff_q_r_repeat_decoded. ff_b_r = ff_q_r_repeat_decoded * S ((S (ff_i_r_repeat)) * ff_c_r) + (a)))) /\ (exists ff_u_r_product ff_v_r_product. ((((exists ff_h_r_product_start. ff_h_r_product_start + S (1) = S ((S (0)) * ff_v_r_product)) /\ exists ff_q_r_product_start. ff_u_r_product = ff_q_r_product_start * S ((S (0)) * ff_v_r_product) + (1))) /\ ((((exists ff_h_r_product_terminal. ff_h_r_product_terminal + S (m) = S ((S (e)) * ff_v_r_product)) /\ exists ff_q_r_product_terminal. ff_u_r_product = ff_q_r_product_terminal * S ((S (e)) * ff_v_r_product) + (m))) /\ forall ff_i_r_product. (exists ff_lt_r_product_bound. ff_lt_r_product_bound + S ff_i_r_product = e) -> exists ff_p_r_product ff_r_r_product ff_s_r_product. ((((exists ff_h_r_product_factor. ff_h_r_product_factor + S (ff_p_r_product) = S ((S (ff_i_r_product)) * ff_c_r)) /\ exists ff_q_r_product_factor. ff_b_r = ff_q_r_product_factor * S ((S (ff_i_r_product)) * ff_c_r) + (ff_p_r_product))) /\ ((((exists ff_h_r_product_partial. ff_h_r_product_partial + S (ff_r_r_product) = S ((S (ff_i_r_product)) * ff_v_r_product)) /\ exists ff_q_r_product_partial. ff_u_r_product = ff_q_r_product_partial * S ((S (ff_i_r_product)) * ff_v_r_product) + (ff_r_r_product))) /\ ((((exists ff_h_r_product_successor. ff_h_r_product_successor + S (ff_s_r_product) = S ((S (S ff_i_r_product)) * ff_v_r_product)) /\ exists ff_q_r_product_successor. ff_u_r_product = ff_q_r_product_successor * S ((S (S ff_i_r_product)) * ff_v_r_product) + (ff_s_r_product))) /\ ff_s_r_product = ff_r_r_product * ff_p_r_product)))))))) -> n = m
pow_successor_pair_mul
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 138; exact statement SHA-256 0057e37220405bfa53138560953bc6b0fed8aefe6c3f9babdf2fb60351e7424d
Exact first-order statement
forall a e se r n. se = S e -> (exists ff_b_pair_predecessor ff_c_pair_predecessor. ((forall ff_i_pair_predecessor_repeat. (exists ff_lt_pair_predecessor_repeat_bound. ff_lt_pair_predecessor_repeat_bound + S ff_i_pair_predecessor_repeat = e) -> (((exists ff_h_pair_predecessor_repeat_decoded. ff_h_pair_predecessor_repeat_decoded + S (a) = S ((S (ff_i_pair_predecessor_repeat)) * ff_c_pair_predecessor)) /\ exists ff_q_pair_predecessor_repeat_decoded. ff_b_pair_predecessor = ff_q_pair_predecessor_repeat_decoded * S ((S (ff_i_pair_predecessor_repeat)) * ff_c_pair_predecessor) + (a)))) /\ (exists ff_u_pair_predecessor_product ff_v_pair_predecessor_product. ((((exists ff_h_pair_predecessor_product_start. ff_h_pair_predecessor_product_start + S (1) = S ((S (0)) * ff_v_pair_predecessor_product)) /\ exists ff_q_pair_predecessor_product_start. ff_u_pair_predecessor_product = ff_q_pair_predecessor_product_start * S ((S (0)) * ff_v_pair_predecessor_product) + (1))) /\ ((((exists ff_h_pair_predecessor_product_terminal. ff_h_pair_predecessor_product_terminal + S (r) = S ((S (e)) * ff_v_pair_predecessor_product)) /\ exists ff_q_pair_predecessor_product_terminal. ff_u_pair_predecessor_product = ff_q_pair_predecessor_product_terminal * S ((S (e)) * ff_v_pair_predecessor_product) + (r))) /\ forall ff_i_pair_predecessor_product. (exists ff_lt_pair_predecessor_product_bound. ff_lt_pair_predecessor_product_bound + S ff_i_pair_predecessor_product = e) -> exists ff_p_pair_predecessor_product ff_r_pair_predecessor_product ff_s_pair_predecessor_product. ((((exists ff_h_pair_predecessor_product_factor. ff_h_pair_predecessor_product_factor + S (ff_p_pair_predecessor_product) = S ((S (ff_i_pair_predecessor_product)) * ff_c_pair_predecessor)) /\ exists ff_q_pair_predecessor_product_factor. ff_b_pair_predecessor = ff_q_pair_predecessor_product_factor * S ((S (ff_i_pair_predecessor_product)) * ff_c_pair_predecessor) + (ff_p_pair_predecessor_product))) /\ ((((exists ff_h_pair_predecessor_product_partial. ff_h_pair_predecessor_product_partial + S (ff_r_pair_predecessor_product) = S ((S (ff_i_pair_predecessor_product)) * ff_v_pair_predecessor_product)) /\ exists ff_q_pair_predecessor_product_partial. ff_u_pair_predecessor_product = ff_q_pair_predecessor_product_partial * S ((S (ff_i_pair_predecessor_product)) * ff_v_pair_predecessor_product) + (ff_r_pair_predecessor_product))) /\ ((((exists ff_h_pair_predecessor_product_successor. ff_h_pair_predecessor_product_successor + S (ff_s_pair_predecessor_product) = S ((S (S ff_i_pair_predecessor_product)) * ff_v_pair_predecessor_product)) /\ exists ff_q_pair_predecessor_product_successor. ff_u_pair_predecessor_product = ff_q_pair_predecessor_product_successor * S ((S (S ff_i_pair_predecessor_product)) * ff_v_pair_predecessor_product) + (ff_s_pair_predecessor_product))) /\ ff_s_pair_predecessor_product = ff_r_pair_predecessor_product * ff_p_pair_predecessor_product)))))))) -> (exists ff_b_pair_successor ff_c_pair_successor. ((forall ff_i_pair_successor_repeat. (exists ff_lt_pair_successor_repeat_bound. ff_lt_pair_successor_repeat_bound + S ff_i_pair_successor_repeat = se) -> (((exists ff_h_pair_successor_repeat_decoded. ff_h_pair_successor_repeat_decoded + S (a) = S ((S (ff_i_pair_successor_repeat)) * ff_c_pair_successor)) /\ exists ff_q_pair_successor_repeat_decoded. ff_b_pair_successor = ff_q_pair_successor_repeat_decoded * S ((S (ff_i_pair_successor_repeat)) * ff_c_pair_successor) + (a)))) /\ (exists ff_u_pair_successor_product ff_v_pair_successor_product. ((((exists ff_h_pair_successor_product_start. ff_h_pair_successor_product_start + S (1) = S ((S (0)) * ff_v_pair_successor_product)) /\ exists ff_q_pair_successor_product_start. ff_u_pair_successor_product = ff_q_pair_successor_product_start * S ((S (0)) * ff_v_pair_successor_product) + (1))) /\ ((((exists ff_h_pair_successor_product_terminal. ff_h_pair_successor_product_terminal + S (n) = S ((S (se)) * ff_v_pair_successor_product)) /\ exists ff_q_pair_successor_product_terminal. ff_u_pair_successor_product = ff_q_pair_successor_product_terminal * S ((S (se)) * ff_v_pair_successor_product) + (n))) /\ forall ff_i_pair_successor_product. (exists ff_lt_pair_successor_product_bound. ff_lt_pair_successor_product_bound + S ff_i_pair_successor_product = se) -> exists ff_p_pair_successor_product ff_r_pair_successor_product ff_s_pair_successor_product. ((((exists ff_h_pair_successor_product_factor. ff_h_pair_successor_product_factor + S (ff_p_pair_successor_product) = S ((S (ff_i_pair_successor_product)) * ff_c_pair_successor)) /\ exists ff_q_pair_successor_product_factor. ff_b_pair_successor = ff_q_pair_successor_product_factor * S ((S (ff_i_pair_successor_product)) * ff_c_pair_successor) + (ff_p_pair_successor_product))) /\ ((((exists ff_h_pair_successor_product_partial. ff_h_pair_successor_product_partial + S (ff_r_pair_successor_product) = S ((S (ff_i_pair_successor_product)) * ff_v_pair_successor_product)) /\ exists ff_q_pair_successor_product_partial. ff_u_pair_successor_product = ff_q_pair_successor_product_partial * S ((S (ff_i_pair_successor_product)) * ff_v_pair_successor_product) + (ff_r_pair_successor_product))) /\ ((((exists ff_h_pair_successor_product_successor. ff_h_pair_successor_product_successor + S (ff_s_pair_successor_product) = S ((S (S ff_i_pair_successor_product)) * ff_v_pair_successor_product)) /\ exists ff_q_pair_successor_product_successor. ff_u_pair_successor_product = ff_q_pair_successor_product_successor * S ((S (S ff_i_pair_successor_product)) * ff_v_pair_successor_product) + (ff_s_pair_successor_product))) /\ ff_s_pair_successor_product = ff_r_pair_successor_product * ff_p_pair_successor_product)))))))) -> n = r * a
pow_zero
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 130; exact statement SHA-256 4ce6988b5b348c217d652275b9972c4ff3171def98ff83629fd3bd581ae23db4
Exact first-order statement
forall a e n. e = 0 -> (exists ff_b_z ff_c_z. ((forall ff_i_z_repeat. (exists ff_lt_z_repeat_bound. ff_lt_z_repeat_bound + S ff_i_z_repeat = e) -> (((exists ff_h_z_repeat_decoded. ff_h_z_repeat_decoded + S (a) = S ((S (ff_i_z_repeat)) * ff_c_z)) /\ exists ff_q_z_repeat_decoded. ff_b_z = ff_q_z_repeat_decoded * S ((S (ff_i_z_repeat)) * ff_c_z) + (a)))) /\ (exists ff_u_z_product ff_v_z_product. ((((exists ff_h_z_product_start. ff_h_z_product_start + S (1) = S ((S (0)) * ff_v_z_product)) /\ exists ff_q_z_product_start. ff_u_z_product = ff_q_z_product_start * S ((S (0)) * ff_v_z_product) + (1))) /\ ((((exists ff_h_z_product_terminal. ff_h_z_product_terminal + S (n) = S ((S (e)) * ff_v_z_product)) /\ exists ff_q_z_product_terminal. ff_u_z_product = ff_q_z_product_terminal * S ((S (e)) * ff_v_z_product) + (n))) /\ forall ff_i_z_product. (exists ff_lt_z_product_bound. ff_lt_z_product_bound + S ff_i_z_product = e) -> exists ff_p_z_product ff_r_z_product ff_s_z_product. ((((exists ff_h_z_product_factor. ff_h_z_product_factor + S (ff_p_z_product) = S ((S (ff_i_z_product)) * ff_c_z)) /\ exists ff_q_z_product_factor. ff_b_z = ff_q_z_product_factor * S ((S (ff_i_z_product)) * ff_c_z) + (ff_p_z_product))) /\ ((((exists ff_h_z_product_partial. ff_h_z_product_partial + S (ff_r_z_product) = S ((S (ff_i_z_product)) * ff_v_z_product)) /\ exists ff_q_z_product_partial. ff_u_z_product = ff_q_z_product_partial * S ((S (ff_i_z_product)) * ff_v_z_product) + (ff_r_z_product))) /\ ((((exists ff_h_z_product_successor. ff_h_z_product_successor + S (ff_s_z_product) = S ((S (S ff_i_z_product)) * ff_v_z_product)) /\ exists ff_q_z_product_successor. ff_u_z_product = ff_q_z_product_successor * S ((S (S ff_i_z_product)) * ff_v_z_product) + (ff_s_z_product))) /\ ff_s_z_product = ff_r_z_product * ff_p_z_product)))))))) -> n = 1
remainder_decomposition_to_mod_eq
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 83; exact statement SHA-256 5329024af13cfcbc0e4662ef24110fcbe2ece3d384ffca5c07cf3f6b7a49b55b
Exact first-order statement
forall m b q x. b = q * m + x -> exists u v. b + m * u = x + m * v
totient_coprime_cancel_unit_factor
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 176; exact statement SHA-256 b9d0022a782d2b5b0f014b64fc61435e57e945bd52ee86fb4e519abf5b05799c
Exact first-order statement
forall p n a. (forall eut_divisor_cancel_unit. (exists eut_left_cancel_unit. (p) = eut_divisor_cancel_unit * eut_left_cancel_unit) -> (exists eut_right_cancel_unit. (n) = eut_divisor_cancel_unit * eut_right_cancel_unit) -> eut_divisor_cancel_unit = 1) -> ((((forall eut_divisor_cancel_predicate_left. (exists eut_left_cancel_predicate_left. (p*a) = eut_divisor_cancel_predicate_left * eut_left_cancel_predicate_left) -> (exists eut_right_cancel_predicate_left. (n) = eut_divisor_cancel_predicate_left * eut_right_cancel_predicate_left) -> eut_divisor_cancel_predicate_left = 1) -> (forall eut_divisor_cancel_predicate_right. (exists eut_left_cancel_predicate_right. (a) = eut_divisor_cancel_predicate_right * eut_left_cancel_predicate_right) -> (exists eut_right_cancel_predicate_right. (n) = eut_divisor_cancel_predicate_right * eut_right_cancel_predicate_right) -> eut_divisor_cancel_predicate_right = 1)) /\ ((forall eut_divisor_cancel_predicate_right. (exists eut_left_cancel_predicate_right. (a) = eut_divisor_cancel_predicate_right * eut_left_cancel_predicate_right) -> (exists eut_right_cancel_predicate_right. (n) = eut_divisor_cancel_predicate_right * eut_right_cancel_predicate_right) -> eut_divisor_cancel_predicate_right = 1) -> (forall eut_divisor_cancel_predicate_left. (exists eut_left_cancel_predicate_left. (p*a) = eut_divisor_cancel_predicate_left * eut_left_cancel_predicate_left) -> (exists eut_right_cancel_predicate_left. (n) = eut_divisor_cancel_predicate_left * eut_right_cancel_predicate_left) -> eut_divisor_cancel_predicate_left = 1))))
totient_coprime_decidable
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 169; exact statement SHA-256 f19c3df117b76b9214f22d1ba79bf38146d49210373bdf5c24770b3ec8a6786e
Exact first-order statement
forall a n. (forall eut_divisor_dec_yes. (exists eut_left_dec_yes. (a) = eut_divisor_dec_yes * eut_left_dec_yes) -> (exists eut_right_dec_yes. (n) = eut_divisor_dec_yes * eut_right_dec_yes) -> eut_divisor_dec_yes = 1) \/ ~(forall eut_divisor_dec_no. (exists eut_left_dec_no. (a) = eut_divisor_dec_no * eut_left_dec_no) -> (exists eut_right_dec_no. (n) = eut_divisor_dec_no * eut_right_dec_no) -> eut_divisor_dec_no = 1)
totient_coprime_periodic
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 174; exact statement SHA-256 6d08a07af697ebaba82725f10f5f2a5536358634383e500b279ba8065e6cbe6b
Exact first-order statement
forall n k a. (((forall eut_divisor_periodic_left. (exists eut_left_periodic_left. (n*k+a) = eut_divisor_periodic_left * eut_left_periodic_left) -> (exists eut_right_periodic_left. (n) = eut_divisor_periodic_left * eut_right_periodic_left) -> eut_divisor_periodic_left = 1) -> (forall eut_divisor_periodic_right. (exists eut_left_periodic_right. (a) = eut_divisor_periodic_right * eut_left_periodic_right) -> (exists eut_right_periodic_right. (n) = eut_divisor_periodic_right * eut_right_periodic_right) -> eut_divisor_periodic_right = 1)) /\ ((forall eut_divisor_periodic_right. (exists eut_left_periodic_right. (a) = eut_divisor_periodic_right * eut_left_periodic_right) -> (exists eut_right_periodic_right. (n) = eut_divisor_periodic_right * eut_right_periodic_right) -> eut_divisor_periodic_right = 1) -> (forall eut_divisor_periodic_left. (exists eut_left_periodic_left. (n*k+a) = eut_divisor_periodic_left * eut_left_periodic_left) -> (exists eut_right_periodic_left. (n) = eut_divisor_periodic_left * eut_right_periodic_left) -> eut_divisor_periodic_left = 1)))
totient_unit_count_succ_decompose
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 173; exact statement SHA-256 205f812c6c9e6559e5c0d87444657d86639b94404c09d35e9690a05d52e21b73
Exact first-order statement
forall n l t. (exists eut_code_succ_count eut_scale_succ_count. (forall eut_index_succ_count_mask. (exists eut_gap_succ_count_mask_bound. eut_gap_succ_count_mask_bound + S (eut_index_succ_count_mask) = (S l)) -> exists eut_bit_succ_count_mask. (((exists fs_h_eut_succ_count_mask_entry. fs_h_eut_succ_count_mask_entry + S (eut_bit_succ_count_mask) = S ((S (eut_index_succ_count_mask)) * eut_scale_succ_count)) /\ exists fs_q_eut_succ_count_mask_entry. eut_code_succ_count = fs_q_eut_succ_count_mask_entry * S ((S (eut_index_succ_count_mask)) * eut_scale_succ_count) + (eut_bit_succ_count_mask))) /\ ((((forall eut_divisor_succ_count_mask_choice_coprime. (exists eut_left_succ_count_mask_choice_coprime. (eut_index_succ_count_mask) = eut_divisor_succ_count_mask_choice_coprime * eut_left_succ_count_mask_choice_coprime) -> (exists eut_right_succ_count_mask_choice_coprime. (n) = eut_divisor_succ_count_mask_choice_coprime * eut_right_succ_count_mask_choice_coprime) -> eut_divisor_succ_count_mask_choice_coprime = 1) /\ (eut_bit_succ_count_mask) = 1) \/ (~(forall eut_divisor_succ_count_mask_choice_coprime. (exists eut_left_succ_count_mask_choice_coprime. (eut_index_succ_count_mask) = eut_divisor_succ_count_mask_choice_coprime * eut_left_succ_count_mask_choice_coprime) -> (exists eut_right_succ_count_mask_choice_coprime. (n) = eut_divisor_succ_count_mask_choice_coprime * eut_right_succ_count_mask_choice_coprime) -> eut_divisor_succ_count_mask_choice_coprime = 1) /\ (eut_bit_succ_count_mask) = 0)))) /\ (exists fs_u_eut_succ_count_sum fs_v_eut_succ_count_sum. ((((exists fs_h_eut_succ_count_sum_body_start. fs_h_eut_succ_count_sum_body_start + S (0) = S ((S (0)) * fs_v_eut_succ_count_sum)) /\ exists fs_q_eut_succ_count_sum_body_start. fs_u_eut_succ_count_sum = fs_q_eut_succ_count_sum_body_start * S ((S (0)) * fs_v_eut_succ_count_sum) + (0))) /\ ((((exists fs_h_eut_succ_count_sum_body_terminal. fs_h_eut_succ_count_sum_body_terminal + S (t) = S ((S (S l)) * fs_v_eut_succ_count_sum)) /\ exists fs_q_eut_succ_count_sum_body_terminal. fs_u_eut_succ_count_sum = fs_q_eut_succ_count_sum_body_terminal * S ((S (S l)) * fs_v_eut_succ_count_sum) + (t))) /\ forall fs_i_eut_succ_count_sum_body_steps. (exists fs_lt_eut_succ_count_sum_body_steps_bound. fs_lt_eut_succ_count_sum_body_steps_bound + S fs_i_eut_succ_count_sum_body_steps = S l) -> exists fs_a_eut_succ_count_sum_body_steps fs_r_eut_succ_count_sum_body_steps fs_s_eut_succ_count_sum_body_steps. ((((exists fs_h_eut_succ_count_sum_body_steps_summand. fs_h_eut_succ_count_sum_body_steps_summand + S (fs_a_eut_succ_count_sum_body_steps) = S ((S (fs_i_eut_succ_count_sum_body_steps)) * eut_scale_succ_count)) /\ exists fs_q_eut_succ_count_sum_body_steps_summand. eut_code_succ_count = fs_q_eut_succ_count_sum_body_steps_summand * S ((S (fs_i_eut_succ_count_sum_body_steps)) * eut_scale_succ_count) + (fs_a_eut_succ_count_sum_body_steps))) /\ ((((exists fs_h_eut_succ_count_sum_body_steps_partial. fs_h_eut_succ_count_sum_body_steps_partial + S (fs_r_eut_succ_count_sum_body_steps) = S ((S (fs_i_eut_succ_count_sum_body_steps)) * fs_v_eut_succ_count_sum)) /\ exists fs_q_eut_succ_count_sum_body_steps_partial. fs_u_eut_succ_count_sum = fs_q_eut_succ_count_sum_body_steps_partial * S ((S (fs_i_eut_succ_count_sum_body_steps)) * fs_v_eut_succ_count_sum) + (fs_r_eut_succ_count_sum_body_steps))) /\ ((((exists fs_h_eut_succ_count_sum_body_steps_successor. fs_h_eut_succ_count_sum_body_steps_successor + S (fs_s_eut_succ_count_sum_body_steps) = S ((S (S fs_i_eut_succ_count_sum_body_steps)) * fs_v_eut_succ_count_sum)) /\ exists fs_q_eut_succ_count_sum_body_steps_successor. fs_u_eut_succ_count_sum = fs_q_eut_succ_count_sum_body_steps_successor * S ((S (S fs_i_eut_succ_count_sum_body_steps)) * fs_v_eut_succ_count_sum) + (fs_s_eut_succ_count_sum_body_steps))) /\ fs_s_eut_succ_count_sum_body_steps = fs_r_eut_succ_count_sum_body_steps + fs_a_eut_succ_count_sum_body_steps))))))) -> exists r e. (exists eut_code_succ_previous eut_scale_succ_previous. (forall eut_index_succ_previous_mask. (exists eut_gap_succ_previous_mask_bound. eut_gap_succ_previous_mask_bound + S (eut_index_succ_previous_mask) = (l)) -> exists eut_bit_succ_previous_mask. (((exists fs_h_eut_succ_previous_mask_entry. fs_h_eut_succ_previous_mask_entry + S (eut_bit_succ_previous_mask) = S ((S (eut_index_succ_previous_mask)) * eut_scale_succ_previous)) /\ exists fs_q_eut_succ_previous_mask_entry. eut_code_succ_previous = fs_q_eut_succ_previous_mask_entry * S ((S (eut_index_succ_previous_mask)) * eut_scale_succ_previous) + (eut_bit_succ_previous_mask))) /\ ((((forall eut_divisor_succ_previous_mask_choice_coprime. (exists eut_left_succ_previous_mask_choice_coprime. (eut_index_succ_previous_mask) = eut_divisor_succ_previous_mask_choice_coprime * eut_left_succ_previous_mask_choice_coprime) -> (exists eut_right_succ_previous_mask_choice_coprime. (n) = eut_divisor_succ_previous_mask_choice_coprime * eut_right_succ_previous_mask_choice_coprime) -> eut_divisor_succ_previous_mask_choice_coprime = 1) /\ (eut_bit_succ_previous_mask) = 1) \/ (~(forall eut_divisor_succ_previous_mask_choice_coprime. (exists eut_left_succ_previous_mask_choice_coprime. (eut_index_succ_previous_mask) = eut_divisor_succ_previous_mask_choice_coprime * eut_left_succ_previous_mask_choice_coprime) -> (exists eut_right_succ_previous_mask_choice_coprime. (n) = eut_divisor_succ_previous_mask_choice_coprime * eut_right_succ_previous_mask_choice_coprime) -> eut_divisor_succ_previous_mask_choice_coprime = 1) /\ (eut_bit_succ_previous_mask) = 0)))) /\ (exists fs_u_eut_succ_previous_sum fs_v_eut_succ_previous_sum. ((((exists fs_h_eut_succ_previous_sum_body_start. fs_h_eut_succ_previous_sum_body_start + S (0) = S ((S (0)) * fs_v_eut_succ_previous_sum)) /\ exists fs_q_eut_succ_previous_sum_body_start. fs_u_eut_succ_previous_sum = fs_q_eut_succ_previous_sum_body_start * S ((S (0)) * fs_v_eut_succ_previous_sum) + (0))) /\ ((((exists fs_h_eut_succ_previous_sum_body_terminal. fs_h_eut_succ_previous_sum_body_terminal + S (r) = S ((S (l)) * fs_v_eut_succ_previous_sum)) /\ exists fs_q_eut_succ_previous_sum_body_terminal. fs_u_eut_succ_previous_sum = fs_q_eut_succ_previous_sum_body_terminal * S ((S (l)) * fs_v_eut_succ_previous_sum) + (r))) /\ forall fs_i_eut_succ_previous_sum_body_steps. (exists fs_lt_eut_succ_previous_sum_body_steps_bound. fs_lt_eut_succ_previous_sum_body_steps_bound + S fs_i_eut_succ_previous_sum_body_steps = l) -> exists fs_a_eut_succ_previous_sum_body_steps fs_r_eut_succ_previous_sum_body_steps fs_s_eut_succ_previous_sum_body_steps. ((((exists fs_h_eut_succ_previous_sum_body_steps_summand. fs_h_eut_succ_previous_sum_body_steps_summand + S (fs_a_eut_succ_previous_sum_body_steps) = S ((S (fs_i_eut_succ_previous_sum_body_steps)) * eut_scale_succ_previous)) /\ exists fs_q_eut_succ_previous_sum_body_steps_summand. eut_code_succ_previous = fs_q_eut_succ_previous_sum_body_steps_summand * S ((S (fs_i_eut_succ_previous_sum_body_steps)) * eut_scale_succ_previous) + (fs_a_eut_succ_previous_sum_body_steps))) /\ ((((exists fs_h_eut_succ_previous_sum_body_steps_partial. fs_h_eut_succ_previous_sum_body_steps_partial + S (fs_r_eut_succ_previous_sum_body_steps) = S ((S (fs_i_eut_succ_previous_sum_body_steps)) * fs_v_eut_succ_previous_sum)) /\ exists fs_q_eut_succ_previous_sum_body_steps_partial. fs_u_eut_succ_previous_sum = fs_q_eut_succ_previous_sum_body_steps_partial * S ((S (fs_i_eut_succ_previous_sum_body_steps)) * fs_v_eut_succ_previous_sum) + (fs_r_eut_succ_previous_sum_body_steps))) /\ ((((exists fs_h_eut_succ_previous_sum_body_steps_successor. fs_h_eut_succ_previous_sum_body_steps_successor + S (fs_s_eut_succ_previous_sum_body_steps) = S ((S (S fs_i_eut_succ_previous_sum_body_steps)) * fs_v_eut_succ_previous_sum)) /\ exists fs_q_eut_succ_previous_sum_body_steps_successor. fs_u_eut_succ_previous_sum = fs_q_eut_succ_previous_sum_body_steps_successor * S ((S (S fs_i_eut_succ_previous_sum_body_steps)) * fs_v_eut_succ_previous_sum) + (fs_s_eut_succ_previous_sum_body_steps))) /\ fs_s_eut_succ_previous_sum_body_steps = fs_r_eut_succ_previous_sum_body_steps + fs_a_eut_succ_previous_sum_body_steps))))))) /\ (((((forall eut_divisor_succ_choice_coprime. (exists eut_left_succ_choice_coprime. (l) = eut_divisor_succ_choice_coprime * eut_left_succ_choice_coprime) -> (exists eut_right_succ_choice_coprime. (n) = eut_divisor_succ_choice_coprime * eut_right_succ_choice_coprime) -> eut_divisor_succ_choice_coprime = 1) /\ (e) = 1) \/ (~(forall eut_divisor_succ_choice_coprime. (exists eut_left_succ_choice_coprime. (l) = eut_divisor_succ_choice_coprime * eut_left_succ_choice_coprime) -> (exists eut_right_succ_choice_coprime. (n) = eut_divisor_succ_choice_coprime * eut_right_succ_choice_coprime) -> eut_divisor_succ_choice_coprime = 1) /\ (e) = 0))) /\ t=r+e)
totient_unit_count_zero_length
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 172; exact statement SHA-256 ab372cb899fff73c74b20fb0f23a98f2c9b522e38a384c38ed03f819f2694aa9
Exact first-order statement
forall n t. (exists eut_code_empty_count eut_scale_empty_count. (forall eut_index_empty_count_mask. (exists eut_gap_empty_count_mask_bound. eut_gap_empty_count_mask_bound + S (eut_index_empty_count_mask) = (0)) -> exists eut_bit_empty_count_mask. (((exists fs_h_eut_empty_count_mask_entry. fs_h_eut_empty_count_mask_entry + S (eut_bit_empty_count_mask) = S ((S (eut_index_empty_count_mask)) * eut_scale_empty_count)) /\ exists fs_q_eut_empty_count_mask_entry. eut_code_empty_count = fs_q_eut_empty_count_mask_entry * S ((S (eut_index_empty_count_mask)) * eut_scale_empty_count) + (eut_bit_empty_count_mask))) /\ ((((forall eut_divisor_empty_count_mask_choice_coprime. (exists eut_left_empty_count_mask_choice_coprime. (eut_index_empty_count_mask) = eut_divisor_empty_count_mask_choice_coprime * eut_left_empty_count_mask_choice_coprime) -> (exists eut_right_empty_count_mask_choice_coprime. (n) = eut_divisor_empty_count_mask_choice_coprime * eut_right_empty_count_mask_choice_coprime) -> eut_divisor_empty_count_mask_choice_coprime = 1) /\ (eut_bit_empty_count_mask) = 1) \/ (~(forall eut_divisor_empty_count_mask_choice_coprime. (exists eut_left_empty_count_mask_choice_coprime. (eut_index_empty_count_mask) = eut_divisor_empty_count_mask_choice_coprime * eut_left_empty_count_mask_choice_coprime) -> (exists eut_right_empty_count_mask_choice_coprime. (n) = eut_divisor_empty_count_mask_choice_coprime * eut_right_empty_count_mask_choice_coprime) -> eut_divisor_empty_count_mask_choice_coprime = 1) /\ (eut_bit_empty_count_mask) = 0)))) /\ (exists fs_u_eut_empty_count_sum fs_v_eut_empty_count_sum. ((((exists fs_h_eut_empty_count_sum_body_start. fs_h_eut_empty_count_sum_body_start + S (0) = S ((S (0)) * fs_v_eut_empty_count_sum)) /\ exists fs_q_eut_empty_count_sum_body_start. fs_u_eut_empty_count_sum = fs_q_eut_empty_count_sum_body_start * S ((S (0)) * fs_v_eut_empty_count_sum) + (0))) /\ ((((exists fs_h_eut_empty_count_sum_body_terminal. fs_h_eut_empty_count_sum_body_terminal + S (t) = S ((S (0)) * fs_v_eut_empty_count_sum)) /\ exists fs_q_eut_empty_count_sum_body_terminal. fs_u_eut_empty_count_sum = fs_q_eut_empty_count_sum_body_terminal * S ((S (0)) * fs_v_eut_empty_count_sum) + (t))) /\ forall fs_i_eut_empty_count_sum_body_steps. (exists fs_lt_eut_empty_count_sum_body_steps_bound. fs_lt_eut_empty_count_sum_body_steps_bound + S fs_i_eut_empty_count_sum_body_steps = 0) -> exists fs_a_eut_empty_count_sum_body_steps fs_r_eut_empty_count_sum_body_steps fs_s_eut_empty_count_sum_body_steps. ((((exists fs_h_eut_empty_count_sum_body_steps_summand. fs_h_eut_empty_count_sum_body_steps_summand + S (fs_a_eut_empty_count_sum_body_steps) = S ((S (fs_i_eut_empty_count_sum_body_steps)) * eut_scale_empty_count)) /\ exists fs_q_eut_empty_count_sum_body_steps_summand. eut_code_empty_count = fs_q_eut_empty_count_sum_body_steps_summand * S ((S (fs_i_eut_empty_count_sum_body_steps)) * eut_scale_empty_count) + (fs_a_eut_empty_count_sum_body_steps))) /\ ((((exists fs_h_eut_empty_count_sum_body_steps_partial. fs_h_eut_empty_count_sum_body_steps_partial + S (fs_r_eut_empty_count_sum_body_steps) = S ((S (fs_i_eut_empty_count_sum_body_steps)) * fs_v_eut_empty_count_sum)) /\ exists fs_q_eut_empty_count_sum_body_steps_partial. fs_u_eut_empty_count_sum = fs_q_eut_empty_count_sum_body_steps_partial * S ((S (fs_i_eut_empty_count_sum_body_steps)) * fs_v_eut_empty_count_sum) + (fs_r_eut_empty_count_sum_body_steps))) /\ ((((exists fs_h_eut_empty_count_sum_body_steps_successor. fs_h_eut_empty_count_sum_body_steps_successor + S (fs_s_eut_empty_count_sum_body_steps) = S ((S (S fs_i_eut_empty_count_sum_body_steps)) * fs_v_eut_empty_count_sum)) /\ exists fs_q_eut_empty_count_sum_body_steps_successor. fs_u_eut_empty_count_sum = fs_q_eut_empty_count_sum_body_steps_successor * S ((S (S fs_i_eut_empty_count_sum_body_steps)) * fs_v_eut_empty_count_sum) + (fs_s_eut_empty_count_sum_body_steps))) /\ fs_s_eut_empty_count_sum_body_steps = fs_r_eut_empty_count_sum_body_steps + fs_a_eut_empty_count_sum_body_steps))))))) -> t=0
zero_le
Read the exact inherited Alpha proof · freshly checked in this complete bundle; exact statement and bundle node below.
Bundle node 24; exact statement SHA-256 d3cad8d0d0ea07e339bdb8eb3b864e3511e648763977ff6882e77d60c984aa01
Exact first-order statement
forall n. 0 <= n