% 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/StrongNorm/prob_41__5209750_1 ) ; }
% This file was generated by Isabelle (most likely Sledgehammer)
% 2020-12-16 14:37:01.598

% Could-be-implicit typings (3)
thf(ty_n_t__List__Olist_It__Lambda__OdB_J, type,
    list_dB : $tType).
thf(ty_n_t__Lambda__OdB, type,
    dB : $tType).
thf(ty_n_t__Nat__Onat, type,
    nat : $tType).

% Explicit typings (19)
thf(sy_c_Groups_Ominus__class_Ominus_001t__Nat__Onat, type,
    minus_minus_nat : nat > nat > nat).
thf(sy_c_Groups_Oone__class_Oone_001t__Nat__Onat, type,
    one_one_nat : nat).
thf(sy_c_Groups_Ozero__class_Ozero_001t__Nat__Onat, type,
    zero_zero_nat : nat).
thf(sy_c_InductTermi_OIT, type,
    it : dB > $o).
thf(sy_c_Lambda_OdB_OAbs, type,
    abs : dB > dB).
thf(sy_c_Lambda_OdB_OApp, type,
    app : dB > dB > dB).
thf(sy_c_Lambda_OdB_OVar, type,
    var : nat > dB).
thf(sy_c_Lambda_Olift, type,
    lift : dB > nat > dB).
thf(sy_c_Lambda_Oliftn, type,
    liftn : nat > dB > nat > dB).
thf(sy_c_Lambda_Osubst, type,
    subst : dB > dB > nat > dB).
thf(sy_c_List_Ofoldl_001t__Lambda__OdB_001t__Lambda__OdB, type,
    foldl_dB_dB : (dB > dB > dB) > dB > list_dB > dB).
thf(sy_c_List_Olist_Omap_001t__Lambda__OdB_001t__Lambda__OdB, type,
    map_dB_dB : (dB > dB) > list_dB > list_dB).
thf(sy_c_List_Olistsp_001t__Lambda__OdB, type,
    listsp_dB : (dB > $o) > list_dB > $o).
thf(sy_c_Nat_OSuc, type,
    suc : nat > nat).
thf(sy_c_Orderings_Oord__class_Oless_001t__Nat__Onat, type,
    ord_less_nat : nat > nat > $o).
thf(sy_v_ia, type,
    ia : nat).
thf(sy_v_ja, type,
    ja : nat).
thf(sy_v_n, type,
    n : nat).
thf(sy_v_rs, type,
    rs : list_dB).

% Relevant facts (127)
thf(fact_0_subst__map, axiom,
    ((![T : dB, Ts : list_dB, U : dB, I : nat]: ((subst @ (foldl_dB_dB @ app @ T @ Ts) @ U @ I) = (foldl_dB_dB @ app @ (subst @ T @ U @ I) @ (map_dB_dB @ (^[T2 : dB]: (subst @ T2 @ U @ I)) @ Ts)))))). % subst_map
thf(fact_1_Suc__pred, axiom,
    ((![N : nat]: ((ord_less_nat @ zero_zero_nat @ N) => ((suc @ (minus_minus_nat @ N @ (suc @ zero_zero_nat))) = N))))). % Suc_pred
thf(fact_2_Var__apps__eq__Var__apps__conv, axiom,
    ((![M : nat, Rs : list_dB, N : nat, Ss : list_dB]: (((foldl_dB_dB @ app @ (var @ M) @ Rs) = (foldl_dB_dB @ app @ (var @ N) @ Ss)) = (((M = N)) & ((Rs = Ss))))))). % Var_apps_eq_Var_apps_conv
thf(fact_3_subst__lt, axiom,
    ((![J : nat, I : nat, U : dB]: ((ord_less_nat @ J @ I) => ((subst @ (var @ J) @ U @ I) = (var @ J)))))). % subst_lt
thf(fact_4_zero__less__diff, axiom,
    ((![N : nat, M : nat]: ((ord_less_nat @ zero_zero_nat @ (minus_minus_nat @ N @ M)) = (ord_less_nat @ M @ N))))). % zero_less_diff
thf(fact_5_less__Suc0, axiom,
    ((![N : nat]: ((ord_less_nat @ N @ (suc @ zero_zero_nat)) = (N = zero_zero_nat))))). % less_Suc0
thf(fact_6_zero__less__Suc, axiom,
    ((![N : nat]: (ord_less_nat @ zero_zero_nat @ (suc @ N))))). % zero_less_Suc
thf(fact_7_IT_OVar, axiom,
    ((![Rs : list_dB, N : nat]: ((listsp_dB @ it @ Rs) => (it @ (foldl_dB_dB @ app @ (var @ N) @ Rs)))))). % IT.Var
thf(fact_8_subst__eq, axiom,
    ((![K : nat, U : dB]: ((subst @ (var @ K) @ U @ K) = U)))). % subst_eq
thf(fact_9_apps__eq__tail__conv, axiom,
    ((![R : dB, Ts : list_dB, S : dB]: (((foldl_dB_dB @ app @ R @ Ts) = (foldl_dB_dB @ app @ S @ Ts)) = (R = S))))). % apps_eq_tail_conv
thf(fact_10_diff__Suc__Suc, axiom,
    ((![M : nat, N : nat]: ((minus_minus_nat @ (suc @ M) @ (suc @ N)) = (minus_minus_nat @ M @ N))))). % diff_Suc_Suc
thf(fact_11_old_Onat_Oinject, axiom,
    ((![Nat : nat, Nat2 : nat]: (((suc @ Nat) = (suc @ Nat2)) = (Nat = Nat2))))). % old.nat.inject
thf(fact_12_nat_Oinject, axiom,
    ((![X2 : nat, Y2 : nat]: (((suc @ X2) = (suc @ Y2)) = (X2 = Y2))))). % nat.inject
thf(fact_13_dB_Oinject_I2_J, axiom,
    ((![X21 : dB, X22 : dB, Y21 : dB, Y22 : dB]: (((app @ X21 @ X22) = (app @ Y21 @ Y22)) = (((X21 = Y21)) & ((X22 = Y22))))))). % dB.inject(2)
thf(fact_14_dB_Oinject_I1_J, axiom,
    ((![X1 : nat, Y1 : nat]: (((var @ X1) = (var @ Y1)) = (X1 = Y1))))). % dB.inject(1)
thf(fact_15_not__gr__zero, axiom,
    ((![N : nat]: ((~ ((ord_less_nat @ zero_zero_nat @ N))) = (N = zero_zero_nat))))). % not_gr_zero
thf(fact_16_cancel__comm__monoid__add__class_Odiff__cancel, axiom,
    ((![A : nat]: ((minus_minus_nat @ A @ A) = zero_zero_nat)))). % cancel_comm_monoid_add_class.diff_cancel
thf(fact_17_diff__zero, axiom,
    ((![A : nat]: ((minus_minus_nat @ A @ zero_zero_nat) = A)))). % diff_zero
thf(fact_18_zero__diff, axiom,
    ((![A : nat]: ((minus_minus_nat @ zero_zero_nat @ A) = zero_zero_nat)))). % zero_diff
thf(fact_19_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_20_less__nat__zero__code, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % less_nat_zero_code
thf(fact_21_neq0__conv, axiom,
    ((![N : nat]: ((~ ((N = zero_zero_nat))) = (ord_less_nat @ zero_zero_nat @ N))))). % neq0_conv
thf(fact_22_not__less__eq, axiom,
    ((![M : nat, N : nat]: ((~ ((ord_less_nat @ M @ N))) = (ord_less_nat @ N @ (suc @ M)))))). % not_less_eq
thf(fact_23_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_24_Suc__mono, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (ord_less_nat @ (suc @ M) @ (suc @ N)))))). % Suc_mono
thf(fact_25_lessI, axiom,
    ((![N : nat]: (ord_less_nat @ N @ (suc @ N))))). % lessI
thf(fact_26_diff__self__eq__0, axiom,
    ((![M : nat]: ((minus_minus_nat @ M @ M) = zero_zero_nat)))). % diff_self_eq_0
thf(fact_27_diff__0__eq__0, axiom,
    ((![N : nat]: ((minus_minus_nat @ zero_zero_nat @ N) = zero_zero_nat)))). % diff_0_eq_0
thf(fact_28_Suc__diff__diff, axiom,
    ((![M : nat, N : nat, K : nat]: ((minus_minus_nat @ (minus_minus_nat @ (suc @ M) @ N) @ (suc @ K)) = (minus_minus_nat @ (minus_minus_nat @ M @ N) @ K))))). % Suc_diff_diff
thf(fact_29_zero__reorient, axiom,
    ((![X : nat]: ((zero_zero_nat = X) = (X = zero_zero_nat))))). % zero_reorient
thf(fact_30_diff__right__commute, axiom,
    ((![A : nat, C : nat, B : nat]: ((minus_minus_nat @ (minus_minus_nat @ A @ C) @ B) = (minus_minus_nat @ (minus_minus_nat @ A @ B) @ C))))). % diff_right_commute
thf(fact_31_n__not__Suc__n, axiom,
    ((![N : nat]: (~ ((N = (suc @ N))))))). % n_not_Suc_n
thf(fact_32_Suc__inject, axiom,
    ((![X : nat, Y : nat]: (((suc @ X) = (suc @ Y)) => (X = Y))))). % Suc_inject
thf(fact_33_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_34_infinite__descent, axiom,
    ((![P : nat > $o, N : nat]: ((![N2 : nat]: ((~ ((P @ N2))) => (?[M2 : nat]: ((ord_less_nat @ M2 @ N2) & (~ ((P @ M2))))))) => (P @ N))))). % infinite_descent
thf(fact_35_nat__less__induct, axiom,
    ((![P : nat > $o, N : nat]: ((![N2 : nat]: ((![M2 : nat]: ((ord_less_nat @ M2 @ N2) => (P @ M2))) => (P @ N2))) => (P @ N))))). % nat_less_induct
thf(fact_36_less__irrefl__nat, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ N)))))). % less_irrefl_nat
thf(fact_37_less__not__refl3, axiom,
    ((![S : nat, T : nat]: ((ord_less_nat @ S @ T) => (~ ((S = T))))))). % less_not_refl3
thf(fact_38_less__not__refl2, axiom,
    ((![N : nat, M : nat]: ((ord_less_nat @ N @ M) => (~ ((M = N))))))). % less_not_refl2
thf(fact_39_less__not__refl, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ N)))))). % less_not_refl
thf(fact_40_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_41_diff__commute, axiom,
    ((![I : nat, J : nat, K : nat]: ((minus_minus_nat @ (minus_minus_nat @ I @ J) @ K) = (minus_minus_nat @ (minus_minus_nat @ I @ K) @ J))))). % diff_commute
thf(fact_42_zero__less__iff__neq__zero, axiom,
    ((![N : nat]: ((ord_less_nat @ zero_zero_nat @ N) = (~ ((N = zero_zero_nat))))))). % zero_less_iff_neq_zero
thf(fact_43_gr__implies__not__zero, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (~ ((N = zero_zero_nat))))))). % gr_implies_not_zero
thf(fact_44_not__less__zero, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % not_less_zero
thf(fact_45_gr__zeroI, axiom,
    ((![N : nat]: ((~ ((N = zero_zero_nat))) => (ord_less_nat @ zero_zero_nat @ N))))). % gr_zeroI
thf(fact_46_not0__implies__Suc, axiom,
    ((![N : nat]: ((~ ((N = zero_zero_nat))) => (?[M3 : nat]: (N = (suc @ M3))))))). % not0_implies_Suc
thf(fact_47_old_Onat_Oinducts, axiom,
    ((![P : nat > $o, Nat : nat]: ((P @ zero_zero_nat) => ((![Nat3 : nat]: ((P @ Nat3) => (P @ (suc @ Nat3)))) => (P @ Nat)))))). % old.nat.inducts
thf(fact_48_old_Onat_Oexhaust, axiom,
    ((![Y : nat]: ((~ ((Y = zero_zero_nat))) => (~ ((![Nat3 : nat]: (~ ((Y = (suc @ Nat3))))))))))). % old.nat.exhaust
thf(fact_49_Zero__not__Suc, axiom,
    ((![M : nat]: (~ ((zero_zero_nat = (suc @ M))))))). % Zero_not_Suc
thf(fact_50_Zero__neq__Suc, axiom,
    ((![M : nat]: (~ ((zero_zero_nat = (suc @ M))))))). % Zero_neq_Suc
thf(fact_51_Suc__neq__Zero, axiom,
    ((![M : nat]: (~ (((suc @ M) = zero_zero_nat)))))). % Suc_neq_Zero
thf(fact_52_zero__induct, axiom,
    ((![P : nat > $o, K : nat]: ((P @ K) => ((![N2 : nat]: ((P @ (suc @ N2)) => (P @ N2))) => (P @ zero_zero_nat)))))). % zero_induct
thf(fact_53_diff__induct, axiom,
    ((![P : nat > nat > $o, M : nat, N : nat]: ((![X3 : nat]: (P @ X3 @ zero_zero_nat)) => ((![Y3 : nat]: (P @ zero_zero_nat @ (suc @ Y3))) => ((![X3 : nat, Y3 : nat]: ((P @ X3 @ Y3) => (P @ (suc @ X3) @ (suc @ Y3)))) => (P @ M @ N))))))). % diff_induct
thf(fact_54_nat__induct, axiom,
    ((![P : nat > $o, N : nat]: ((P @ zero_zero_nat) => ((![N2 : nat]: ((P @ N2) => (P @ (suc @ N2)))) => (P @ N)))))). % nat_induct
thf(fact_55_nat_OdiscI, axiom,
    ((![Nat : nat, X2 : nat]: ((Nat = (suc @ X2)) => (~ ((Nat = zero_zero_nat))))))). % nat.discI
thf(fact_56_old_Onat_Odistinct_I1_J, axiom,
    ((![Nat2 : nat]: (~ ((zero_zero_nat = (suc @ Nat2))))))). % old.nat.distinct(1)
thf(fact_57_old_Onat_Odistinct_I2_J, axiom,
    ((![Nat2 : nat]: (~ (((suc @ Nat2) = zero_zero_nat)))))). % old.nat.distinct(2)
thf(fact_58_nat_Odistinct_I1_J, axiom,
    ((![X2 : nat]: (~ ((zero_zero_nat = (suc @ X2))))))). % nat.distinct(1)
thf(fact_59_bot__nat__0_Oextremum__strict, axiom,
    ((![A : nat]: (~ ((ord_less_nat @ A @ zero_zero_nat)))))). % bot_nat_0.extremum_strict
thf(fact_60_infinite__descent0, axiom,
    ((![P : nat > $o, N : nat]: ((P @ zero_zero_nat) => ((![N2 : nat]: ((ord_less_nat @ zero_zero_nat @ N2) => ((~ ((P @ N2))) => (?[M2 : nat]: ((ord_less_nat @ M2 @ N2) & (~ ((P @ M2)))))))) => (P @ N)))))). % infinite_descent0
thf(fact_61_gr__implies__not0, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (~ ((N = zero_zero_nat))))))). % gr_implies_not0
thf(fact_62_less__zeroE, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % less_zeroE
thf(fact_63_not__less0, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % not_less0
thf(fact_64_not__gr0, axiom,
    ((![N : nat]: ((~ ((ord_less_nat @ zero_zero_nat @ N))) = (N = zero_zero_nat))))). % not_gr0
thf(fact_65_gr0I, axiom,
    ((![N : nat]: ((~ ((N = zero_zero_nat))) => (ord_less_nat @ zero_zero_nat @ N))))). % gr0I
thf(fact_66_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_67_strict__inc__induct, axiom,
    ((![I : nat, J : nat, P : nat > $o]: ((ord_less_nat @ I @ J) => ((![I2 : nat]: ((J = (suc @ I2)) => (P @ I2))) => ((![I2 : nat]: ((ord_less_nat @ I2 @ J) => ((P @ (suc @ I2)) => (P @ I2)))) => (P @ I))))))). % strict_inc_induct
thf(fact_68_less__Suc__induct, axiom,
    ((![I : nat, J : nat, P : nat > nat > $o]: ((ord_less_nat @ I @ J) => ((![I2 : nat]: (P @ I2 @ (suc @ I2))) => ((![I2 : nat, J2 : nat, K2 : nat]: ((ord_less_nat @ I2 @ J2) => ((ord_less_nat @ J2 @ K2) => ((P @ I2 @ J2) => ((P @ J2 @ K2) => (P @ I2 @ K2)))))) => (P @ I @ J))))))). % less_Suc_induct
thf(fact_69_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_70_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_71_less__antisym, axiom,
    ((![N : nat, M : nat]: ((~ ((ord_less_nat @ N @ M))) => ((ord_less_nat @ N @ (suc @ M)) => (M = N)))))). % less_antisym
thf(fact_72_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_73_All__less__Suc, axiom,
    ((![N : nat, P : nat > $o]: ((![I3 : nat]: (((ord_less_nat @ I3 @ (suc @ N))) => ((P @ I3)))) = (((P @ N)) & ((![I3 : nat]: (((ord_less_nat @ I3 @ N)) => ((P @ I3)))))))))). % All_less_Suc
thf(fact_74_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_75_Ex__less__Suc, axiom,
    ((![N : nat, P : nat > $o]: ((?[I3 : nat]: (((ord_less_nat @ I3 @ (suc @ N))) & ((P @ I3)))) = (((P @ N)) | ((?[I3 : nat]: (((ord_less_nat @ I3 @ N)) & ((P @ I3)))))))))). % Ex_less_Suc
thf(fact_76_less__SucI, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (ord_less_nat @ M @ (suc @ N)))))). % less_SucI
thf(fact_77_less__SucE, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ (suc @ N)) => ((~ ((ord_less_nat @ M @ N))) => (M = N)))))). % less_SucE
thf(fact_78_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_79_Suc__lessE, axiom,
    ((![I : nat, K : nat]: ((ord_less_nat @ (suc @ I) @ K) => (~ ((![J2 : nat]: ((ord_less_nat @ I @ J2) => (~ ((K = (suc @ J2)))))))))))). % Suc_lessE
thf(fact_80_Suc__lessD, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ (suc @ M) @ N) => (ord_less_nat @ M @ N))))). % Suc_lessD
thf(fact_81_Nat_OlessE, axiom,
    ((![I : nat, K : nat]: ((ord_less_nat @ I @ K) => ((~ ((K = (suc @ I)))) => (~ ((![J2 : nat]: ((ord_less_nat @ I @ J2) => (~ ((K = (suc @ J2))))))))))))). % Nat.lessE
thf(fact_82_minus__nat_Odiff__0, axiom,
    ((![M : nat]: ((minus_minus_nat @ M @ zero_zero_nat) = M)))). % minus_nat.diff_0
thf(fact_83_diffs0__imp__equal, axiom,
    ((![M : nat, N : nat]: (((minus_minus_nat @ M @ N) = zero_zero_nat) => (((minus_minus_nat @ N @ M) = zero_zero_nat) => (M = N)))))). % diffs0_imp_equal
thf(fact_84_zero__induct__lemma, axiom,
    ((![P : nat > $o, K : nat, I : nat]: ((P @ K) => ((![N2 : nat]: ((P @ (suc @ N2)) => (P @ N2))) => (P @ (minus_minus_nat @ K @ I))))))). % zero_induct_lemma
thf(fact_85_less__imp__diff__less, axiom,
    ((![J : nat, K : nat, N : nat]: ((ord_less_nat @ J @ K) => (ord_less_nat @ (minus_minus_nat @ J @ N) @ K))))). % less_imp_diff_less
thf(fact_86_diff__less__mono2, axiom,
    ((![M : nat, N : nat, L : nat]: ((ord_less_nat @ M @ N) => ((ord_less_nat @ M @ L) => (ord_less_nat @ (minus_minus_nat @ L @ N) @ (minus_minus_nat @ L @ M))))))). % diff_less_mono2
thf(fact_87_dB_Odistinct_I1_J, axiom,
    ((![X1 : nat, X21 : dB, X22 : dB]: (~ (((var @ X1) = (app @ X21 @ X22))))))). % dB.distinct(1)
thf(fact_88_subst__App, axiom,
    ((![T : dB, U : dB, S : dB, K : nat]: ((subst @ (app @ T @ U) @ S @ K) = (app @ (subst @ T @ S @ K) @ (subst @ U @ S @ K)))))). % subst_App
thf(fact_89_lift__Suc__mono__less__iff, axiom,
    ((![F : nat > nat, N : nat, M : nat]: ((![N2 : nat]: (ord_less_nat @ (F @ N2) @ (F @ (suc @ N2)))) => ((ord_less_nat @ (F @ N) @ (F @ M)) = (ord_less_nat @ N @ M)))))). % lift_Suc_mono_less_iff
thf(fact_90_lift__Suc__mono__less, axiom,
    ((![F : nat > nat, N : nat, N3 : nat]: ((![N2 : nat]: (ord_less_nat @ (F @ N2) @ (F @ (suc @ N2)))) => ((ord_less_nat @ N @ N3) => (ord_less_nat @ (F @ N) @ (F @ N3))))))). % lift_Suc_mono_less
thf(fact_91_less__Suc__eq__0__disj, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ (suc @ N)) = (((M = zero_zero_nat)) | ((?[J3 : nat]: (((M = (suc @ J3))) & ((ord_less_nat @ J3 @ N)))))))))). % less_Suc_eq_0_disj
thf(fact_92_gr0__implies__Suc, axiom,
    ((![N : nat]: ((ord_less_nat @ zero_zero_nat @ N) => (?[M3 : nat]: (N = (suc @ M3))))))). % gr0_implies_Suc
thf(fact_93_All__less__Suc2, axiom,
    ((![N : nat, P : nat > $o]: ((![I3 : nat]: (((ord_less_nat @ I3 @ (suc @ N))) => ((P @ I3)))) = (((P @ zero_zero_nat)) & ((![I3 : nat]: (((ord_less_nat @ I3 @ N)) => ((P @ (suc @ I3))))))))))). % All_less_Suc2
thf(fact_94_gr0__conv__Suc, axiom,
    ((![N : nat]: ((ord_less_nat @ zero_zero_nat @ N) = (?[M5 : nat]: (N = (suc @ M5))))))). % gr0_conv_Suc
thf(fact_95_Ex__less__Suc2, axiom,
    ((![N : nat, P : nat > $o]: ((?[I3 : nat]: (((ord_less_nat @ I3 @ (suc @ N))) & ((P @ I3)))) = (((P @ zero_zero_nat)) | ((?[I3 : nat]: (((ord_less_nat @ I3 @ N)) & ((P @ (suc @ I3))))))))))). % Ex_less_Suc2
thf(fact_96_diff__less, axiom,
    ((![N : nat, M : nat]: ((ord_less_nat @ zero_zero_nat @ N) => ((ord_less_nat @ zero_zero_nat @ M) => (ord_less_nat @ (minus_minus_nat @ M @ N) @ M)))))). % diff_less
thf(fact_97_diff__less__Suc, axiom,
    ((![M : nat, N : nat]: (ord_less_nat @ (minus_minus_nat @ M @ N) @ (suc @ M))))). % diff_less_Suc
thf(fact_98_Suc__diff__Suc, axiom,
    ((![N : nat, M : nat]: ((ord_less_nat @ N @ M) => ((suc @ (minus_minus_nat @ M @ (suc @ N))) = (minus_minus_nat @ M @ N)))))). % Suc_diff_Suc
thf(fact_99_diff__Suc__less, axiom,
    ((![N : nat, I : nat]: ((ord_less_nat @ zero_zero_nat @ N) => (ord_less_nat @ (minus_minus_nat @ N @ (suc @ I)) @ N))))). % diff_Suc_less
thf(fact_100_listsp__conj__eq, axiom,
    ((![A2 : dB > $o, B2 : dB > $o]: ((listsp_dB @ (^[X4 : dB]: (((A2 @ X4)) & ((B2 @ X4))))) = (^[X4 : list_dB]: (((listsp_dB @ A2 @ X4)) & ((listsp_dB @ B2 @ X4)))))))). % listsp_conj_eq
thf(fact_101_map__ident, axiom,
    (((map_dB_dB @ (^[X4 : dB]: X4)) = (^[Xs : list_dB]: Xs)))). % map_ident
thf(fact_102_foldl__map, axiom,
    ((![G : dB > dB > dB, A : dB, F : dB > dB, Xs2 : list_dB]: ((foldl_dB_dB @ G @ A @ (map_dB_dB @ F @ Xs2)) = (foldl_dB_dB @ (^[A3 : dB]: (^[X4 : dB]: (G @ A3 @ (F @ X4)))) @ A @ Xs2))))). % foldl_map
thf(fact_103_IT_Oinducts, axiom,
    ((![X : dB, P : dB > $o]: ((it @ X) => ((![Rs2 : list_dB, N2 : nat]: ((listsp_dB @ (^[X4 : dB]: (((it @ X4)) & ((P @ X4)))) @ Rs2) => (P @ (foldl_dB_dB @ app @ (var @ N2) @ Rs2)))) => ((![R2 : dB]: ((it @ R2) => ((P @ R2) => (P @ (abs @ R2))))) => ((![R2 : dB, S2 : dB, Ss2 : list_dB]: ((it @ (foldl_dB_dB @ app @ (subst @ R2 @ S2 @ zero_zero_nat) @ Ss2)) => ((P @ (foldl_dB_dB @ app @ (subst @ R2 @ S2 @ zero_zero_nat) @ Ss2)) => ((it @ S2) => ((P @ S2) => (P @ (foldl_dB_dB @ app @ (app @ (abs @ R2) @ S2) @ Ss2))))))) => (P @ X)))))))). % IT.inducts
thf(fact_104_IT_Osimps, axiom,
    ((it = (^[A3 : dB]: (((?[Rs3 : list_dB]: (?[N4 : nat]: (((A3 = (foldl_dB_dB @ app @ (var @ N4) @ Rs3))) & ((listsp_dB @ it @ Rs3)))))) | ((((?[R3 : dB]: (((A3 = (abs @ R3))) & ((it @ R3))))) | ((?[R3 : dB]: (?[S3 : dB]: (?[Ss3 : list_dB]: (((A3 = (foldl_dB_dB @ app @ (app @ (abs @ R3) @ S3) @ Ss3))) & ((((it @ (foldl_dB_dB @ app @ (subst @ R3 @ S3 @ zero_zero_nat) @ Ss3))) & ((it @ S3)))))))))))))))). % IT.simps
thf(fact_105_IT_Ocases, axiom,
    ((![A : dB]: ((it @ A) => ((![Rs2 : list_dB]: ((?[N2 : nat]: (A = (foldl_dB_dB @ app @ (var @ N2) @ Rs2))) => (~ ((listsp_dB @ it @ Rs2))))) => ((![R2 : dB]: ((A = (abs @ R2)) => (~ ((it @ R2))))) => (~ ((![R2 : dB, S2 : dB, Ss2 : list_dB]: ((A = (foldl_dB_dB @ app @ (app @ (abs @ R2) @ S2) @ Ss2)) => ((it @ (foldl_dB_dB @ app @ (subst @ R2 @ S2 @ zero_zero_nat) @ Ss2)) => (~ ((it @ S2)))))))))))))). % IT.cases
thf(fact_106_lifts__IT, axiom,
    ((![Ts : list_dB]: ((listsp_dB @ it @ Ts) => (listsp_dB @ it @ (map_dB_dB @ (^[T2 : dB]: (lift @ T2 @ zero_zero_nat)) @ Ts)))))). % lifts_IT
thf(fact_107_less__numeral__extra_I3_J, axiom,
    ((~ ((ord_less_nat @ zero_zero_nat @ zero_zero_nat))))). % less_numeral_extra(3)
thf(fact_108_dB_Oinject_I3_J, axiom,
    ((![X32 : dB, Y32 : dB]: (((abs @ X32) = (abs @ Y32)) = (X32 = Y32))))). % dB.inject(3)
thf(fact_109_subst__lift, axiom,
    ((![T : dB, K : nat, S : dB]: ((subst @ (lift @ T @ K) @ S @ K) = T)))). % subst_lift
thf(fact_110_lift__IT, axiom,
    ((![T : dB, I : nat]: ((it @ T) => (it @ (lift @ T @ I)))))). % lift_IT
thf(fact_111_Abs__apps__eq__Abs__apps__conv, axiom,
    ((![R : dB, Rs : list_dB, S : dB, Ss : list_dB]: (((foldl_dB_dB @ app @ (abs @ R) @ Rs) = (foldl_dB_dB @ app @ (abs @ S) @ Ss)) = (((R = S)) & ((Rs = Ss))))))). % Abs_apps_eq_Abs_apps_conv
thf(fact_112_lift__map, axiom,
    ((![T : dB, Ts : list_dB, I : nat]: ((lift @ (foldl_dB_dB @ app @ T @ Ts) @ I) = (foldl_dB_dB @ app @ (lift @ T @ I) @ (map_dB_dB @ (^[T2 : dB]: (lift @ T2 @ I)) @ Ts)))))). % lift_map
thf(fact_113_dB_Odistinct_I5_J, axiom,
    ((![X21 : dB, X22 : dB, X32 : dB]: (~ (((app @ X21 @ X22) = (abs @ X32))))))). % dB.distinct(5)
thf(fact_114_dB_Odistinct_I3_J, axiom,
    ((![X1 : nat, X32 : dB]: (~ (((var @ X1) = (abs @ X32))))))). % dB.distinct(3)
thf(fact_115_Lambda, axiom,
    ((![R : dB]: ((it @ R) => (it @ (abs @ R)))))). % Lambda
thf(fact_116_lift_Osimps_I2_J, axiom,
    ((![S : dB, T : dB, K : nat]: ((lift @ (app @ S @ T) @ K) = (app @ (lift @ S @ K) @ (lift @ T @ K)))))). % lift.simps(2)
thf(fact_117_dB_Oinduct, axiom,
    ((![P : dB > $o, DB : dB]: ((![X3 : nat]: (P @ (var @ X3))) => ((![X1a : dB, X23 : dB]: ((P @ X1a) => ((P @ X23) => (P @ (app @ X1a @ X23))))) => ((![X3 : dB]: ((P @ X3) => (P @ (abs @ X3)))) => (P @ DB))))))). % dB.induct
thf(fact_118_dB_Oexhaust, axiom,
    ((![Y : dB]: ((![X12 : nat]: (~ ((Y = (var @ X12))))) => ((![X212 : dB, X222 : dB]: (~ ((Y = (app @ X212 @ X222))))) => (~ ((![X33 : dB]: (~ ((Y = (abs @ X33)))))))))))). % dB.exhaust
thf(fact_119_ex__head__tail, axiom,
    ((![T : dB]: (?[Ts2 : list_dB, H : dB]: ((T = (foldl_dB_dB @ app @ H @ Ts2)) & ((?[N2 : nat]: (H = (var @ N2))) | (?[U2 : dB]: (H = (abs @ U2))))))))). % ex_head_tail
thf(fact_120_Abs__App__neq__Var__apps, axiom,
    ((![S : dB, T : dB, N : nat, Ss : list_dB]: (~ (((app @ (abs @ S) @ T) = (foldl_dB_dB @ app @ (var @ N) @ Ss))))))). % Abs_App_neq_Var_apps
thf(fact_121_Var__apps__neq__Abs__apps, axiom,
    ((![N : nat, Ts : list_dB, R : dB, Ss : list_dB]: (~ (((foldl_dB_dB @ app @ (var @ N) @ Ts) = (foldl_dB_dB @ app @ (abs @ R) @ Ss))))))). % Var_apps_neq_Abs_apps
thf(fact_122_list_Omap__ident, axiom,
    ((![T : list_dB]: ((map_dB_dB @ (^[X4 : dB]: X4) @ T) = T)))). % list.map_ident
thf(fact_123_Beta, axiom,
    ((![R : dB, S : dB, Ss : list_dB]: ((it @ (foldl_dB_dB @ app @ (subst @ R @ S @ zero_zero_nat) @ Ss)) => ((it @ S) => (it @ (foldl_dB_dB @ app @ (app @ (abs @ R) @ S) @ Ss))))))). % Beta
thf(fact_124_subst__gt, axiom,
    ((![I : nat, J : nat, U : dB]: ((ord_less_nat @ I @ J) => ((subst @ (var @ J) @ U @ I) = (var @ (minus_minus_nat @ J @ one_one_nat))))))). % subst_gt
thf(fact_125_liftn__lift, axiom,
    ((![N : nat, T : dB, K : nat]: ((liftn @ (suc @ N) @ T @ K) = (lift @ (liftn @ N @ T @ K) @ K))))). % liftn_lift
thf(fact_126_liftn__0, axiom,
    ((![T : dB, K : nat]: ((liftn @ zero_zero_nat @ T @ K) = T)))). % liftn_0

% Conjectures (2)
thf(conj_0, hypothesis,
    ((listsp_dB @ (^[X4 : dB]: (((it @ X4)) & ((![Y4 : nat]: (![Z : nat]: (it @ (subst @ X4 @ (var @ Y4) @ Z))))))) @ rs))).
thf(conj_1, conjecture,
    ((((~ ((n = ja))) | (it @ (foldl_dB_dB @ app @ (var @ ia) @ (map_dB_dB @ (^[T2 : dB]: (subst @ T2 @ (var @ ia) @ ja)) @ rs)))) & ((n = ja) | (((~ ((ord_less_nat @ ja @ n))) | (it @ (foldl_dB_dB @ app @ (var @ (minus_minus_nat @ n @ (suc @ zero_zero_nat))) @ (map_dB_dB @ (^[T2 : dB]: (subst @ T2 @ (var @ ia) @ ja)) @ rs)))) & ((~ ((ord_less_nat @ n @ (suc @ ja)))) | (it @ (foldl_dB_dB @ app @ (var @ n) @ (map_dB_dB @ (^[T2 : dB]: (subst @ T2 @ (var @ ia) @ ja)) @ rs))))))))).
