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

% Could-be-implicit typings (6)
thf(ty_n_t__List__Olist_It__LambdaType__Otype_J, type,
    list_type : $tType).
thf(ty_n_t__List__Olist_It__Lambda__OdB_J, type,
    list_dB : $tType).
thf(ty_n_t__LambdaType__Otype, type,
    type : $tType).
thf(ty_n_t__Lambda__OdB, type,
    dB : $tType).
thf(ty_n_t__Nat__Onat, type,
    nat : $tType).
thf(ty_n_t__Int__Oint, type,
    int : $tType).

% Explicit typings (44)
thf(sy_c_Groups_Ouminus__class_Ouminus_001t__Int__Oint, type,
    uminus_uminus_int : int > int).
thf(sy_c_Groups_Ozero__class_Ozero_001t__Int__Oint, type,
    zero_zero_int : int).
thf(sy_c_Groups_Ozero__class_Ozero_001t__Nat__Onat, type,
    zero_zero_nat : nat).
thf(sy_c_If_001t__Nat__Onat, type,
    if_nat : $o > nat > nat > nat).
thf(sy_c_InductTermi_OIT, type,
    it : dB > $o).
thf(sy_c_Int_Onat, type,
    nat2 : int > nat).
thf(sy_c_LambdaType_Oshift_001t__LambdaType__Otype, type,
    shift_type : (nat > type) > nat > type > nat > type).
thf(sy_c_LambdaType_Otype_OFun, type,
    fun : type > type > type).
thf(sy_c_LambdaType_Otyping, type,
    typing : (nat > type) > dB > type > $o).
thf(sy_c_LambdaType_Otypings, type,
    typings : (nat > type) > list_dB > list_type > $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_OdB_Osize__dB, type,
    size_dB : dB > nat).
thf(sy_c_Lambda_Olift, type,
    lift : 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_Ofoldr_001t__LambdaType__Otype_001t__LambdaType__Otype, type,
    foldr_type_type : (type > type > type) > list_type > type > type).
thf(sy_c_List_Olist_OCons_001t__LambdaType__Otype, type,
    cons_type : type > list_type > list_type).
thf(sy_c_List_Olist_OCons_001t__Lambda__OdB, type,
    cons_dB : dB > list_dB > list_dB).
thf(sy_c_List_Olist_Ocase__list_001_Eo_001t__LambdaType__Otype, type,
    case_list_o_type : $o > (type > list_type > $o) > list_type > $o).
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_List_Omap__tailrec_001t__Lambda__OdB_001t__Lambda__OdB, type,
    map_tailrec_dB_dB : (dB > dB) > list_dB > list_dB).
thf(sy_c_Nat_Osemiring__1__class_Oof__nat_001t__Int__Oint, type,
    semiri2019852685at_int : nat > int).
thf(sy_c_Nat_Osemiring__1__class_Oof__nat_001t__Nat__Onat, type,
    semiri1382578993at_nat : nat > nat).
thf(sy_c_Orderings_Oord__class_Oless_001t__Int__Oint, type,
    ord_less_int : int > int > $o).
thf(sy_c_Orderings_Oord__class_Oless_001t__Nat__Onat, type,
    ord_less_nat : nat > nat > $o).
thf(sy_v_T_H1____, type,
    t_1 : type).
thf(sy_v_T_H____, type,
    t : type).
thf(sy_v_T____, type,
    t2 : type).
thf(sy_v_Ts____, type,
    ts : list_type).
thf(sy_v_a____, type,
    a : dB).
thf(sy_v_as____, type,
    as : list_dB).
thf(sy_v_e1____, type,
    e1 : nat > type).
thf(sy_v_e____, type,
    e : nat > type).
thf(sy_v_i1____, type,
    i1 : nat).
thf(sy_v_i____, type,
    i : nat).
thf(sy_v_n____, type,
    n : nat).
thf(sy_v_rs____, type,
    rs : list_dB).
thf(sy_v_t____, type,
    t3 : dB).
thf(sy_v_thesis____, type,
    thesis : $o).
thf(sy_v_u1____, type,
    u1 : dB).
thf(sy_v_u____, type,
    u : dB).

% Relevant facts (151)
thf(fact_0_True, axiom,
    ((n = i))). % True
thf(fact_1_uT, axiom,
    ((typing @ e @ u @ t2))). % uT
thf(fact_2_headT, axiom,
    ((typing @ (shift_type @ e @ i @ t2) @ (app @ (var @ n) @ a) @ (foldr_type_type @ fun @ ts @ t)))). % headT
thf(fact_3__092_060open_062IT_At_092_060close_062, axiom,
    ((it @ t3))). % \<open>IT t\<close>
thf(fact_4_argsT, axiom,
    ((typings @ (shift_type @ e @ i @ t2) @ as @ ts))). % argsT
thf(fact_5__092_060open_062_092_060And_062thesis_O_A_I_092_060And_062Ts_O_A_092_060lbrakk_062e_092_060langle_062i_058T_092_060rangle_062_A_092_060turnstile_062_AVar_An_A_092_060degree_062_Aa_A_058_ATs_A_092_060Rrightarrow_062_AT_H_059_Ae_092_060langle_062i_058T_092_060rangle_062_A_092_060tturnstile_062_Aas_A_058_ATs_092_060rbrakk_062_A_092_060Longrightarrow_062_Athesis_J_A_092_060Longrightarrow_062_Athesis_092_060close_062, axiom,
    ((~ ((![Ts : list_type]: ((typing @ (shift_type @ e @ i @ t2) @ (app @ (var @ n) @ a) @ (foldr_type_type @ fun @ Ts @ t)) => (~ ((typings @ (shift_type @ e @ i @ t2) @ as @ Ts))))))))). % \<open>\<And>thesis. (\<And>Ts. \<lbrakk>e\<langle>i:T\<rangle> \<turnstile> Var n \<degree> a : Ts \<Rrightarrow> T'; e\<langle>i:T\<rangle> \<tturnstile> as : Ts\<rbrakk> \<Longrightarrow> thesis) \<Longrightarrow> thesis\<close>
thf(fact_6_nT, axiom,
    ((typing @ (shift_type @ e @ i @ t2) @ (foldl_dB_dB @ app @ (var @ n) @ rs) @ t))). % nT
thf(fact_7__092_060open_062e_092_060langle_062i_058T_092_060rangle_062_A_092_060turnstile_062_AVar_An_A_092_060degree_062_Aa_A_092_060degree_062_092_060degree_062_Aas_A_058_AT_H_092_060close_062, axiom,
    ((typing @ (shift_type @ e @ i @ t2) @ (foldl_dB_dB @ app @ (app @ (var @ n) @ a) @ as) @ t))). % \<open>e\<langle>i:T\<rangle> \<turnstile> Var n \<degree> a \<degree>\<degree> as : T'\<close>
thf(fact_8_shift__eq, axiom,
    ((![I : nat, J : nat, E : nat > type, T : type]: ((I = J) => ((shift_type @ E @ I @ T @ J) = T))))). % shift_eq
thf(fact_9_type_Oinject_I2_J, axiom,
    ((![X21 : type, X22 : type, Y21 : type, Y22 : type]: (((fun @ X21 @ X22) = (fun @ Y21 @ Y22)) = (((X21 = Y21)) & ((X22 = Y22))))))). % type.inject(2)
thf(fact_10_dB_Oinject_I1_J, axiom,
    ((![X1 : nat, Y1 : nat]: (((var @ X1) = (var @ Y1)) = (X1 = Y1))))). % dB.inject(1)
thf(fact_11_typing__elims_I1_J, axiom,
    ((![E : nat > type, I : nat, T : type]: ((typing @ E @ (var @ I) @ T) => ((E @ I) = T))))). % typing_elims(1)
thf(fact_12_typing_OVar, axiom,
    ((![Env : nat > type, X : nat, T : type]: (((Env @ X) = T) => (typing @ Env @ (var @ X) @ T))))). % typing.Var
thf(fact_13_MI1, axiom,
    ((![T1 : type, T2 : type, T3 : dB, E : nat > type, I : nat, T : type, U : dB]: ((t2 = (fun @ T1 @ T2)) => ((it @ T3) => ((typing @ (shift_type @ E @ I @ T1) @ T3 @ T) => ((it @ U) => ((typing @ E @ U @ T1) => (it @ (subst @ T3 @ U @ I)))))))))). % MI1
thf(fact_14_MI2, axiom,
    ((![T1 : type, T2 : type, T3 : dB, E : nat > type, I : nat, T : type, U : dB]: ((t2 = (fun @ T1 @ T2)) => ((it @ T3) => ((typing @ (shift_type @ E @ I @ T2) @ T3 @ T) => ((it @ U) => ((typing @ E @ U @ T2) => (it @ (subst @ T3 @ U @ I)))))))))). % MI2
thf(fact_15_type__induct, axiom,
    ((![P : type > $o, T : type]: ((![T4 : type]: ((![T12 : type, T22 : type]: ((T4 = (fun @ T12 @ T22)) => (P @ T12))) => ((![T12 : type, T22 : type]: ((T4 = (fun @ T12 @ T22)) => (P @ T22))) => (P @ T4)))) => (P @ T))))). % type_induct
thf(fact_16_Var_Oprems_I2_J, axiom,
    ((it @ u1))). % Var.prems(2)
thf(fact_17_uIT, axiom,
    ((it @ u))). % uIT
thf(fact_18_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_19_subst__eq, axiom,
    ((![K : nat, U : dB]: ((subst @ (var @ K) @ U @ K) = U)))). % subst_eq
thf(fact_20_local_OCons, axiom,
    ((rs = (cons_dB @ a @ as)))). % local.Cons
thf(fact_21_subst__App, axiom,
    ((![T3 : dB, U : dB, S : dB, K : nat]: ((subst @ (app @ T3 @ U) @ S @ K) = (app @ (subst @ T3 @ S @ K) @ (subst @ U @ S @ K)))))). % subst_App
thf(fact_22_subst__Var__IT, axiom,
    ((![R : dB, I : nat, J : nat]: ((it @ R) => (it @ (subst @ R @ (var @ I) @ J)))))). % subst_Var_IT
thf(fact_23_app__Var__IT, axiom,
    ((![T3 : dB, I : nat]: ((it @ T3) => (it @ (app @ T3 @ (var @ I))))))). % app_Var_IT
thf(fact_24_var__app__type__eq, axiom,
    ((![E : nat > type, I : nat, Ts2 : list_dB, T : type, U2 : type]: ((typing @ E @ (foldl_dB_dB @ app @ (var @ I) @ Ts2) @ T) => ((typing @ E @ (foldl_dB_dB @ app @ (var @ I) @ Ts2) @ U2) => (T = U2)))))). % var_app_type_eq
thf(fact_25_list__app__typeI, axiom,
    ((![E : nat > type, T3 : dB, Ts3 : list_type, T : type, Ts2 : list_dB]: ((typing @ E @ T3 @ (foldr_type_type @ fun @ Ts3 @ T)) => ((typings @ E @ Ts2 @ Ts3) => (typing @ E @ (foldl_dB_dB @ app @ T3 @ Ts2) @ T)))))). % list_app_typeI
thf(fact_26_list__app__typeE, axiom,
    ((![E : nat > type, T3 : dB, Ts2 : list_dB, T : type]: ((typing @ E @ (foldl_dB_dB @ app @ T3 @ Ts2) @ T) => (~ ((![Ts : list_type]: ((typing @ E @ T3 @ (foldr_type_type @ fun @ Ts @ T)) => (~ ((typings @ E @ Ts2 @ Ts))))))))))). % list_app_typeE
thf(fact_27_list__app__typeD, axiom,
    ((![E : nat > type, T3 : dB, Ts2 : list_dB, T : type]: ((typing @ E @ (foldl_dB_dB @ app @ T3 @ Ts2) @ T) => (?[Ts : list_type]: ((typing @ E @ T3 @ (foldr_type_type @ fun @ Ts @ T)) & (typings @ E @ Ts2 @ Ts))))))). % list_app_typeD
thf(fact_28_Var__IT, axiom,
    ((![N : nat]: (it @ (var @ N))))). % Var_IT
thf(fact_29_subst__lemma, axiom,
    ((![E : nat > type, T3 : dB, T : type, E2 : nat > type, U : dB, U2 : type, I : nat]: ((typing @ E @ T3 @ T) => ((typing @ E2 @ U @ U2) => ((E = (shift_type @ E2 @ I @ U2)) => (typing @ E2 @ (subst @ T3 @ U @ I) @ T))))))). % subst_lemma
thf(fact_30_var__app__typesE, axiom,
    ((![E : nat > type, I : nat, Ts2 : list_dB, T : type]: ((typing @ E @ (foldl_dB_dB @ app @ (var @ I) @ Ts2) @ T) => (~ ((![Ts : list_type]: ((typing @ E @ (var @ I) @ (foldr_type_type @ fun @ Ts @ T)) => (~ ((typings @ E @ Ts2 @ Ts))))))))))). % var_app_typesE
thf(fact_31_var__app__types, axiom,
    ((![E : nat > type, I : nat, Ts2 : list_dB, Us : list_dB, T : type, Ts3 : list_type, U2 : type]: ((typing @ E @ (foldl_dB_dB @ app @ (foldl_dB_dB @ app @ (var @ I) @ Ts2) @ Us) @ T) => ((typings @ E @ Ts2 @ Ts3) => ((typing @ E @ (foldl_dB_dB @ app @ (var @ I) @ Ts2) @ U2) => (?[Us2 : list_type]: ((U2 = (foldr_type_type @ fun @ Us2 @ T)) & (typings @ E @ Us @ Us2))))))))). % var_app_types
thf(fact_32_dB_Odistinct_I1_J, axiom,
    ((![X1 : nat, X21 : dB, X22 : dB]: (~ (((var @ X1) = (app @ X21 @ X22))))))). % dB.distinct(1)
thf(fact_33_App, axiom,
    ((![Env : nat > type, S : dB, T : type, U2 : type, T3 : dB]: ((typing @ Env @ S @ (fun @ T @ U2)) => ((typing @ Env @ T3 @ T) => (typing @ Env @ (app @ S @ T3) @ U2)))))). % App
thf(fact_34_typing__elims_I2_J, axiom,
    ((![E : nat > type, T3 : dB, U : dB, T : type]: ((typing @ E @ (app @ T3 @ U) @ T) => (~ ((![T4 : type]: ((typing @ E @ T3 @ (fun @ T4 @ T)) => (~ ((typing @ E @ U @ T4))))))))))). % typing_elims(2)
thf(fact_35_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_36_apps__eq__tail__conv, axiom,
    ((![R : dB, Ts2 : list_dB, S : dB]: (((foldl_dB_dB @ app @ R @ Ts2) = (foldl_dB_dB @ app @ S @ Ts2)) = (R = S))))). % apps_eq_tail_conv
thf(fact_37_Var_Oprems_I1_J, axiom,
    ((typing @ (shift_type @ e1 @ i1 @ t2) @ (foldl_dB_dB @ app @ (var @ n) @ rs) @ t_1))). % Var.prems(1)
thf(fact_38_lift__type, axiom,
    ((![E : nat > type, T3 : dB, T : type, I : nat, U2 : type]: ((typing @ E @ T3 @ T) => (typing @ (shift_type @ E @ I @ U2) @ (lift @ T3 @ I) @ T))))). % lift_type
thf(fact_39_IT_OVar, axiom,
    ((![Rs : list_dB, N : nat]: ((listsp_dB @ it @ Rs) => (it @ (foldl_dB_dB @ app @ (var @ N) @ Rs)))))). % IT.Var
thf(fact_40_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_41_typing_Oinducts, axiom,
    ((![X1 : nat > type, X2 : dB, X3 : type, P : (nat > type) > dB > type > $o]: ((typing @ X1 @ X2 @ X3) => ((![Env2 : nat > type, X4 : nat, T4 : type]: (((Env2 @ X4) = T4) => (P @ Env2 @ (var @ X4) @ T4))) => ((![Env2 : nat > type, T4 : type, T5 : dB, U3 : type]: ((typing @ (shift_type @ Env2 @ zero_zero_nat @ T4) @ T5 @ U3) => ((P @ (shift_type @ Env2 @ zero_zero_nat @ T4) @ T5 @ U3) => (P @ Env2 @ (abs @ T5) @ (fun @ T4 @ U3))))) => ((![Env2 : nat > type, S2 : dB, T4 : type, U3 : type, T5 : dB]: ((typing @ Env2 @ S2 @ (fun @ T4 @ U3)) => ((P @ Env2 @ S2 @ (fun @ T4 @ U3)) => ((typing @ Env2 @ T5 @ T4) => ((P @ Env2 @ T5 @ T4) => (P @ Env2 @ (app @ S2 @ T5) @ U3)))))) => (P @ X1 @ X2 @ X3)))))))). % typing.inducts
thf(fact_42_Var_Oprems_I3_J, axiom,
    ((typing @ e1 @ u1 @ t2))). % Var.prems(3)
thf(fact_43_dB_Oinject_I3_J, axiom,
    ((![X3 : dB, Y3 : dB]: (((abs @ X3) = (abs @ Y3)) = (X3 = Y3))))). % dB.inject(3)
thf(fact_44_shift__gt, axiom,
    ((![J : nat, I : nat, E : nat > type, T : type]: ((ord_less_nat @ J @ I) => ((shift_type @ E @ I @ T @ J) = (E @ J)))))). % shift_gt
thf(fact_45_subst__lift, axiom,
    ((![T3 : dB, K : nat, S : dB]: ((subst @ (lift @ T3 @ K) @ S @ K) = T3)))). % subst_lift
thf(fact_46_lift__IT, axiom,
    ((![T3 : dB, I : nat]: ((it @ T3) => (it @ (lift @ T3 @ I)))))). % lift_IT
thf(fact_47_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_48_Lambda, axiom,
    ((![R : dB]: ((it @ R) => (it @ (abs @ R)))))). % Lambda
thf(fact_49_IT_Oinducts, axiom,
    ((![X : dB, P : dB > $o]: ((it @ X) => ((![Rs2 : list_dB, N2 : nat]: ((listsp_dB @ (^[X5 : dB]: (((it @ X5)) & ((P @ X5)))) @ 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_50_abs__typeE, axiom,
    ((![E : nat > type, T3 : dB, T : type]: ((typing @ E @ (abs @ T3) @ T) => (~ ((![U3 : type, V : type]: (~ ((typing @ (shift_type @ E @ zero_zero_nat @ U3) @ T3 @ V)))))))))). % abs_typeE
thf(fact_51_dB_Odistinct_I5_J, axiom,
    ((![X21 : dB, X22 : dB, X3 : dB]: (~ (((app @ X21 @ X22) = (abs @ X3))))))). % dB.distinct(5)
thf(fact_52_dB_Odistinct_I3_J, axiom,
    ((![X1 : nat, X3 : dB]: (~ (((var @ X1) = (abs @ X3))))))). % dB.distinct(3)
thf(fact_53_lift_Osimps_I2_J, axiom,
    ((![S : dB, T3 : dB, K : nat]: ((lift @ (app @ S @ T3) @ K) = (app @ (lift @ S @ K) @ (lift @ T3 @ K)))))). % lift.simps(2)
thf(fact_54_IT_Osimps, axiom,
    ((it = (^[A : dB]: (((?[Rs3 : list_dB]: (?[N3 : nat]: (((A = (foldl_dB_dB @ app @ (var @ N3) @ Rs3))) & ((listsp_dB @ it @ Rs3)))))) | ((((?[R3 : dB]: (((A = (abs @ R3))) & ((it @ R3))))) | ((?[R3 : dB]: (?[S3 : dB]: (?[Ss3 : list_dB]: (((A = (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_55_IT_Ocases, axiom,
    ((![A2 : dB]: ((it @ A2) => ((![Rs2 : list_dB]: ((?[N2 : nat]: (A2 = (foldl_dB_dB @ app @ (var @ N2) @ Rs2))) => (~ ((listsp_dB @ it @ Rs2))))) => ((![R2 : dB]: ((A2 = (abs @ R2)) => (~ ((it @ R2))))) => (~ ((![R2 : dB, S2 : dB, Ss2 : list_dB]: ((A2 = (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_56_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_57_typing__elims_I3_J, axiom,
    ((![E : nat > type, T3 : dB, T : type]: ((typing @ E @ (abs @ T3) @ T) => (~ ((![T4 : type, U3 : type]: ((T = (fun @ T4 @ U3)) => (~ ((typing @ (shift_type @ E @ zero_zero_nat @ T4) @ T3 @ U3))))))))))). % typing_elims(3)
thf(fact_58_Abs, axiom,
    ((![Env : nat > type, T : type, T3 : dB, U2 : type]: ((typing @ (shift_type @ Env @ zero_zero_nat @ T) @ T3 @ U2) => (typing @ Env @ (abs @ T3) @ (fun @ T @ U2)))))). % Abs
thf(fact_59_dB_Oinduct, axiom,
    ((![P : dB > $o, DB : dB]: ((![X4 : nat]: (P @ (var @ X4))) => ((![X1a : dB, X23 : dB]: ((P @ X1a) => ((P @ X23) => (P @ (app @ X1a @ X23))))) => ((![X4 : dB]: ((P @ X4) => (P @ (abs @ X4)))) => (P @ DB))))))). % dB.induct
thf(fact_60_dB_Oexhaust, axiom,
    ((![Y : dB]: ((![X12 : nat]: (~ ((Y = (var @ X12))))) => ((![X212 : dB, X222 : dB]: (~ ((Y = (app @ X212 @ X222))))) => (~ ((![X32 : dB]: (~ ((Y = (abs @ X32)))))))))))). % dB.exhaust
thf(fact_61_Var__apps__neq__Abs__apps, axiom,
    ((![N : nat, Ts2 : list_dB, R : dB, Ss : list_dB]: (~ (((foldl_dB_dB @ app @ (var @ N) @ Ts2) = (foldl_dB_dB @ app @ (abs @ R) @ Ss))))))). % Var_apps_neq_Abs_apps
thf(fact_62_Abs__App__neq__Var__apps, axiom,
    ((![S : dB, T3 : dB, N : nat, Ss : list_dB]: (~ (((app @ (abs @ S) @ T3) = (foldl_dB_dB @ app @ (var @ N) @ Ss))))))). % Abs_App_neq_Var_apps
thf(fact_63_ex__head__tail, axiom,
    ((![T3 : dB]: (?[Ts4 : list_dB, H : dB]: ((T3 = (foldl_dB_dB @ app @ H @ Ts4)) & ((?[N2 : nat]: (H = (var @ N2))) | (?[U4 : dB]: (H = (abs @ U4))))))))). % ex_head_tail
thf(fact_64_typing_Ocases, axiom,
    ((![A1 : nat > type, A22 : dB, A3 : type]: ((typing @ A1 @ A22 @ A3) => ((![X4 : nat]: ((A22 = (var @ X4)) => (~ (((A1 @ X4) = A3))))) => ((![T4 : type, T5 : dB]: ((A22 = (abs @ T5)) => (![U3 : type]: ((A3 = (fun @ T4 @ U3)) => (~ ((typing @ (shift_type @ A1 @ zero_zero_nat @ T4) @ T5 @ U3))))))) => (~ ((![S2 : dB, T4 : type, U3 : type, T5 : dB]: ((A22 = (app @ S2 @ T5)) => ((A3 = U3) => ((typing @ A1 @ S2 @ (fun @ T4 @ U3)) => (~ ((typing @ A1 @ T5 @ T4))))))))))))))). % typing.cases
thf(fact_65_typing_Osimps, axiom,
    ((typing = (^[A12 : nat > type]: (^[A23 : dB]: (^[A32 : type]: (((?[Env3 : nat > type]: (?[X5 : nat]: (?[T6 : type]: (((A12 = Env3)) & ((((A23 = (var @ X5))) & ((((A32 = T6)) & (((Env3 @ X5) = T6))))))))))) | ((((?[Env3 : nat > type]: (?[T6 : type]: (?[T7 : dB]: (?[U5 : type]: (((A12 = Env3)) & ((((A23 = (abs @ T7))) & ((((A32 = (fun @ T6 @ U5))) & ((typing @ (shift_type @ Env3 @ zero_zero_nat @ T6) @ T7 @ U5)))))))))))) | ((?[Env3 : nat > type]: (?[S3 : dB]: (?[T6 : type]: (?[U5 : type]: (?[T7 : dB]: (((A12 = Env3)) & ((((A23 = (app @ S3 @ T7))) & ((((A32 = U5)) & ((((typing @ Env3 @ S3 @ (fun @ T6 @ U5))) & ((typing @ Env3 @ T7 @ T6)))))))))))))))))))))))). % typing.simps
thf(fact_66_bot__nat__0_Onot__eq__extremum, axiom,
    ((![A2 : nat]: ((~ ((A2 = zero_zero_nat))) = (ord_less_nat @ zero_zero_nat @ A2))))). % bot_nat_0.not_eq_extremum
thf(fact_67_less__nat__zero__code, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % less_nat_zero_code
thf(fact_68_neq0__conv, axiom,
    ((![N : nat]: ((~ ((N = zero_zero_nat))) = (ord_less_nat @ zero_zero_nat @ N))))). % neq0_conv
thf(fact_69_not__gr__zero, axiom,
    ((![N : nat]: ((~ ((ord_less_nat @ zero_zero_nat @ N))) = (N = zero_zero_nat))))). % not_gr_zero
thf(fact_70_listsp__conj__eq, axiom,
    ((![A4 : dB > $o, B : dB > $o]: ((listsp_dB @ (^[X5 : dB]: (((A4 @ X5)) & ((B @ X5))))) = (^[X5 : list_dB]: (((listsp_dB @ A4 @ X5)) & ((listsp_dB @ B @ X5)))))))). % listsp_conj_eq
thf(fact_71_list_Oinject, axiom,
    ((![X21 : dB, X22 : list_dB, Y21 : dB, Y22 : list_dB]: (((cons_dB @ X21 @ X22) = (cons_dB @ Y21 @ Y22)) = (((X21 = Y21)) & ((X22 = Y22))))))). % list.inject
thf(fact_72_zero__reorient, axiom,
    ((![X : nat]: ((zero_zero_nat = X) = (X = zero_zero_nat))))). % zero_reorient
thf(fact_73_zero__reorient, axiom,
    ((![X : int]: ((zero_zero_int = X) = (X = zero_zero_int))))). % zero_reorient
thf(fact_74_not__Cons__self2, axiom,
    ((![X : dB, Xs : list_dB]: (~ (((cons_dB @ X @ Xs) = Xs)))))). % not_Cons_self2
thf(fact_75_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_76_less__not__refl, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ N)))))). % less_not_refl
thf(fact_77_less__not__refl2, axiom,
    ((![N : nat, M : nat]: ((ord_less_nat @ N @ M) => (~ ((M = N))))))). % less_not_refl2
thf(fact_78_less__not__refl3, axiom,
    ((![S : nat, T3 : nat]: ((ord_less_nat @ S @ T3) => (~ ((S = T3))))))). % less_not_refl3
thf(fact_79_less__irrefl__nat, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ N)))))). % less_irrefl_nat
thf(fact_80_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_81_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_82_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_83_gr__zeroI, axiom,
    ((![N : nat]: ((~ ((N = zero_zero_nat))) => (ord_less_nat @ zero_zero_nat @ N))))). % gr_zeroI
thf(fact_84_not__less__zero, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % not_less_zero
thf(fact_85_gr__implies__not__zero, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (~ ((N = zero_zero_nat))))))). % gr_implies_not_zero
thf(fact_86_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_87_gr0I, axiom,
    ((![N : nat]: ((~ ((N = zero_zero_nat))) => (ord_less_nat @ zero_zero_nat @ N))))). % gr0I
thf(fact_88_not__gr0, axiom,
    ((![N : nat]: ((~ ((ord_less_nat @ zero_zero_nat @ N))) = (N = zero_zero_nat))))). % not_gr0
thf(fact_89_not__less0, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % not_less0
thf(fact_90_less__zeroE, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % less_zeroE
thf(fact_91_gr__implies__not0, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (~ ((N = zero_zero_nat))))))). % gr_implies_not0
thf(fact_92_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_93_bot__nat__0_Oextremum__strict, axiom,
    ((![A2 : nat]: (~ ((ord_less_nat @ A2 @ zero_zero_nat)))))). % bot_nat_0.extremum_strict
thf(fact_94_foldl__Cons, axiom,
    ((![F : dB > dB > dB, A2 : dB, X : dB, Xs : list_dB]: ((foldl_dB_dB @ F @ A2 @ (cons_dB @ X @ Xs)) = (foldl_dB_dB @ F @ (F @ A2 @ X) @ Xs))))). % foldl_Cons
thf(fact_95_listsp__simps_I2_J, axiom,
    ((![A4 : dB > $o, X : dB, Xs : list_dB]: ((listsp_dB @ A4 @ (cons_dB @ X @ Xs)) = (((A4 @ X)) & ((listsp_dB @ A4 @ Xs))))))). % listsp_simps(2)
thf(fact_96_listspE, axiom,
    ((![A4 : dB > $o, X : dB, L : list_dB]: ((listsp_dB @ A4 @ (cons_dB @ X @ L)) => (~ (((A4 @ X) => (~ ((listsp_dB @ A4 @ L)))))))))). % listspE
thf(fact_97_listsp_OCons, axiom,
    ((![A4 : dB > $o, A2 : dB, L : list_dB]: ((A4 @ A2) => ((listsp_dB @ A4 @ L) => (listsp_dB @ A4 @ (cons_dB @ A2 @ L))))))). % listsp.Cons
thf(fact_98_less__numeral__extra_I3_J, axiom,
    ((~ ((ord_less_nat @ zero_zero_nat @ zero_zero_nat))))). % less_numeral_extra(3)
thf(fact_99_less__numeral__extra_I3_J, axiom,
    ((~ ((ord_less_int @ zero_zero_int @ zero_zero_int))))). % less_numeral_extra(3)
thf(fact_100_typings_Osimps_I2_J, axiom,
    ((![E : nat > type, T3 : dB, Ts2 : list_dB, Ts3 : list_type]: ((typings @ E @ (cons_dB @ T3 @ Ts2) @ Ts3) = (case_list_o_type @ $false @ (^[T6 : type]: (^[Ts5 : list_type]: (((typing @ E @ T3 @ T6)) & ((typings @ E @ Ts2 @ Ts5))))) @ Ts3))))). % typings.simps(2)
thf(fact_101_dB_Osize__gen_I1_J, axiom,
    ((![X1 : nat]: ((size_dB @ (var @ X1)) = zero_zero_nat)))). % dB.size_gen(1)
thf(fact_102_lifts__IT, axiom,
    ((![Ts2 : list_dB]: ((listsp_dB @ it @ Ts2) => (listsp_dB @ it @ (map_dB_dB @ (^[T7 : dB]: (lift @ T7 @ zero_zero_nat)) @ Ts2)))))). % lifts_IT
thf(fact_103_map__ident, axiom,
    (((map_dB_dB @ (^[X5 : dB]: X5)) = (^[Xs2 : list_dB]: Xs2)))). % map_ident
thf(fact_104_subst__map, axiom,
    ((![T3 : dB, Ts2 : list_dB, U : dB, I : nat]: ((subst @ (foldl_dB_dB @ app @ T3 @ Ts2) @ U @ I) = (foldl_dB_dB @ app @ (subst @ T3 @ U @ I) @ (map_dB_dB @ (^[T7 : dB]: (subst @ T7 @ U @ I)) @ Ts2)))))). % subst_map
thf(fact_105_lift__map, axiom,
    ((![T3 : dB, Ts2 : list_dB, I : nat]: ((lift @ (foldl_dB_dB @ app @ T3 @ Ts2) @ I) = (foldl_dB_dB @ app @ (lift @ T3 @ I) @ (map_dB_dB @ (^[T7 : dB]: (lift @ T7 @ I)) @ Ts2)))))). % lift_map
thf(fact_106_foldl__map, axiom,
    ((![G : dB > dB > dB, A2 : dB, F : dB > dB, Xs : list_dB]: ((foldl_dB_dB @ G @ A2 @ (map_dB_dB @ F @ Xs)) = (foldl_dB_dB @ (^[A : dB]: (^[X5 : dB]: (G @ A @ (F @ X5)))) @ A2 @ Xs))))). % foldl_map
thf(fact_107_list_Omap__ident, axiom,
    ((![T3 : list_dB]: ((map_dB_dB @ (^[X5 : dB]: X5) @ T3) = T3)))). % list.map_ident
thf(fact_108_list_Ocase__distrib, axiom,
    ((![H2 : $o > $o, F1 : $o, F2 : type > list_type > $o, List : list_type]: ((H2 @ (case_list_o_type @ F1 @ F2 @ List)) = (case_list_o_type @ (H2 @ F1) @ (^[X13 : type]: (^[X24 : list_type]: (H2 @ (F2 @ X13 @ X24)))) @ List))))). % list.case_distrib
thf(fact_109_map__eq__Cons__conv, axiom,
    ((![F : dB > dB, Xs : list_dB, Y : dB, Ys : list_dB]: (((map_dB_dB @ F @ Xs) = (cons_dB @ Y @ Ys)) = (?[Z : dB]: (?[Zs : list_dB]: (((Xs = (cons_dB @ Z @ Zs))) & (((((F @ Z) = Y)) & (((map_dB_dB @ F @ Zs) = Ys))))))))))). % map_eq_Cons_conv
thf(fact_110_Cons__eq__map__conv, axiom,
    ((![X : dB, Xs : list_dB, F : dB > dB, Ys : list_dB]: (((cons_dB @ X @ Xs) = (map_dB_dB @ F @ Ys)) = (?[Z : dB]: (?[Zs : list_dB]: (((Ys = (cons_dB @ Z @ Zs))) & ((((X = (F @ Z))) & ((Xs = (map_dB_dB @ F @ Zs)))))))))))). % Cons_eq_map_conv
thf(fact_111_map__eq__Cons__D, axiom,
    ((![F : dB > dB, Xs : list_dB, Y : dB, Ys : list_dB]: (((map_dB_dB @ F @ Xs) = (cons_dB @ Y @ Ys)) => (?[Z2 : dB, Zs2 : list_dB]: ((Xs = (cons_dB @ Z2 @ Zs2)) & (((F @ Z2) = Y) & ((map_dB_dB @ F @ Zs2) = Ys)))))))). % map_eq_Cons_D
thf(fact_112_Cons__eq__map__D, axiom,
    ((![X : dB, Xs : list_dB, F : dB > dB, Ys : list_dB]: (((cons_dB @ X @ Xs) = (map_dB_dB @ F @ Ys)) => (?[Z2 : dB, Zs2 : list_dB]: ((Ys = (cons_dB @ Z2 @ Zs2)) & ((X = (F @ Z2)) & (Xs = (map_dB_dB @ F @ Zs2))))))))). % Cons_eq_map_D
thf(fact_113_list_Osimps_I9_J, axiom,
    ((![F : dB > dB, X21 : dB, X22 : list_dB]: ((map_dB_dB @ F @ (cons_dB @ X21 @ X22)) = (cons_dB @ (F @ X21) @ (map_dB_dB @ F @ X22)))))). % list.simps(9)
thf(fact_114_list_Osimps_I5_J, axiom,
    ((![F1 : $o, F2 : type > list_type > $o, X21 : type, X22 : list_type]: ((case_list_o_type @ F1 @ F2 @ (cons_type @ X21 @ X22)) = (F2 @ X21 @ X22))))). % list.simps(5)
thf(fact_115_lift__types, axiom,
    ((![E : nat > type, Ts2 : list_dB, Ts3 : list_type, I : nat, U2 : type]: ((typings @ E @ Ts2 @ Ts3) => (typings @ (shift_type @ E @ I @ U2) @ (map_dB_dB @ (^[T7 : dB]: (lift @ T7 @ I)) @ Ts2) @ Ts3))))). % lift_types
thf(fact_116_substs__lemma, axiom,
    ((![E : nat > type, U : dB, T : type, I : nat, Ts2 : list_dB, Ts3 : list_type]: ((typing @ E @ U @ T) => ((typings @ (shift_type @ E @ I @ T) @ Ts2 @ Ts3) => (typings @ E @ (map_dB_dB @ (^[T7 : dB]: (subst @ T7 @ U @ I)) @ Ts2) @ Ts3)))))). % substs_lemma
thf(fact_117_map__eq__map__tailrec, axiom,
    ((map_dB_dB = map_tailrec_dB_dB))). % map_eq_map_tailrec
thf(fact_118_of__nat__0__less__iff, axiom,
    ((![N : nat]: ((ord_less_nat @ zero_zero_nat @ (semiri1382578993at_nat @ N)) = (ord_less_nat @ zero_zero_nat @ N))))). % of_nat_0_less_iff
thf(fact_119_of__nat__0__less__iff, axiom,
    ((![N : nat]: ((ord_less_int @ zero_zero_int @ (semiri2019852685at_int @ N)) = (ord_less_nat @ zero_zero_nat @ N))))). % of_nat_0_less_iff
thf(fact_120_of__nat__eq__iff, axiom,
    ((![M : nat, N : nat]: (((semiri2019852685at_int @ M) = (semiri2019852685at_int @ N)) = (M = N))))). % of_nat_eq_iff
thf(fact_121_of__nat__0, axiom,
    (((semiri1382578993at_nat @ zero_zero_nat) = zero_zero_nat))). % of_nat_0
thf(fact_122_of__nat__0, axiom,
    (((semiri2019852685at_int @ zero_zero_nat) = zero_zero_int))). % of_nat_0
thf(fact_123_of__nat__0__eq__iff, axiom,
    ((![N : nat]: ((zero_zero_nat = (semiri1382578993at_nat @ N)) = (zero_zero_nat = N))))). % of_nat_0_eq_iff
thf(fact_124_of__nat__0__eq__iff, axiom,
    ((![N : nat]: ((zero_zero_int = (semiri2019852685at_int @ N)) = (zero_zero_nat = N))))). % of_nat_0_eq_iff
thf(fact_125_of__nat__eq__0__iff, axiom,
    ((![M : nat]: (((semiri1382578993at_nat @ M) = zero_zero_nat) = (M = zero_zero_nat))))). % of_nat_eq_0_iff
thf(fact_126_of__nat__eq__0__iff, axiom,
    ((![M : nat]: (((semiri2019852685at_int @ M) = zero_zero_int) = (M = zero_zero_nat))))). % of_nat_eq_0_iff
thf(fact_127_of__nat__less__iff, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ (semiri1382578993at_nat @ M) @ (semiri1382578993at_nat @ N)) = (ord_less_nat @ M @ N))))). % of_nat_less_iff
thf(fact_128_of__nat__less__iff, axiom,
    ((![M : nat, N : nat]: ((ord_less_int @ (semiri2019852685at_int @ M) @ (semiri2019852685at_int @ N)) = (ord_less_nat @ M @ N))))). % of_nat_less_iff
thf(fact_129_of__nat__less__0__iff, axiom,
    ((![M : nat]: (~ ((ord_less_nat @ (semiri1382578993at_nat @ M) @ zero_zero_nat)))))). % of_nat_less_0_iff
thf(fact_130_of__nat__less__0__iff, axiom,
    ((![M : nat]: (~ ((ord_less_int @ (semiri2019852685at_int @ M) @ zero_zero_int)))))). % of_nat_less_0_iff
thf(fact_131_of__nat__less__imp__less, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ (semiri1382578993at_nat @ M) @ (semiri1382578993at_nat @ N)) => (ord_less_nat @ M @ N))))). % of_nat_less_imp_less
thf(fact_132_of__nat__less__imp__less, axiom,
    ((![M : nat, N : nat]: ((ord_less_int @ (semiri2019852685at_int @ M) @ (semiri2019852685at_int @ N)) => (ord_less_nat @ M @ N))))). % of_nat_less_imp_less
thf(fact_133_less__imp__of__nat__less, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (ord_less_nat @ (semiri1382578993at_nat @ M) @ (semiri1382578993at_nat @ N)))))). % less_imp_of_nat_less
thf(fact_134_less__imp__of__nat__less, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (ord_less_int @ (semiri2019852685at_int @ M) @ (semiri2019852685at_int @ N)))))). % less_imp_of_nat_less
thf(fact_135_pos__int__cases, axiom,
    ((![K : int]: ((ord_less_int @ zero_zero_int @ K) => (~ ((![N2 : nat]: ((K = (semiri2019852685at_int @ N2)) => (~ ((ord_less_nat @ zero_zero_nat @ N2))))))))))). % pos_int_cases
thf(fact_136_zero__less__imp__eq__int, axiom,
    ((![K : int]: ((ord_less_int @ zero_zero_int @ K) => (?[N2 : nat]: ((ord_less_nat @ zero_zero_nat @ N2) & (K = (semiri2019852685at_int @ N2)))))))). % zero_less_imp_eq_int
thf(fact_137_int__int__eq, axiom,
    ((![M : nat, N : nat]: (((semiri2019852685at_int @ M) = (semiri2019852685at_int @ N)) = (M = N))))). % int_int_eq
thf(fact_138_nat__less__as__int, axiom,
    ((ord_less_nat = (^[A : nat]: (^[B2 : nat]: (ord_less_int @ (semiri2019852685at_int @ A) @ (semiri2019852685at_int @ B2))))))). % nat_less_as_int
thf(fact_139_nat__int__comparison_I2_J, axiom,
    ((ord_less_nat = (^[A : nat]: (^[B2 : nat]: (ord_less_int @ (semiri2019852685at_int @ A) @ (semiri2019852685at_int @ B2))))))). % nat_int_comparison(2)
thf(fact_140_verit__comp__simplify1_I1_J, axiom,
    ((![A2 : nat]: (~ ((ord_less_nat @ A2 @ A2)))))). % verit_comp_simplify1(1)
thf(fact_141_verit__comp__simplify1_I1_J, axiom,
    ((![A2 : int]: (~ ((ord_less_int @ A2 @ A2)))))). % verit_comp_simplify1(1)
thf(fact_142_int__if, axiom,
    ((![P : $o, A2 : nat, B3 : nat]: ((P => ((semiri2019852685at_int @ (if_nat @ P @ A2 @ B3)) = (semiri2019852685at_int @ A2))) & ((~ (P)) => ((semiri2019852685at_int @ (if_nat @ P @ A2 @ B3)) = (semiri2019852685at_int @ B3))))))). % int_if
thf(fact_143_nat__int__comparison_I1_J, axiom,
    (((^[Y2 : nat]: (^[Z3 : nat]: (Y2 = Z3))) = (^[A : nat]: (^[B2 : nat]: ((semiri2019852685at_int @ A) = (semiri2019852685at_int @ B2))))))). % nat_int_comparison(1)
thf(fact_144_int__ops_I1_J, axiom,
    (((semiri2019852685at_int @ zero_zero_nat) = zero_zero_int))). % int_ops(1)
thf(fact_145_neg__int__cases, axiom,
    ((![K : int]: ((ord_less_int @ K @ zero_zero_int) => (~ ((![N2 : nat]: ((K = (uminus_uminus_int @ (semiri2019852685at_int @ N2))) => (~ ((ord_less_nat @ zero_zero_nat @ N2))))))))))). % neg_int_cases
thf(fact_146_zero__less__nat__eq, axiom,
    ((![Z4 : int]: ((ord_less_nat @ zero_zero_nat @ (nat2 @ Z4)) = (ord_less_int @ zero_zero_int @ Z4))))). % zero_less_nat_eq
thf(fact_147_add_Oinverse__inverse, axiom,
    ((![A2 : int]: ((uminus_uminus_int @ (uminus_uminus_int @ A2)) = A2)))). % add.inverse_inverse
thf(fact_148_neg__equal__iff__equal, axiom,
    ((![A2 : int, B3 : int]: (((uminus_uminus_int @ A2) = (uminus_uminus_int @ B3)) = (A2 = B3))))). % neg_equal_iff_equal
thf(fact_149_add_Oinverse__neutral, axiom,
    (((uminus_uminus_int @ zero_zero_int) = zero_zero_int))). % add.inverse_neutral
thf(fact_150_neg__0__equal__iff__equal, axiom,
    ((![A2 : int]: ((zero_zero_int = (uminus_uminus_int @ A2)) = (zero_zero_int = A2))))). % neg_0_equal_iff_equal

% Helper facts (3)
thf(help_If_3_1_If_001t__Nat__Onat_T, axiom,
    ((![P : $o]: ((P = $true) | (P = $false))))).
thf(help_If_2_1_If_001t__Nat__Onat_T, axiom,
    ((![X : nat, Y : nat]: ((if_nat @ $false @ X @ Y) = Y)))).
thf(help_If_1_1_If_001t__Nat__Onat_T, axiom,
    ((![X : nat, Y : nat]: ((if_nat @ $true @ X @ Y) = X)))).

% Conjectures (2)
thf(conj_0, hypothesis,
    ((![T8 : type]: ((typing @ (shift_type @ e @ i @ t2) @ (var @ n) @ (fun @ T8 @ (foldr_type_type @ fun @ ts @ t))) => ((typing @ (shift_type @ e @ i @ t2) @ a @ T8) => thesis))))).
thf(conj_1, conjecture,
    (thesis)).
