% TIMEFORMAT='%3R'; { time (exec 2>&1; /home/martin/bin/satallax -E /home/martin/.isabelle/contrib/e-2.5-1/x86_64-linux/eprover -p tstp -t 5 /home/martin/judgement-day/tptp-thf/tptp/FFT/prob_311__3225702_1 ) ; }
% This file was generated by Isabelle (most likely Sledgehammer)
% 2020-12-16 14:10:27.674

% Could-be-implicit typings (4)
thf(ty_n_t__Set__Oset_It__Nat__Onat_J, type,
    set_nat : $tType).
thf(ty_n_t__Complex__Ocomplex, type,
    complex : $tType).
thf(ty_n_t__Num__Onum, type,
    num : $tType).
thf(ty_n_t__Nat__Onat, type,
    nat : $tType).

% Explicit typings (20)
thf(sy_c_FFT__Mirabelle__ulikgskiun_ODFT, type,
    fFT_Mirabelle_DFT : nat > (nat > complex) > nat > complex).
thf(sy_c_FFT__Mirabelle__ulikgskiun_Oroot, type,
    fFT_Mirabelle_root : nat > complex).
thf(sy_c_Groups_Otimes__class_Otimes_001t__Complex__Ocomplex, type,
    times_times_complex : complex > complex > complex).
thf(sy_c_Groups_Otimes__class_Otimes_001t__Nat__Onat, type,
    times_times_nat : nat > nat > nat).
thf(sy_c_Groups_Otimes__class_Otimes_001t__Num__Onum, type,
    times_times_num : num > num > num).
thf(sy_c_Groups_Ozero__class_Ozero_001t__Complex__Ocomplex, type,
    zero_zero_complex : complex).
thf(sy_c_Groups_Ozero__class_Ozero_001t__Nat__Onat, type,
    zero_zero_nat : nat).
thf(sy_c_Groups__Big_Ocomm__monoid__add__class_Osum_001t__Nat__Onat_001t__Complex__Ocomplex, type,
    groups59700922omplex : (nat > complex) > set_nat > complex).
thf(sy_c_Nat_OSuc, type,
    suc : nat > nat).
thf(sy_c_Num_Onum_OBit0, type,
    bit0 : num > num).
thf(sy_c_Num_Onum_OOne, type,
    one : num).
thf(sy_c_Num_Onumeral__class_Onumeral_001t__Nat__Onat, type,
    numeral_numeral_nat : num > nat).
thf(sy_c_Orderings_Oord__class_Oless_001t__Nat__Onat, type,
    ord_less_nat : nat > nat > $o).
thf(sy_c_Orderings_Oord__class_Oless__eq_001t__Nat__Onat, type,
    ord_less_eq_nat : nat > nat > $o).
thf(sy_c_Power_Opower__class_Opower_001t__Complex__Ocomplex, type,
    power_power_complex : complex > nat > complex).
thf(sy_c_Power_Opower__class_Opower_001t__Nat__Onat, type,
    power_power_nat : nat > nat > nat).
thf(sy_c_Set__Interval_Oord__class_OatLeastLessThan_001t__Nat__Onat, type,
    set_or562006527an_nat : nat > nat > set_nat).
thf(sy_v_a, type,
    a : nat > complex).
thf(sy_v_i, type,
    i : nat).
thf(sy_v_m, type,
    m : nat).

% Relevant facts (143)
thf(fact_0_mbound, axiom,
    ((ord_less_nat @ zero_zero_nat @ m))). % mbound
thf(fact_1_ibound, axiom,
    ((ord_less_eq_nat @ m @ i))). % ibound
thf(fact_2_root__cancel1, axiom,
    ((![M : nat, I : nat, J : nat]: ((power_power_complex @ (fFT_Mirabelle_root @ (times_times_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ M)) @ (times_times_nat @ I @ (times_times_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ J))) = (power_power_complex @ (fFT_Mirabelle_root @ M) @ (times_times_nat @ I @ J)))))). % root_cancel1
thf(fact_3_zero__eq__power2, axiom,
    ((![A : complex]: (((power_power_complex @ A @ (numeral_numeral_nat @ (bit0 @ one))) = zero_zero_complex) = (A = zero_zero_complex))))). % zero_eq_power2
thf(fact_4_zero__eq__power2, axiom,
    ((![A : nat]: (((power_power_nat @ A @ (numeral_numeral_nat @ (bit0 @ one))) = zero_zero_nat) = (A = zero_zero_nat))))). % zero_eq_power2
thf(fact_5_mult__eq__1__iff, axiom,
    ((![M : nat, N : nat]: (((times_times_nat @ M @ N) = (suc @ zero_zero_nat)) = (((M = (suc @ zero_zero_nat))) & ((N = (suc @ zero_zero_nat)))))))). % mult_eq_1_iff
thf(fact_6_one__eq__mult__iff, axiom,
    ((![M : nat, N : nat]: (((suc @ zero_zero_nat) = (times_times_nat @ M @ N)) = (((M = (suc @ zero_zero_nat))) & ((N = (suc @ zero_zero_nat)))))))). % one_eq_mult_iff
thf(fact_7_power__Suc0__right, axiom,
    ((![A : complex]: ((power_power_complex @ A @ (suc @ zero_zero_nat)) = A)))). % power_Suc0_right
thf(fact_8_power__Suc0__right, axiom,
    ((![A : nat]: ((power_power_nat @ A @ (suc @ zero_zero_nat)) = A)))). % power_Suc0_right
thf(fact_9_power__zero__numeral, axiom,
    ((![K : num]: ((power_power_complex @ zero_zero_complex @ (numeral_numeral_nat @ K)) = zero_zero_complex)))). % power_zero_numeral
thf(fact_10_power__zero__numeral, axiom,
    ((![K : num]: ((power_power_nat @ zero_zero_nat @ (numeral_numeral_nat @ K)) = zero_zero_nat)))). % power_zero_numeral
thf(fact_11_power__0__Suc, axiom,
    ((![N : nat]: ((power_power_complex @ zero_zero_complex @ (suc @ N)) = zero_zero_complex)))). % power_0_Suc
thf(fact_12_power__0__Suc, axiom,
    ((![N : nat]: ((power_power_nat @ zero_zero_nat @ (suc @ N)) = zero_zero_nat)))). % power_0_Suc
thf(fact_13_power__odd__eq, axiom,
    ((![A : complex, N : nat]: ((power_power_complex @ A @ (suc @ (times_times_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ N))) = (times_times_complex @ A @ (power_power_complex @ (power_power_complex @ A @ N) @ (numeral_numeral_nat @ (bit0 @ one)))))))). % power_odd_eq
thf(fact_14_power__odd__eq, axiom,
    ((![A : nat, N : nat]: ((power_power_nat @ A @ (suc @ (times_times_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ N))) = (times_times_nat @ A @ (power_power_nat @ (power_power_nat @ A @ N) @ (numeral_numeral_nat @ (bit0 @ one)))))))). % power_odd_eq
thf(fact_15_DFT__def, axiom,
    ((fFT_Mirabelle_DFT = (^[N2 : nat]: (^[A2 : nat > complex]: (^[I2 : nat]: (groups59700922omplex @ (^[J2 : nat]: (times_times_complex @ (power_power_complex @ (fFT_Mirabelle_root @ N2) @ (times_times_nat @ I2 @ J2)) @ (A2 @ J2))) @ (set_or562006527an_nat @ zero_zero_nat @ N2)))))))). % DFT_def
thf(fact_16_sum_Oneutral__const, axiom,
    ((![A3 : set_nat]: ((groups59700922omplex @ (^[Uu : nat]: zero_zero_complex) @ A3) = zero_zero_complex)))). % sum.neutral_const
thf(fact_17_mult__is__0, axiom,
    ((![M : nat, N : nat]: (((times_times_nat @ M @ N) = zero_zero_nat) = (((M = zero_zero_nat)) | ((N = zero_zero_nat))))))). % mult_is_0
thf(fact_18_mult__0__right, axiom,
    ((![M : nat]: ((times_times_nat @ M @ zero_zero_nat) = zero_zero_nat)))). % mult_0_right
thf(fact_19_mult__cancel1, axiom,
    ((![K : nat, M : nat, N : nat]: (((times_times_nat @ K @ M) = (times_times_nat @ K @ N)) = (((M = N)) | ((K = zero_zero_nat))))))). % mult_cancel1
thf(fact_20_old_Onat_Oinject, axiom,
    ((![Nat : nat, Nat2 : nat]: (((suc @ Nat) = (suc @ Nat2)) = (Nat = Nat2))))). % old.nat.inject
thf(fact_21_nat_Oinject, axiom,
    ((![X2 : nat, Y2 : nat]: (((suc @ X2) = (suc @ Y2)) = (X2 = Y2))))). % nat.inject
thf(fact_22_nat__power__eq__Suc__0__iff, axiom,
    ((![X : nat, M : nat]: (((power_power_nat @ X @ M) = (suc @ zero_zero_nat)) = (((M = zero_zero_nat)) | ((X = (suc @ zero_zero_nat)))))))). % nat_power_eq_Suc_0_iff
thf(fact_23_power__Suc__0, axiom,
    ((![N : nat]: ((power_power_nat @ (suc @ zero_zero_nat) @ N) = (suc @ zero_zero_nat))))). % power_Suc_0
thf(fact_24_power__mult__numeral, axiom,
    ((![A : complex, M : num, N : num]: ((power_power_complex @ (power_power_complex @ A @ (numeral_numeral_nat @ M)) @ (numeral_numeral_nat @ N)) = (power_power_complex @ A @ (numeral_numeral_nat @ (times_times_num @ M @ N))))))). % power_mult_numeral
thf(fact_25_power__mult__numeral, axiom,
    ((![A : nat, M : num, N : num]: ((power_power_nat @ (power_power_nat @ A @ (numeral_numeral_nat @ M)) @ (numeral_numeral_nat @ N)) = (power_power_nat @ A @ (numeral_numeral_nat @ (times_times_num @ M @ N))))))). % power_mult_numeral
thf(fact_26_nat__zero__less__power__iff, axiom,
    ((![X : nat, N : nat]: ((ord_less_nat @ zero_zero_nat @ (power_power_nat @ X @ N)) = (((ord_less_nat @ zero_zero_nat @ X)) | ((N = zero_zero_nat))))))). % nat_zero_less_power_iff
thf(fact_27_bot__nat__0_Onot__eq__extremum, axiom,
    ((![A : nat]: ((~ ((A = zero_zero_nat))) = (ord_less_nat @ zero_zero_nat @ A))))). % bot_nat_0.not_eq_extremum
thf(fact_28_less__nat__zero__code, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % less_nat_zero_code
thf(fact_29_neq0__conv, axiom,
    ((![N : nat]: ((~ ((N = zero_zero_nat))) = (ord_less_nat @ zero_zero_nat @ N))))). % neq0_conv
thf(fact_30_Suc__less__eq, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ (suc @ M) @ (suc @ N)) = (ord_less_nat @ M @ N))))). % Suc_less_eq
thf(fact_31_Suc__mono, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (ord_less_nat @ (suc @ M) @ (suc @ N)))))). % Suc_mono
thf(fact_32_lessI, axiom,
    ((![N : nat]: (ord_less_nat @ N @ (suc @ N))))). % lessI
thf(fact_33_bot__nat__0_Oextremum, axiom,
    ((![A : nat]: (ord_less_eq_nat @ zero_zero_nat @ A)))). % bot_nat_0.extremum
thf(fact_34_le0, axiom,
    ((![N : nat]: (ord_less_eq_nat @ zero_zero_nat @ N)))). % le0
thf(fact_35_Suc__le__mono, axiom,
    ((![N : nat, M : nat]: ((ord_less_eq_nat @ (suc @ N) @ (suc @ M)) = (ord_less_eq_nat @ N @ M))))). % Suc_le_mono
thf(fact_36_mult__cancel2, axiom,
    ((![M : nat, K : nat, N : nat]: (((times_times_nat @ M @ K) = (times_times_nat @ N @ K)) = (((M = N)) | ((K = zero_zero_nat))))))). % mult_cancel2
thf(fact_37_zero__less__Suc, axiom,
    ((![N : nat]: (ord_less_nat @ zero_zero_nat @ (suc @ N))))). % zero_less_Suc
thf(fact_38_less__Suc0, axiom,
    ((![N : nat]: ((ord_less_nat @ N @ (suc @ zero_zero_nat)) = (N = zero_zero_nat))))). % less_Suc0
thf(fact_39_nat__0__less__mult__iff, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ zero_zero_nat @ (times_times_nat @ M @ N)) = (((ord_less_nat @ zero_zero_nat @ M)) & ((ord_less_nat @ zero_zero_nat @ N))))))). % nat_0_less_mult_iff
thf(fact_40_mult__less__cancel2, axiom,
    ((![M : nat, K : nat, N : nat]: ((ord_less_nat @ (times_times_nat @ M @ K) @ (times_times_nat @ N @ K)) = (((ord_less_nat @ zero_zero_nat @ K)) & ((ord_less_nat @ M @ N))))))). % mult_less_cancel2
thf(fact_41_power__eq__0__iff, axiom,
    ((![A : complex, N : nat]: (((power_power_complex @ A @ N) = zero_zero_complex) = (((A = zero_zero_complex)) & ((ord_less_nat @ zero_zero_nat @ N))))))). % power_eq_0_iff
thf(fact_42_power__eq__0__iff, axiom,
    ((![A : nat, N : nat]: (((power_power_nat @ A @ N) = zero_zero_nat) = (((A = zero_zero_nat)) & ((ord_less_nat @ zero_zero_nat @ N))))))). % power_eq_0_iff
thf(fact_43_one__le__mult__iff, axiom,
    ((![M : nat, N : nat]: ((ord_less_eq_nat @ (suc @ zero_zero_nat) @ (times_times_nat @ M @ N)) = (((ord_less_eq_nat @ (suc @ zero_zero_nat) @ M)) & ((ord_less_eq_nat @ (suc @ zero_zero_nat) @ N))))))). % one_le_mult_iff
thf(fact_44_mult__le__cancel2, axiom,
    ((![M : nat, K : nat, N : nat]: ((ord_less_eq_nat @ (times_times_nat @ M @ K) @ (times_times_nat @ N @ K)) = (((ord_less_nat @ zero_zero_nat @ K)) => ((ord_less_eq_nat @ M @ N))))))). % mult_le_cancel2
thf(fact_45_power__mono__iff, axiom,
    ((![A : nat, B : nat, N : nat]: ((ord_less_eq_nat @ zero_zero_nat @ A) => ((ord_less_eq_nat @ zero_zero_nat @ B) => ((ord_less_nat @ zero_zero_nat @ N) => ((ord_less_eq_nat @ (power_power_nat @ A @ N) @ (power_power_nat @ B @ N)) = (ord_less_eq_nat @ A @ B)))))))). % power_mono_iff
thf(fact_46_power2__eq__iff__nonneg, axiom,
    ((![X : nat, Y : nat]: ((ord_less_eq_nat @ zero_zero_nat @ X) => ((ord_less_eq_nat @ zero_zero_nat @ Y) => (((power_power_nat @ X @ (numeral_numeral_nat @ (bit0 @ one))) = (power_power_nat @ Y @ (numeral_numeral_nat @ (bit0 @ one)))) = (X = Y))))))). % power2_eq_iff_nonneg
thf(fact_47_Suc__leI, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (ord_less_eq_nat @ (suc @ M) @ N))))). % Suc_leI
thf(fact_48_le__refl, axiom,
    ((![N : nat]: (ord_less_eq_nat @ N @ N)))). % le_refl
thf(fact_49_le__trans, axiom,
    ((![I : nat, J : nat, K : nat]: ((ord_less_eq_nat @ I @ J) => ((ord_less_eq_nat @ J @ K) => (ord_less_eq_nat @ I @ K)))))). % le_trans
thf(fact_50_Suc__le__eq, axiom,
    ((![M : nat, N : nat]: ((ord_less_eq_nat @ (suc @ M) @ N) = (ord_less_nat @ M @ N))))). % Suc_le_eq
thf(fact_51_eq__imp__le, axiom,
    ((![M : nat, N : nat]: ((M = N) => (ord_less_eq_nat @ M @ N))))). % eq_imp_le
thf(fact_52_dec__induct, axiom,
    ((![I : nat, J : nat, P : nat > $o]: ((ord_less_eq_nat @ I @ J) => ((P @ I) => ((![N3 : nat]: ((ord_less_eq_nat @ I @ N3) => ((ord_less_nat @ N3 @ J) => ((P @ N3) => (P @ (suc @ N3)))))) => (P @ J))))))). % dec_induct
thf(fact_53_inc__induct, axiom,
    ((![I : nat, J : nat, P : nat > $o]: ((ord_less_eq_nat @ I @ J) => ((P @ J) => ((![N3 : nat]: ((ord_less_eq_nat @ I @ N3) => ((ord_less_nat @ N3 @ J) => ((P @ (suc @ N3)) => (P @ N3))))) => (P @ I))))))). % inc_induct
thf(fact_54_le__antisym, axiom,
    ((![M : nat, N : nat]: ((ord_less_eq_nat @ M @ N) => ((ord_less_eq_nat @ N @ M) => (M = N)))))). % le_antisym
thf(fact_55_nat__less__le, axiom,
    ((ord_less_nat = (^[M2 : nat]: (^[N2 : nat]: (((ord_less_eq_nat @ M2 @ N2)) & ((~ ((M2 = N2)))))))))). % nat_less_le
thf(fact_56_nat__neq__iff, axiom,
    ((![M : nat, N : nat]: ((~ ((M = N))) = (((ord_less_nat @ M @ N)) | ((ord_less_nat @ N @ M))))))). % nat_neq_iff
thf(fact_57_Suc__le__lessD, axiom,
    ((![M : nat, N : nat]: ((ord_less_eq_nat @ (suc @ M) @ N) => (ord_less_nat @ M @ N))))). % Suc_le_lessD
thf(fact_58_less__not__refl, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ N)))))). % less_not_refl
thf(fact_59_nat__le__linear, axiom,
    ((![M : nat, N : nat]: ((ord_less_eq_nat @ M @ N) | (ord_less_eq_nat @ N @ M))))). % nat_le_linear
thf(fact_60_le__less__Suc__eq, axiom,
    ((![M : nat, N : nat]: ((ord_less_eq_nat @ M @ N) => ((ord_less_nat @ N @ (suc @ M)) = (N = M)))))). % le_less_Suc_eq
thf(fact_61_less__Suc__eq__le, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ (suc @ N)) = (ord_less_eq_nat @ M @ N))))). % less_Suc_eq_le
thf(fact_62_less__eq__Suc__le, axiom,
    ((ord_less_nat = (^[N2 : nat]: (ord_less_eq_nat @ (suc @ N2)))))). % less_eq_Suc_le
thf(fact_63_less__not__refl2, axiom,
    ((![N : nat, M : nat]: ((ord_less_nat @ N @ M) => (~ ((M = N))))))). % less_not_refl2
thf(fact_64_less__not__refl3, axiom,
    ((![S : nat, T : nat]: ((ord_less_nat @ S @ T) => (~ ((S = T))))))). % less_not_refl3
thf(fact_65_ex__least__nat__le, axiom,
    ((![P : nat > $o, N : nat]: ((P @ N) => ((~ ((P @ zero_zero_nat))) => (?[K2 : nat]: ((ord_less_eq_nat @ K2 @ N) & ((![I3 : nat]: ((ord_less_nat @ I3 @ K2) => (~ ((P @ I3))))) & (P @ K2))))))))). % ex_least_nat_le
thf(fact_66_le__imp__less__Suc, axiom,
    ((![M : nat, N : nat]: ((ord_less_eq_nat @ M @ N) => (ord_less_nat @ M @ (suc @ N)))))). % le_imp_less_Suc
thf(fact_67_less__imp__le__nat, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (ord_less_eq_nat @ M @ N))))). % less_imp_le_nat
thf(fact_68_less__irrefl__nat, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ N)))))). % less_irrefl_nat
thf(fact_69_nat__less__induct, axiom,
    ((![P : nat > $o, N : nat]: ((![N3 : nat]: ((![M3 : nat]: ((ord_less_nat @ M3 @ N3) => (P @ M3))) => (P @ N3))) => (P @ N))))). % nat_less_induct
thf(fact_70_infinite__descent, axiom,
    ((![P : nat > $o, N : nat]: ((![N3 : nat]: ((~ ((P @ N3))) => (?[M3 : nat]: ((ord_less_nat @ M3 @ N3) & (~ ((P @ M3))))))) => (P @ N))))). % infinite_descent
thf(fact_71_le__eq__less__or__eq, axiom,
    ((ord_less_eq_nat = (^[M2 : nat]: (^[N2 : nat]: (((ord_less_nat @ M2 @ N2)) | ((M2 = N2)))))))). % le_eq_less_or_eq
thf(fact_72_less__or__eq__imp__le, axiom,
    ((![M : nat, N : nat]: (((ord_less_nat @ M @ N) | (M = N)) => (ord_less_eq_nat @ M @ N))))). % less_or_eq_imp_le
thf(fact_73_linorder__neqE__nat, axiom,
    ((![X : nat, Y : nat]: ((~ ((X = Y))) => ((~ ((ord_less_nat @ X @ Y))) => (ord_less_nat @ Y @ X)))))). % linorder_neqE_nat
thf(fact_74_Nat_Oex__has__greatest__nat, axiom,
    ((![P : nat > $o, K : nat, B : nat]: ((P @ K) => ((![Y3 : nat]: ((P @ Y3) => (ord_less_eq_nat @ Y3 @ B))) => (?[X3 : nat]: ((P @ X3) & (![Y4 : nat]: ((P @ Y4) => (ord_less_eq_nat @ Y4 @ X3)))))))))). % Nat.ex_has_greatest_nat
thf(fact_75_le__neq__implies__less, axiom,
    ((![M : nat, N : nat]: ((ord_less_eq_nat @ M @ N) => ((~ ((M = N))) => (ord_less_nat @ M @ N)))))). % le_neq_implies_less
thf(fact_76_less__mono__imp__le__mono, axiom,
    ((![F : nat > nat, I : nat, J : nat]: ((![I4 : nat, J3 : nat]: ((ord_less_nat @ I4 @ J3) => (ord_less_nat @ (F @ I4) @ (F @ J3)))) => ((ord_less_eq_nat @ I @ J) => (ord_less_eq_nat @ (F @ I) @ (F @ J))))))). % less_mono_imp_le_mono
thf(fact_77_nat__power__less__imp__less, axiom,
    ((![I : nat, M : nat, N : nat]: ((ord_less_nat @ zero_zero_nat @ I) => ((ord_less_nat @ (power_power_nat @ I @ M) @ (power_power_nat @ I @ N)) => (ord_less_nat @ M @ N)))))). % nat_power_less_imp_less
thf(fact_78_lift__Suc__mono__le, axiom,
    ((![F : nat > nat, N : nat, N4 : nat]: ((![N3 : nat]: (ord_less_eq_nat @ (F @ N3) @ (F @ (suc @ N3)))) => ((ord_less_eq_nat @ N @ N4) => (ord_less_eq_nat @ (F @ N) @ (F @ N4))))))). % lift_Suc_mono_le
thf(fact_79_lift__Suc__mono__less, axiom,
    ((![F : nat > nat, N : nat, N4 : nat]: ((![N3 : nat]: (ord_less_nat @ (F @ N3) @ (F @ (suc @ N3)))) => ((ord_less_nat @ N @ N4) => (ord_less_nat @ (F @ N) @ (F @ N4))))))). % lift_Suc_mono_less
thf(fact_80_lift__Suc__antimono__le, axiom,
    ((![F : nat > nat, N : nat, N4 : nat]: ((![N3 : nat]: (ord_less_eq_nat @ (F @ (suc @ N3)) @ (F @ N3))) => ((ord_less_eq_nat @ N @ N4) => (ord_less_eq_nat @ (F @ N4) @ (F @ N))))))). % lift_Suc_antimono_le
thf(fact_81_lift__Suc__mono__less__iff, axiom,
    ((![F : nat > nat, N : nat, M : nat]: ((![N3 : nat]: (ord_less_nat @ (F @ N3) @ (F @ (suc @ N3)))) => ((ord_less_nat @ (F @ N) @ (F @ M)) = (ord_less_nat @ N @ M)))))). % lift_Suc_mono_less_iff
thf(fact_82_bot__nat__0_Oextremum__strict, axiom,
    ((![A : nat]: (~ ((ord_less_nat @ A @ zero_zero_nat)))))). % bot_nat_0.extremum_strict
thf(fact_83_infinite__descent0, axiom,
    ((![P : nat > $o, N : nat]: ((P @ zero_zero_nat) => ((![N3 : nat]: ((ord_less_nat @ zero_zero_nat @ N3) => ((~ ((P @ N3))) => (?[M3 : nat]: ((ord_less_nat @ M3 @ N3) & (~ ((P @ M3)))))))) => (P @ N)))))). % infinite_descent0
thf(fact_84_gr__implies__not0, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (~ ((N = zero_zero_nat))))))). % gr_implies_not0
thf(fact_85_less__zeroE, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % less_zeroE
thf(fact_86_not__less0, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % not_less0
thf(fact_87_not__gr0, axiom,
    ((![N : nat]: ((~ ((ord_less_nat @ zero_zero_nat @ N))) = (N = zero_zero_nat))))). % not_gr0
thf(fact_88_gr0I, axiom,
    ((![N : nat]: ((~ ((N = zero_zero_nat))) => (ord_less_nat @ zero_zero_nat @ N))))). % gr0I
thf(fact_89_not__less__less__Suc__eq, axiom,
    ((![N : nat, M : nat]: ((~ ((ord_less_nat @ N @ M))) => ((ord_less_nat @ N @ (suc @ M)) = (N = M)))))). % not_less_less_Suc_eq
thf(fact_90_strict__inc__induct, axiom,
    ((![I : nat, J : nat, P : nat > $o]: ((ord_less_nat @ I @ J) => ((![I4 : nat]: ((J = (suc @ I4)) => (P @ I4))) => ((![I4 : nat]: ((ord_less_nat @ I4 @ J) => ((P @ (suc @ I4)) => (P @ I4)))) => (P @ I))))))). % strict_inc_induct
thf(fact_91_less__Suc__induct, axiom,
    ((![I : nat, J : nat, P : nat > nat > $o]: ((ord_less_nat @ I @ J) => ((![I4 : nat]: (P @ I4 @ (suc @ I4))) => ((![I4 : nat, J3 : nat, K2 : nat]: ((ord_less_nat @ I4 @ J3) => ((ord_less_nat @ J3 @ K2) => ((P @ I4 @ J3) => ((P @ J3 @ K2) => (P @ I4 @ K2)))))) => (P @ I @ J))))))). % less_Suc_induct
thf(fact_92_less__trans__Suc, axiom,
    ((![I : nat, J : nat, K : nat]: ((ord_less_nat @ I @ J) => ((ord_less_nat @ J @ K) => (ord_less_nat @ (suc @ I) @ K)))))). % less_trans_Suc
thf(fact_93_Suc__less__SucD, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ (suc @ M) @ (suc @ N)) => (ord_less_nat @ M @ N))))). % Suc_less_SucD
thf(fact_94_less__antisym, axiom,
    ((![N : nat, M : nat]: ((~ ((ord_less_nat @ N @ M))) => ((ord_less_nat @ N @ (suc @ M)) => (M = N)))))). % less_antisym
thf(fact_95_Suc__less__eq2, axiom,
    ((![N : nat, M : nat]: ((ord_less_nat @ (suc @ N) @ M) = (?[M4 : nat]: (((M = (suc @ M4))) & ((ord_less_nat @ N @ M4)))))))). % Suc_less_eq2
thf(fact_96_All__less__Suc, axiom,
    ((![N : nat, P : nat > $o]: ((![I2 : nat]: (((ord_less_nat @ I2 @ (suc @ N))) => ((P @ I2)))) = (((P @ N)) & ((![I2 : nat]: (((ord_less_nat @ I2 @ N)) => ((P @ I2)))))))))). % All_less_Suc
thf(fact_97_not__less__eq, axiom,
    ((![M : nat, N : nat]: ((~ ((ord_less_nat @ M @ N))) = (ord_less_nat @ N @ (suc @ M)))))). % not_less_eq
thf(fact_98_less__Suc__eq, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ (suc @ N)) = (((ord_less_nat @ M @ N)) | ((M = N))))))). % less_Suc_eq
thf(fact_99_Ex__less__Suc, axiom,
    ((![N : nat, P : nat > $o]: ((?[I2 : nat]: (((ord_less_nat @ I2 @ (suc @ N))) & ((P @ I2)))) = (((P @ N)) | ((?[I2 : nat]: (((ord_less_nat @ I2 @ N)) & ((P @ I2)))))))))). % Ex_less_Suc
thf(fact_100_less__SucI, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (ord_less_nat @ M @ (suc @ N)))))). % less_SucI
thf(fact_101_less__SucE, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ (suc @ N)) => ((~ ((ord_less_nat @ M @ N))) => (M = N)))))). % less_SucE
thf(fact_102_Suc__lessI, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => ((~ (((suc @ M) = N))) => (ord_less_nat @ (suc @ M) @ N)))))). % Suc_lessI
thf(fact_103_Suc__lessE, axiom,
    ((![I : nat, K : nat]: ((ord_less_nat @ (suc @ I) @ K) => (~ ((![J3 : nat]: ((ord_less_nat @ I @ J3) => (~ ((K = (suc @ J3)))))))))))). % Suc_lessE
thf(fact_104_Suc__lessD, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ (suc @ M) @ N) => (ord_less_nat @ M @ N))))). % Suc_lessD
thf(fact_105_Nat_OlessE, axiom,
    ((![I : nat, K : nat]: ((ord_less_nat @ I @ K) => ((~ ((K = (suc @ I)))) => (~ ((![J3 : nat]: ((ord_less_nat @ I @ J3) => (~ ((K = (suc @ J3))))))))))))). % Nat.lessE
thf(fact_106_bot__nat__0_Oextremum__uniqueI, axiom,
    ((![A : nat]: ((ord_less_eq_nat @ A @ zero_zero_nat) => (A = zero_zero_nat))))). % bot_nat_0.extremum_uniqueI
thf(fact_107_bot__nat__0_Oextremum__unique, axiom,
    ((![A : nat]: ((ord_less_eq_nat @ A @ zero_zero_nat) = (A = zero_zero_nat))))). % bot_nat_0.extremum_unique
thf(fact_108_le__0__eq, axiom,
    ((![N : nat]: ((ord_less_eq_nat @ N @ zero_zero_nat) = (N = zero_zero_nat))))). % le_0_eq
thf(fact_109_less__eq__nat_Osimps_I1_J, axiom,
    ((![N : nat]: (ord_less_eq_nat @ zero_zero_nat @ N)))). % less_eq_nat.simps(1)
thf(fact_110_transitive__stepwise__le, axiom,
    ((![M : nat, N : nat, R : nat > nat > $o]: ((ord_less_eq_nat @ M @ N) => ((![X3 : nat]: (R @ X3 @ X3)) => ((![X3 : nat, Y3 : nat, Z : nat]: ((R @ X3 @ Y3) => ((R @ Y3 @ Z) => (R @ X3 @ Z)))) => ((![N3 : nat]: (R @ N3 @ (suc @ N3))) => (R @ M @ N)))))))). % transitive_stepwise_le
thf(fact_111_nat__induct__at__least, axiom,
    ((![M : nat, N : nat, P : nat > $o]: ((ord_less_eq_nat @ M @ N) => ((P @ M) => ((![N3 : nat]: ((ord_less_eq_nat @ M @ N3) => ((P @ N3) => (P @ (suc @ N3))))) => (P @ N))))))). % nat_induct_at_least
thf(fact_112_full__nat__induct, axiom,
    ((![P : nat > $o, N : nat]: ((![N3 : nat]: ((![M3 : nat]: ((ord_less_eq_nat @ (suc @ M3) @ N3) => (P @ M3))) => (P @ N3))) => (P @ N))))). % full_nat_induct
thf(fact_113_not__less__eq__eq, axiom,
    ((![M : nat, N : nat]: ((~ ((ord_less_eq_nat @ M @ N))) = (ord_less_eq_nat @ (suc @ N) @ M))))). % not_less_eq_eq
thf(fact_114_Suc__n__not__le__n, axiom,
    ((![N : nat]: (~ ((ord_less_eq_nat @ (suc @ N) @ N)))))). % Suc_n_not_le_n
thf(fact_115_le__Suc__eq, axiom,
    ((![M : nat, N : nat]: ((ord_less_eq_nat @ M @ (suc @ N)) = (((ord_less_eq_nat @ M @ N)) | ((M = (suc @ N)))))))). % le_Suc_eq
thf(fact_116_Suc__le__D, axiom,
    ((![N : nat, M5 : nat]: ((ord_less_eq_nat @ (suc @ N) @ M5) => (?[M6 : nat]: (M5 = (suc @ M6))))))). % Suc_le_D
thf(fact_117_le__SucI, axiom,
    ((![M : nat, N : nat]: ((ord_less_eq_nat @ M @ N) => (ord_less_eq_nat @ M @ (suc @ N)))))). % le_SucI
thf(fact_118_le__SucE, axiom,
    ((![M : nat, N : nat]: ((ord_less_eq_nat @ M @ (suc @ N)) => ((~ ((ord_less_eq_nat @ M @ N))) => (M = (suc @ N))))))). % le_SucE
thf(fact_119_Suc__leD, axiom,
    ((![M : nat, N : nat]: ((ord_less_eq_nat @ (suc @ M) @ N) => (ord_less_eq_nat @ M @ N))))). % Suc_leD
thf(fact_120_mult__le__mono2, axiom,
    ((![I : nat, J : nat, K : nat]: ((ord_less_eq_nat @ I @ J) => (ord_less_eq_nat @ (times_times_nat @ K @ I) @ (times_times_nat @ K @ J)))))). % mult_le_mono2
thf(fact_121_mult__le__mono1, axiom,
    ((![I : nat, J : nat, K : nat]: ((ord_less_eq_nat @ I @ J) => (ord_less_eq_nat @ (times_times_nat @ I @ K) @ (times_times_nat @ J @ K)))))). % mult_le_mono1
thf(fact_122_mult__le__mono, axiom,
    ((![I : nat, J : nat, K : nat, L : nat]: ((ord_less_eq_nat @ I @ J) => ((ord_less_eq_nat @ K @ L) => (ord_less_eq_nat @ (times_times_nat @ I @ K) @ (times_times_nat @ J @ L))))))). % mult_le_mono
thf(fact_123_le__square, axiom,
    ((![M : nat]: (ord_less_eq_nat @ M @ (times_times_nat @ M @ M))))). % le_square
thf(fact_124_le__cube, axiom,
    ((![M : nat]: (ord_less_eq_nat @ M @ (times_times_nat @ M @ (times_times_nat @ M @ M)))))). % le_cube
thf(fact_125_power__less__imp__less__base, axiom,
    ((![A : nat, N : nat, B : nat]: ((ord_less_nat @ (power_power_nat @ A @ N) @ (power_power_nat @ B @ N)) => ((ord_less_eq_nat @ zero_zero_nat @ B) => (ord_less_nat @ A @ B)))))). % power_less_imp_less_base
thf(fact_126_power__gt__expt, axiom,
    ((![N : nat, K : nat]: ((ord_less_nat @ (suc @ zero_zero_nat) @ N) => (ord_less_nat @ K @ (power_power_nat @ N @ K)))))). % power_gt_expt
thf(fact_127_nat__one__le__power, axiom,
    ((![I : nat, N : nat]: ((ord_less_eq_nat @ (suc @ zero_zero_nat) @ I) => (ord_less_eq_nat @ (suc @ zero_zero_nat) @ (power_power_nat @ I @ N)))))). % nat_one_le_power
thf(fact_128_ex__least__nat__less, axiom,
    ((![P : nat > $o, N : nat]: ((P @ N) => ((~ ((P @ zero_zero_nat))) => (?[K2 : nat]: ((ord_less_nat @ K2 @ N) & ((![I3 : nat]: ((ord_less_eq_nat @ I3 @ K2) => (~ ((P @ I3))))) & (P @ (suc @ K2)))))))))). % ex_least_nat_less
thf(fact_129_power__strict__mono, axiom,
    ((![A : nat, B : nat, N : nat]: ((ord_less_nat @ A @ B) => ((ord_less_eq_nat @ zero_zero_nat @ A) => ((ord_less_nat @ zero_zero_nat @ N) => (ord_less_nat @ (power_power_nat @ A @ N) @ (power_power_nat @ B @ N)))))))). % power_strict_mono
thf(fact_130_power__eq__imp__eq__base, axiom,
    ((![A : nat, N : nat, B : nat]: (((power_power_nat @ A @ N) = (power_power_nat @ B @ N)) => ((ord_less_eq_nat @ zero_zero_nat @ A) => ((ord_less_eq_nat @ zero_zero_nat @ B) => ((ord_less_nat @ zero_zero_nat @ N) => (A = B)))))))). % power_eq_imp_eq_base
thf(fact_131_power__eq__iff__eq__base, axiom,
    ((![N : nat, A : nat, B : nat]: ((ord_less_nat @ zero_zero_nat @ N) => ((ord_less_eq_nat @ zero_zero_nat @ A) => ((ord_less_eq_nat @ zero_zero_nat @ B) => (((power_power_nat @ A @ N) = (power_power_nat @ B @ N)) = (A = B)))))))). % power_eq_iff_eq_base
thf(fact_132_power2__nat__le__imp__le, axiom,
    ((![M : nat, N : nat]: ((ord_less_eq_nat @ (power_power_nat @ M @ (numeral_numeral_nat @ (bit0 @ one))) @ N) => (ord_less_eq_nat @ M @ N))))). % power2_nat_le_imp_le
thf(fact_133_power2__nat__le__eq__le, axiom,
    ((![M : nat, N : nat]: ((ord_less_eq_nat @ (power_power_nat @ M @ (numeral_numeral_nat @ (bit0 @ one))) @ (power_power_nat @ N @ (numeral_numeral_nat @ (bit0 @ one)))) = (ord_less_eq_nat @ M @ N))))). % power2_nat_le_eq_le
thf(fact_134_self__le__ge2__pow, axiom,
    ((![K : nat, M : nat]: ((ord_less_eq_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ K) => (ord_less_eq_nat @ M @ (power_power_nat @ K @ M)))))). % self_le_ge2_pow
thf(fact_135_zero__less__power, axiom,
    ((![A : nat, N : nat]: ((ord_less_nat @ zero_zero_nat @ A) => (ord_less_nat @ zero_zero_nat @ (power_power_nat @ A @ N)))))). % zero_less_power
thf(fact_136_zero__le__power, axiom,
    ((![A : nat, N : nat]: ((ord_less_eq_nat @ zero_zero_nat @ A) => (ord_less_eq_nat @ zero_zero_nat @ (power_power_nat @ A @ N)))))). % zero_le_power
thf(fact_137_power__mono, axiom,
    ((![A : nat, B : nat, N : nat]: ((ord_less_eq_nat @ A @ B) => ((ord_less_eq_nat @ zero_zero_nat @ A) => (ord_less_eq_nat @ (power_power_nat @ A @ N) @ (power_power_nat @ B @ N))))))). % power_mono
thf(fact_138_less__Suc__eq__0__disj, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ (suc @ N)) = (((M = zero_zero_nat)) | ((?[J2 : nat]: (((M = (suc @ J2))) & ((ord_less_nat @ J2 @ N)))))))))). % less_Suc_eq_0_disj
thf(fact_139_gr0__implies__Suc, axiom,
    ((![N : nat]: ((ord_less_nat @ zero_zero_nat @ N) => (?[M6 : nat]: (N = (suc @ M6))))))). % gr0_implies_Suc
thf(fact_140_All__less__Suc2, axiom,
    ((![N : nat, P : nat > $o]: ((![I2 : nat]: (((ord_less_nat @ I2 @ (suc @ N))) => ((P @ I2)))) = (((P @ zero_zero_nat)) & ((![I2 : nat]: (((ord_less_nat @ I2 @ N)) => ((P @ (suc @ I2))))))))))). % All_less_Suc2
thf(fact_141_gr0__conv__Suc, axiom,
    ((![N : nat]: ((ord_less_nat @ zero_zero_nat @ N) = (?[M2 : nat]: (N = (suc @ M2))))))). % gr0_conv_Suc
thf(fact_142_Ex__less__Suc2, axiom,
    ((![N : nat, P : nat > $o]: ((?[I2 : nat]: (((ord_less_nat @ I2 @ (suc @ N))) & ((P @ I2)))) = (((P @ zero_zero_nat)) | ((?[I2 : nat]: (((ord_less_nat @ I2 @ N)) & ((P @ (suc @ I2))))))))))). % Ex_less_Suc2

% Conjectures (1)
thf(conj_0, conjecture,
    (((groups59700922omplex @ (^[J2 : nat]: (times_times_complex @ (times_times_complex @ (power_power_complex @ (fFT_Mirabelle_root @ (times_times_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ m)) @ i) @ (power_power_complex @ (power_power_complex @ (fFT_Mirabelle_root @ m) @ i) @ J2)) @ (a @ (suc @ (times_times_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ J2))))) @ (set_or562006527an_nat @ zero_zero_nat @ m)) = (groups59700922omplex @ (^[N2 : nat]: (times_times_complex @ (power_power_complex @ (fFT_Mirabelle_root @ (times_times_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ m)) @ i) @ (times_times_complex @ (power_power_complex @ (power_power_complex @ (fFT_Mirabelle_root @ m) @ i) @ N2) @ (a @ (suc @ (times_times_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ N2)))))) @ (set_or562006527an_nat @ zero_zero_nat @ m))))).
