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

% Could-be-implicit typings (5)
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).

% Explicit typings (41)
thf(sy_c_Groups_Oplus__class_Oplus_001t__Nat__Onat, type,
    plus_plus_nat : nat > 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_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_Obeta, type,
    beta : dB > 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_OdB_Osize__dB, type,
    size_dB : dB > nat).
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_Lambda_Osubstn, type,
    substn : dB > dB > nat > dB).
thf(sy_c_ListOrder_Ostep1_001t__Lambda__OdB, type,
    step1_dB : (dB > dB > $o) > list_dB > list_dB > $o).
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_Ogen__length_001t__Lambda__OdB, type,
    gen_length_dB : nat > list_dB > nat).
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_OSuc, type,
    suc : nat > nat).
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_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_r____, type,
    r : 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 (142)
thf(fact_0_Beta_Ohyps_I3_J, axiom,
    ((it @ a))). % Beta.hyps(3)
thf(fact_1_uT, axiom,
    ((typing @ e @ u @ t2))). % uT
thf(fact_2_T, axiom,
    ((typing @ (shift_type @ e @ i @ t2) @ (foldl_dB_dB @ app @ (app @ (abs @ r) @ a) @ as) @ t))). % T
thf(fact_3__092_060open_062IT_At_092_060close_062, axiom,
    ((it @ t3))). % \<open>IT t\<close>
thf(fact_4_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_5_dB_Oinject_I3_J, axiom,
    ((![X3 : dB, Y3 : dB]: (((abs @ X3) = (abs @ Y3)) = (X3 = Y3))))). % dB.inject(3)
thf(fact_6_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_7__092_060open_062e_092_060langle_062i_058T_092_060rangle_062_A_092_060turnstile_062_Ar_091a_P0_093_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 @ (subst @ r @ a @ zero_zero_nat) @ as) @ t))). % \<open>e\<langle>i:T\<rangle> \<turnstile> r[a/0] \<degree>\<degree> as : T'\<close>
thf(fact_8_dB_Odistinct_I5_J, axiom,
    ((![X21 : dB, X22 : dB, X3 : dB]: (~ (((app @ X21 @ X22) = (abs @ X3))))))). % dB.distinct(5)
thf(fact_9_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_10_Beta_Oprems_I1_J, axiom,
    ((typing @ (shift_type @ e1 @ i1 @ t2) @ (foldl_dB_dB @ app @ (app @ (abs @ r) @ a) @ as) @ t_1))). % Beta.prems(1)
thf(fact_11_abs__typeE, axiom,
    ((![E : nat > type, T2 : dB, T : type]: ((typing @ E @ (abs @ T2) @ T) => (~ ((![U : type, V : type]: (~ ((typing @ (shift_type @ E @ zero_zero_nat @ U) @ T2 @ V)))))))))). % abs_typeE
thf(fact_12_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_13_Beta_Ohyps_I1_J, axiom,
    ((it @ (foldl_dB_dB @ app @ (subst @ r @ a @ zero_zero_nat) @ as)))). % Beta.hyps(1)
thf(fact_14_lift__type, axiom,
    ((![E : nat > type, T2 : dB, T : type, I : nat, U2 : type]: ((typing @ E @ T2 @ T) => (typing @ (shift_type @ E @ I @ U2) @ (lift @ T2 @ I) @ T))))). % lift_type
thf(fact_15_Beta_Oprems_I2_J, axiom,
    ((it @ u1))). % Beta.prems(2)
thf(fact_16_uIT, axiom,
    ((it @ u))). % uIT
thf(fact_17_Beta_Oprems_I3_J, axiom,
    ((typing @ e1 @ u1 @ t2))). % Beta.prems(3)
thf(fact_18_SI2, axiom,
    ((![E : nat > type, I : nat, T3 : type, U3 : dB]: ((typing @ (shift_type @ E @ I @ t2) @ a @ T3) => ((it @ U3) => ((typing @ E @ U3 @ t2) => (it @ (subst @ a @ U3 @ I)))))))). % SI2
thf(fact_19_subst__lift, axiom,
    ((![T2 : dB, K : nat, S : dB]: ((subst @ (lift @ T2 @ K) @ S @ K) = T2)))). % subst_lift
thf(fact_20_lift__IT, axiom,
    ((![T2 : dB, I : nat]: ((it @ T2) => (it @ (lift @ T2 @ I)))))). % lift_IT
thf(fact_21__092_060open_062IT_A_I_Ir_091a_P0_093_A_092_060degree_062_092_060degree_062_Aas_J_091u_Pi_093_J_092_060close_062, axiom,
    ((it @ (subst @ (foldl_dB_dB @ app @ (subst @ r @ a @ zero_zero_nat) @ as) @ u @ i)))). % \<open>IT ((r[a/0] \<degree>\<degree> as)[u/i])\<close>
thf(fact_22_SI1, axiom,
    ((![E : nat > type, I : nat, T3 : type, U3 : dB]: ((typing @ (shift_type @ E @ I @ t2) @ (foldl_dB_dB @ app @ (subst @ r @ a @ zero_zero_nat) @ as) @ T3) => ((it @ U3) => ((typing @ E @ U3 @ t2) => (it @ (subst @ (foldl_dB_dB @ app @ (subst @ r @ a @ zero_zero_nat) @ as) @ U3 @ I)))))))). % SI1
thf(fact_23_subst__App, axiom,
    ((![T2 : dB, U3 : dB, S : dB, K : nat]: ((subst @ (app @ T2 @ U3) @ S @ K) = (app @ (subst @ T2 @ S @ K) @ (subst @ U3 @ S @ K)))))). % subst_App
thf(fact_24_lift_Osimps_I2_J, axiom,
    ((![S : dB, T2 : dB, K : nat]: ((lift @ (app @ S @ T2) @ K) = (app @ (lift @ S @ K) @ (lift @ T2 @ K)))))). % lift.simps(2)
thf(fact_25_subst__lemma, axiom,
    ((![E : nat > type, T2 : dB, T : type, E2 : nat > type, U3 : dB, U2 : type, I : nat]: ((typing @ E @ T2 @ T) => ((typing @ E2 @ U3 @ U2) => ((E = (shift_type @ E2 @ I @ U2)) => (typing @ E2 @ (subst @ T2 @ U3 @ I) @ T))))))). % subst_lemma
thf(fact_26_MI2, axiom,
    ((![T1 : type, T22 : type, T2 : dB, E : nat > type, I : nat, T : type, U3 : dB]: ((t2 = (fun @ T1 @ T22)) => ((it @ T2) => ((typing @ (shift_type @ E @ I @ T22) @ T2 @ T) => ((it @ U3) => ((typing @ E @ U3 @ T22) => (it @ (subst @ T2 @ U3 @ I)))))))))). % MI2
thf(fact_27_MI1, axiom,
    ((![T1 : type, T22 : type, T2 : dB, E : nat > type, I : nat, T : type, U3 : dB]: ((t2 = (fun @ T1 @ T22)) => ((it @ T2) => ((typing @ (shift_type @ E @ I @ T1) @ T2 @ T) => ((it @ U3) => ((typing @ E @ U3 @ T1) => (it @ (subst @ T2 @ U3 @ I)))))))))). % MI1
thf(fact_28__092_060open_062Abs_Ar_A_092_060degree_062_Aa_A_092_060degree_062_092_060degree_062_Aas_A_092_060rightarrow_062_092_060_094sub_062_092_060beta_062_Ar_091a_P0_093_A_092_060degree_062_092_060degree_062_Aas_092_060close_062, axiom,
    ((beta @ (foldl_dB_dB @ app @ (app @ (abs @ r) @ a) @ as) @ (foldl_dB_dB @ app @ (subst @ r @ a @ zero_zero_nat) @ as)))). % \<open>Abs r \<degree> a \<degree>\<degree> as \<rightarrow>\<^sub>\<beta> r[a/0] \<degree>\<degree> as\<close>
thf(fact_29_IT_OBeta, 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))))))). % IT.Beta
thf(fact_30__092_060open_062IT_A_Ir_091lift_Au_A0_PSuc_Ai_093_091a_091u_Pi_093_P0_093_A_092_060degree_062_092_060degree_062_Amap_A_I_092_060lambda_062t_O_At_091u_Pi_093_J_Aas_J_092_060close_062, axiom,
    ((it @ (foldl_dB_dB @ app @ (subst @ (subst @ r @ (lift @ u @ zero_zero_nat) @ (suc @ i)) @ (subst @ a @ u @ i) @ zero_zero_nat) @ (map_dB_dB @ (^[T4 : dB]: (subst @ T4 @ u @ i)) @ as))))). % \<open>IT (r[lift u 0/Suc i][a[u/i]/0] \<degree>\<degree> map (\<lambda>t. t[u/i]) as)\<close>
thf(fact_31_Lambda, axiom,
    ((![R : dB]: ((it @ R) => (it @ (abs @ R)))))). % Lambda
thf(fact_32_Abs, axiom,
    ((![Env : nat > type, T : type, T2 : dB, U2 : type]: ((typing @ (shift_type @ Env @ zero_zero_nat @ T) @ T2 @ U2) => (typing @ Env @ (abs @ T2) @ (fun @ T @ U2)))))). % Abs
thf(fact_33_typing__elims_I3_J, axiom,
    ((![E : nat > type, T2 : dB, T : type]: ((typing @ E @ (abs @ T2) @ T) => (~ ((![T5 : type, U : type]: ((T = (fun @ T5 @ U)) => (~ ((typing @ (shift_type @ E @ zero_zero_nat @ T5) @ T2 @ U))))))))))). % typing_elims(3)
thf(fact_34_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_35_shift__commute, axiom,
    ((![E : nat > type, I : nat, U2 : type, T : type]: ((shift_type @ (shift_type @ E @ I @ U2) @ zero_zero_nat @ T) = (shift_type @ (shift_type @ E @ zero_zero_nat @ T) @ (suc @ I) @ U2))))). % shift_commute
thf(fact_36_subst__map, axiom,
    ((![T2 : dB, Ts : list_dB, U3 : dB, I : nat]: ((subst @ (foldl_dB_dB @ app @ T2 @ Ts) @ U3 @ I) = (foldl_dB_dB @ app @ (subst @ T2 @ U3 @ I) @ (map_dB_dB @ (^[T4 : dB]: (subst @ T4 @ U3 @ I)) @ Ts)))))). % subst_map
thf(fact_37_lift__map, axiom,
    ((![T2 : dB, Ts : list_dB, I : nat]: ((lift @ (foldl_dB_dB @ app @ T2 @ Ts) @ I) = (foldl_dB_dB @ app @ (lift @ T2 @ I) @ (map_dB_dB @ (^[T4 : dB]: (lift @ T4 @ I)) @ Ts)))))). % lift_map
thf(fact_38_type__induct, axiom,
    ((![P : type > $o, T : type]: ((![T5 : type]: ((![T12 : type, T23 : type]: ((T5 = (fun @ T12 @ T23)) => (P @ T12))) => ((![T12 : type, T23 : type]: ((T5 = (fun @ T12 @ T23)) => (P @ T23))) => (P @ T5)))) => (P @ T))))). % type_induct
thf(fact_39_appL, axiom,
    ((![S : dB, T2 : dB, U3 : dB]: ((beta @ S @ T2) => (beta @ (app @ S @ U3) @ (app @ T2 @ U3)))))). % appL
thf(fact_40_appR, axiom,
    ((![S : dB, T2 : dB, U3 : dB]: ((beta @ S @ T2) => (beta @ (app @ U3 @ S) @ (app @ U3 @ T2)))))). % appR
thf(fact_41_subject__reduction, axiom,
    ((![E : nat > type, T2 : dB, T : type, T6 : dB]: ((typing @ E @ T2 @ T) => ((beta @ T2 @ T6) => (typing @ E @ T6 @ T)))))). % subject_reduction
thf(fact_42_beta__cases_I2_J, axiom,
    ((![R : dB, S : dB]: ((beta @ (abs @ R) @ S) => (~ ((![T7 : dB]: ((S = (abs @ T7)) => (~ ((beta @ R @ T7))))))))))). % beta_cases(2)
thf(fact_43_abs, axiom,
    ((![S : dB, T2 : dB]: ((beta @ S @ T2) => (beta @ (abs @ S) @ (abs @ T2)))))). % abs
thf(fact_44_subst__preserves__beta, axiom,
    ((![R : dB, S : dB, T2 : dB, I : nat]: ((beta @ R @ S) => (beta @ (subst @ R @ T2 @ I) @ (subst @ S @ T2 @ I)))))). % subst_preserves_beta
thf(fact_45_lift__preserves__beta, axiom,
    ((![R : dB, S : dB, I : nat]: ((beta @ R @ S) => (beta @ (lift @ R @ I) @ (lift @ S @ I)))))). % lift_preserves_beta
thf(fact_46_typing__elims_I2_J, axiom,
    ((![E : nat > type, T2 : dB, U3 : dB, T : type]: ((typing @ E @ (app @ T2 @ U3) @ T) => (~ ((![T5 : type]: ((typing @ E @ T2 @ (fun @ T5 @ T)) => (~ ((typing @ E @ U3 @ T5))))))))))). % typing_elims(2)
thf(fact_47_App, axiom,
    ((![Env : nat > type, S : dB, T : type, U2 : type, T2 : dB]: ((typing @ Env @ S @ (fun @ T @ U2)) => ((typing @ Env @ T2 @ T) => (typing @ Env @ (app @ S @ T2) @ U2)))))). % App
thf(fact_48_zero__reorient, axiom,
    ((![X : nat]: ((zero_zero_nat = X) = (X = zero_zero_nat))))). % zero_reorient
thf(fact_49_beta__cases_I3_J, axiom,
    ((![S : dB, T2 : dB, U3 : dB]: ((beta @ (app @ S @ T2) @ U3) => ((![S2 : dB]: ((S = (abs @ S2)) => (~ ((U3 = (subst @ S2 @ T2 @ zero_zero_nat)))))) => ((![T7 : dB]: ((U3 = (app @ T7 @ T2)) => (~ ((beta @ S @ T7))))) => (~ ((![T7 : dB]: ((U3 = (app @ S @ T7)) => (~ ((beta @ T2 @ T7))))))))))))). % beta_cases(3)
thf(fact_50_beta, axiom,
    ((![S : dB, T2 : dB]: (beta @ (app @ (abs @ S) @ T2) @ (subst @ S @ T2 @ zero_zero_nat))))). % beta
thf(fact_51_beta_Ocases, axiom,
    ((![A1 : dB, A2 : dB]: ((beta @ A1 @ A2) => ((![S2 : dB, T7 : dB]: ((A1 = (app @ (abs @ S2) @ T7)) => (~ ((A2 = (subst @ S2 @ T7 @ zero_zero_nat)))))) => ((![S2 : dB, T7 : dB, U4 : dB]: ((A1 = (app @ S2 @ U4)) => ((A2 = (app @ T7 @ U4)) => (~ ((beta @ S2 @ T7)))))) => ((![S2 : dB, T7 : dB, U4 : dB]: ((A1 = (app @ U4 @ S2)) => ((A2 = (app @ U4 @ T7)) => (~ ((beta @ S2 @ T7)))))) => (~ ((![S2 : dB]: ((A1 = (abs @ S2)) => (![T7 : dB]: ((A2 = (abs @ T7)) => (~ ((beta @ S2 @ T7)))))))))))))))). % beta.cases
thf(fact_52_beta_Osimps, axiom,
    ((beta = (^[A12 : dB]: (^[A22 : dB]: (((?[S3 : dB]: (?[T4 : dB]: (((A12 = (app @ (abs @ S3) @ T4))) & ((A22 = (subst @ S3 @ T4 @ zero_zero_nat))))))) | ((((?[S3 : dB]: (?[T4 : dB]: (?[U5 : dB]: (((A12 = (app @ S3 @ U5))) & ((((A22 = (app @ T4 @ U5))) & ((beta @ S3 @ T4))))))))) | ((((?[S3 : dB]: (?[T4 : dB]: (?[U5 : dB]: (((A12 = (app @ U5 @ S3))) & ((((A22 = (app @ U5 @ T4))) & ((beta @ S3 @ T4))))))))) | ((?[S3 : dB]: (?[T4 : dB]: (((A12 = (abs @ S3))) & ((((A22 = (abs @ T4))) & ((beta @ S3 @ T4)))))))))))))))))). % beta.simps
thf(fact_53_beta_Oinducts, axiom,
    ((![X1 : dB, X2 : dB, P : dB > dB > $o]: ((beta @ X1 @ X2) => ((![S2 : dB, T7 : dB]: (P @ (app @ (abs @ S2) @ T7) @ (subst @ S2 @ T7 @ zero_zero_nat))) => ((![S2 : dB, T7 : dB, U4 : dB]: ((beta @ S2 @ T7) => ((P @ S2 @ T7) => (P @ (app @ S2 @ U4) @ (app @ T7 @ U4))))) => ((![S2 : dB, T7 : dB, U4 : dB]: ((beta @ S2 @ T7) => ((P @ S2 @ T7) => (P @ (app @ U4 @ S2) @ (app @ U4 @ T7))))) => ((![S2 : dB, T7 : dB]: ((beta @ S2 @ T7) => ((P @ S2 @ T7) => (P @ (abs @ S2) @ (abs @ T7))))) => (P @ X1 @ X2))))))))). % beta.inducts
thf(fact_54_map__ident, axiom,
    (((map_dB_dB @ (^[X4 : dB]: X4)) = (^[Xs : list_dB]: Xs)))). % map_ident
thf(fact_55_apps__preserves__beta, axiom,
    ((![R : dB, S : dB, Ss : list_dB]: ((beta @ R @ S) => (beta @ (foldl_dB_dB @ app @ R @ Ss) @ (foldl_dB_dB @ app @ S @ Ss)))))). % apps_preserves_beta
thf(fact_56_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_57_old_Onat_Oinject, axiom,
    ((![Nat : nat, Nat2 : nat]: (((suc @ Nat) = (suc @ Nat2)) = (Nat = Nat2))))). % old.nat.inject
thf(fact_58_nat_Oinject, axiom,
    ((![X2 : nat, Y2 : nat]: (((suc @ X2) = (suc @ Y2)) = (X2 = Y2))))). % nat.inject
thf(fact_59_substs__lemma, axiom,
    ((![E : nat > type, U3 : dB, T : type, I : nat, Ts : list_dB, Ts2 : list_type]: ((typing @ E @ U3 @ T) => ((typings @ (shift_type @ E @ I @ T) @ Ts @ Ts2) => (typings @ E @ (map_dB_dB @ (^[T4 : dB]: (subst @ T4 @ U3 @ I)) @ Ts) @ Ts2)))))). % substs_lemma
thf(fact_60_Suc__inject, axiom,
    ((![X : nat, Y : nat]: (((suc @ X) = (suc @ Y)) => (X = Y))))). % Suc_inject
thf(fact_61_n__not__Suc__n, axiom,
    ((![N : nat]: (~ ((N = (suc @ N))))))). % n_not_Suc_n
thf(fact_62_list_Omap__ident, axiom,
    ((![T2 : list_dB]: ((map_dB_dB @ (^[X4 : dB]: X4) @ T2) = T2)))). % list.map_ident
thf(fact_63_lift__types, axiom,
    ((![E : nat > type, Ts : list_dB, Ts2 : list_type, I : nat, U2 : type]: ((typings @ E @ Ts @ Ts2) => (typings @ (shift_type @ E @ I @ U2) @ (map_dB_dB @ (^[T4 : dB]: (lift @ T4 @ I)) @ Ts) @ Ts2))))). % lift_types
thf(fact_64_nat_Odistinct_I1_J, axiom,
    ((![X2 : nat]: (~ ((zero_zero_nat = (suc @ X2))))))). % nat.distinct(1)
thf(fact_65_old_Onat_Odistinct_I2_J, axiom,
    ((![Nat2 : nat]: (~ (((suc @ Nat2) = zero_zero_nat)))))). % old.nat.distinct(2)
thf(fact_66_old_Onat_Odistinct_I1_J, axiom,
    ((![Nat2 : nat]: (~ ((zero_zero_nat = (suc @ Nat2))))))). % old.nat.distinct(1)
thf(fact_67_nat_OdiscI, axiom,
    ((![Nat : nat, X2 : nat]: ((Nat = (suc @ X2)) => (~ ((Nat = zero_zero_nat))))))). % nat.discI
thf(fact_68_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_69_diff__induct, axiom,
    ((![P : nat > nat > $o, M : nat, N : nat]: ((![X5 : nat]: (P @ X5 @ zero_zero_nat)) => ((![Y4 : nat]: (P @ zero_zero_nat @ (suc @ Y4))) => ((![X5 : nat, Y4 : nat]: ((P @ X5 @ Y4) => (P @ (suc @ X5) @ (suc @ Y4)))) => (P @ M @ N))))))). % diff_induct
thf(fact_70_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_71_Suc__neq__Zero, axiom,
    ((![M : nat]: (~ (((suc @ M) = zero_zero_nat)))))). % Suc_neq_Zero
thf(fact_72_Zero__neq__Suc, axiom,
    ((![M : nat]: (~ ((zero_zero_nat = (suc @ M))))))). % Zero_neq_Suc
thf(fact_73_Zero__not__Suc, axiom,
    ((![M : nat]: (~ ((zero_zero_nat = (suc @ M))))))). % Zero_not_Suc
thf(fact_74_old_Onat_Oexhaust, axiom,
    ((![Y : nat]: ((~ ((Y = zero_zero_nat))) => (~ ((![Nat3 : nat]: (~ ((Y = (suc @ Nat3))))))))))). % old.nat.exhaust
thf(fact_75_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_76_not0__implies__Suc, axiom,
    ((![N : nat]: ((~ ((N = zero_zero_nat))) => (?[M2 : nat]: (N = (suc @ M2))))))). % not0_implies_Suc
thf(fact_77_typing_Oinducts, axiom,
    ((![X1 : nat > type, X2 : dB, X3 : type, P : (nat > type) > dB > type > $o]: ((typing @ X1 @ X2 @ X3) => ((![Env2 : nat > type, X5 : nat, T5 : type]: (((Env2 @ X5) = T5) => (P @ Env2 @ (var @ X5) @ T5))) => ((![Env2 : nat > type, T5 : type, T7 : dB, U : type]: ((typing @ (shift_type @ Env2 @ zero_zero_nat @ T5) @ T7 @ U) => ((P @ (shift_type @ Env2 @ zero_zero_nat @ T5) @ T7 @ U) => (P @ Env2 @ (abs @ T7) @ (fun @ T5 @ U))))) => ((![Env2 : nat > type, S2 : dB, T5 : type, U : type, T7 : dB]: ((typing @ Env2 @ S2 @ (fun @ T5 @ U)) => ((P @ Env2 @ S2 @ (fun @ T5 @ U)) => ((typing @ Env2 @ T7 @ T5) => ((P @ Env2 @ T7 @ T5) => (P @ Env2 @ (app @ S2 @ T7) @ U)))))) => (P @ X1 @ X2 @ X3)))))))). % typing.inducts
thf(fact_78_typing_Osimps, axiom,
    ((typing = (^[A12 : nat > type]: (^[A22 : dB]: (^[A32 : type]: (((?[Env3 : nat > type]: (?[X4 : nat]: (?[T8 : type]: (((A12 = Env3)) & ((((A22 = (var @ X4))) & ((((A32 = T8)) & (((Env3 @ X4) = T8))))))))))) | ((((?[Env3 : nat > type]: (?[T8 : type]: (?[T4 : dB]: (?[U6 : type]: (((A12 = Env3)) & ((((A22 = (abs @ T4))) & ((((A32 = (fun @ T8 @ U6))) & ((typing @ (shift_type @ Env3 @ zero_zero_nat @ T8) @ T4 @ U6)))))))))))) | ((?[Env3 : nat > type]: (?[S3 : dB]: (?[T8 : type]: (?[U6 : type]: (?[T4 : dB]: (((A12 = Env3)) & ((((A22 = (app @ S3 @ T4))) & ((((A32 = U6)) & ((((typing @ Env3 @ S3 @ (fun @ T8 @ U6))) & ((typing @ Env3 @ T4 @ T8)))))))))))))))))))))))). % typing.simps
thf(fact_79_typing_Ocases, axiom,
    ((![A1 : nat > type, A2 : dB, A33 : type]: ((typing @ A1 @ A2 @ A33) => ((![X5 : nat]: ((A2 = (var @ X5)) => (~ (((A1 @ X5) = A33))))) => ((![T5 : type, T7 : dB]: ((A2 = (abs @ T7)) => (![U : type]: ((A33 = (fun @ T5 @ U)) => (~ ((typing @ (shift_type @ A1 @ zero_zero_nat @ T5) @ T7 @ U))))))) => (~ ((![S2 : dB, T5 : type, U : type, T7 : dB]: ((A2 = (app @ S2 @ T7)) => ((A33 = U) => ((typing @ A1 @ S2 @ (fun @ T5 @ U)) => (~ ((typing @ A1 @ T7 @ T5))))))))))))))). % typing.cases
thf(fact_80_list__app__typeI, axiom,
    ((![E : nat > type, T2 : dB, Ts2 : list_type, T : type, Ts : list_dB]: ((typing @ E @ T2 @ (foldr_type_type @ fun @ Ts2 @ T)) => ((typings @ E @ Ts @ Ts2) => (typing @ E @ (foldl_dB_dB @ app @ T2 @ Ts) @ T)))))). % list_app_typeI
thf(fact_81_list__app__typeE, axiom,
    ((![E : nat > type, T2 : dB, Ts : list_dB, T : type]: ((typing @ E @ (foldl_dB_dB @ app @ T2 @ Ts) @ T) => (~ ((![Ts3 : list_type]: ((typing @ E @ T2 @ (foldr_type_type @ fun @ Ts3 @ T)) => (~ ((typings @ E @ Ts @ Ts3))))))))))). % list_app_typeE
thf(fact_82_dB_Oinject_I1_J, axiom,
    ((![X1 : nat, Y1 : nat]: (((var @ X1) = (var @ Y1)) = (X1 = Y1))))). % dB.inject(1)
thf(fact_83_subst__eq, axiom,
    ((![K : nat, U3 : dB]: ((subst @ (var @ K) @ U3 @ K) = U3)))). % subst_eq
thf(fact_84_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_85_dB_Odistinct_I1_J, axiom,
    ((![X1 : nat, X21 : dB, X22 : dB]: (~ (((var @ X1) = (app @ X21 @ X22))))))). % dB.distinct(1)
thf(fact_86_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_87_typing_OVar, axiom,
    ((![Env : nat > type, X : nat, T : type]: (((Env @ X) = T) => (typing @ Env @ (var @ X) @ T))))). % typing.Var
thf(fact_88_beta__cases_I1_J, axiom,
    ((![I : nat, T2 : dB]: (~ ((beta @ (var @ I) @ T2)))))). % beta_cases(1)
thf(fact_89_dB_Odistinct_I3_J, axiom,
    ((![X1 : nat, X3 : dB]: (~ (((var @ X1) = (abs @ X3))))))). % dB.distinct(3)
thf(fact_90_Var__IT, axiom,
    ((![N : nat]: (it @ (var @ N))))). % Var_IT
thf(fact_91_dB_Oinduct, axiom,
    ((![P : dB > $o, DB : dB]: ((![X5 : nat]: (P @ (var @ X5))) => ((![X1a : dB, X23 : dB]: ((P @ X1a) => ((P @ X23) => (P @ (app @ X1a @ X23))))) => ((![X5 : dB]: ((P @ X5) => (P @ (abs @ X5)))) => (P @ DB))))))). % dB.induct
thf(fact_92_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_93_app__Var__IT, axiom,
    ((![T2 : dB, I : nat]: ((it @ T2) => (it @ (app @ T2 @ (var @ I))))))). % app_Var_IT
thf(fact_94_subst__Var__IT, axiom,
    ((![R : dB, I : nat, J : nat]: ((it @ R) => (it @ (subst @ R @ (var @ I) @ J)))))). % subst_Var_IT
thf(fact_95_var__app__typesE, axiom,
    ((![E : nat > type, I : nat, Ts : list_dB, T : type]: ((typing @ E @ (foldl_dB_dB @ app @ (var @ I) @ Ts) @ T) => (~ ((![Ts3 : list_type]: ((typing @ E @ (var @ I) @ (foldr_type_type @ fun @ Ts3 @ T)) => (~ ((typings @ E @ Ts @ Ts3))))))))))). % var_app_typesE
thf(fact_96_var__app__types, axiom,
    ((![E : nat > type, I : nat, Ts : list_dB, Us : list_dB, T : type, Ts2 : list_type, U2 : type]: ((typing @ E @ (foldl_dB_dB @ app @ (foldl_dB_dB @ app @ (var @ I) @ Ts) @ Us) @ T) => ((typings @ E @ Ts @ Ts2) => ((typing @ E @ (foldl_dB_dB @ app @ (var @ I) @ Ts) @ U2) => (?[Us2 : list_type]: ((U2 = (foldr_type_type @ fun @ Us2 @ T)) & (typings @ E @ Us @ Us2))))))))). % var_app_types
thf(fact_97_var__app__type__eq, axiom,
    ((![E : nat > type, I : nat, Ts : list_dB, T : type, U2 : type]: ((typing @ E @ (foldl_dB_dB @ app @ (var @ I) @ Ts) @ T) => ((typing @ E @ (foldl_dB_dB @ app @ (var @ I) @ Ts) @ U2) => (T = U2)))))). % var_app_type_eq
thf(fact_98_ex__head__tail, axiom,
    ((![T2 : dB]: (?[Ts4 : list_dB, H : dB]: ((T2 = (foldl_dB_dB @ app @ H @ Ts4)) & ((?[N2 : nat]: (H = (var @ N2))) | (?[U4 : dB]: (H = (abs @ U4))))))))). % ex_head_tail
thf(fact_99_Abs__App__neq__Var__apps, axiom,
    ((![S : dB, T2 : dB, N : nat, Ss : list_dB]: (~ (((app @ (abs @ S) @ T2) = (foldl_dB_dB @ app @ (var @ N) @ Ss))))))). % Abs_App_neq_Var_apps
thf(fact_100_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_101_list__app__typeD, axiom,
    ((![E : nat > type, T2 : dB, Ts : list_dB, T : type]: ((typing @ E @ (foldl_dB_dB @ app @ T2 @ Ts) @ T) => (?[Ts3 : list_type]: ((typing @ E @ T2 @ (foldr_type_type @ fun @ Ts3 @ T)) & (typings @ E @ Ts @ Ts3))))))). % list_app_typeD
thf(fact_102_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_103_IT_Osimps, axiom,
    ((it = (^[A3 : dB]: (((?[Rs3 : list_dB]: (?[N3 : nat]: (((A3 = (foldl_dB_dB @ app @ (var @ N3) @ 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_104_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_105_listsp__conj__eq, axiom,
    ((![A4 : dB > $o, B : dB > $o]: ((listsp_dB @ (^[X4 : dB]: (((A4 @ X4)) & ((B @ X4))))) = (^[X4 : list_dB]: (((listsp_dB @ A4 @ X4)) & ((listsp_dB @ B @ X4)))))))). % listsp_conj_eq
thf(fact_106_IT_OVar, axiom,
    ((![Rs : list_dB, N : nat]: ((listsp_dB @ it @ Rs) => (it @ (foldl_dB_dB @ app @ (var @ N) @ Rs)))))). % IT.Var
thf(fact_107_lifts__IT, axiom,
    ((![Ts : list_dB]: ((listsp_dB @ it @ Ts) => (listsp_dB @ it @ (map_dB_dB @ (^[T4 : dB]: (lift @ T4 @ zero_zero_nat)) @ Ts)))))). % lifts_IT
thf(fact_108_liftn__lift, axiom,
    ((![N : nat, T2 : dB, K : nat]: ((liftn @ (suc @ N) @ T2 @ K) = (lift @ (liftn @ N @ T2 @ K) @ K))))). % liftn_lift
thf(fact_109_liftn__0, axiom,
    ((![T2 : dB, K : nat]: ((liftn @ zero_zero_nat @ T2 @ K) = T2)))). % liftn_0
thf(fact_110_liftn_Osimps_I2_J, axiom,
    ((![N : nat, S : dB, T2 : dB, K : nat]: ((liftn @ N @ (app @ S @ T2) @ K) = (app @ (liftn @ N @ S @ K) @ (liftn @ N @ T2 @ K)))))). % liftn.simps(2)
thf(fact_111_substn__subst__n, axiom,
    ((substn = (^[T4 : dB]: (^[S3 : dB]: (^[N3 : nat]: (subst @ T4 @ (liftn @ N3 @ S3 @ zero_zero_nat) @ N3))))))). % substn_subst_n
thf(fact_112_head__Var__reduction, axiom,
    ((![N : nat, Rs : list_dB, V2 : dB]: ((beta @ (foldl_dB_dB @ app @ (var @ N) @ Rs) @ V2) => (?[Ss2 : list_dB]: ((step1_dB @ beta @ Rs @ Ss2) & (V2 = (foldl_dB_dB @ app @ (var @ N) @ Ss2)))))))). % head_Var_reduction
thf(fact_113_substn_Osimps_I2_J, axiom,
    ((![T2 : dB, U3 : dB, S : dB, K : nat]: ((substn @ (app @ T2 @ U3) @ S @ K) = (app @ (substn @ T2 @ S @ K) @ (substn @ U3 @ S @ K)))))). % substn.simps(2)
thf(fact_114_apps__preserves__betas, axiom,
    ((![Rs : list_dB, Ss : list_dB, R : dB]: ((step1_dB @ beta @ Rs @ Ss) => (beta @ (foldl_dB_dB @ app @ R @ Rs) @ (foldl_dB_dB @ app @ R @ Ss)))))). % apps_preserves_betas
thf(fact_115_substn__subst__0, axiom,
    ((![T2 : dB, S : dB]: ((substn @ T2 @ S @ zero_zero_nat) = (subst @ T2 @ S @ zero_zero_nat))))). % substn_subst_0
thf(fact_116_apps__betasE, axiom,
    ((![R : dB, Rs : list_dB, S : dB]: ((beta @ (foldl_dB_dB @ app @ R @ Rs) @ S) => ((![R4 : dB]: ((beta @ R @ R4) => (~ ((S = (foldl_dB_dB @ app @ R4 @ Rs)))))) => ((![Rs4 : list_dB]: ((step1_dB @ beta @ Rs @ Rs4) => (~ ((S = (foldl_dB_dB @ app @ R @ Rs4)))))) => (~ ((![T7 : dB]: ((R = (abs @ T7)) => (![U4 : dB, Us3 : list_dB]: ((Rs = (cons_dB @ U4 @ Us3)) => (~ ((S = (foldl_dB_dB @ app @ (subst @ T7 @ U4 @ zero_zero_nat) @ Us3)))))))))))))))). % apps_betasE
thf(fact_117_dB_Osize__gen_I1_J, axiom,
    ((![X1 : nat]: ((size_dB @ (var @ X1)) = zero_zero_nat)))). % dB.size_gen(1)
thf(fact_118_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_119_map__eq__Cons__conv, axiom,
    ((![F : dB > dB, Xs2 : list_dB, Y : dB, Ys : list_dB]: (((map_dB_dB @ F @ Xs2) = (cons_dB @ Y @ Ys)) = (?[Z : dB]: (?[Zs : list_dB]: (((Xs2 = (cons_dB @ Z @ Zs))) & (((((F @ Z) = Y)) & (((map_dB_dB @ F @ Zs) = Ys))))))))))). % map_eq_Cons_conv
thf(fact_120_Cons__eq__map__conv, axiom,
    ((![X : dB, Xs2 : list_dB, F : dB > dB, Ys : list_dB]: (((cons_dB @ X @ Xs2) = (map_dB_dB @ F @ Ys)) = (?[Z : dB]: (?[Zs : list_dB]: (((Ys = (cons_dB @ Z @ Zs))) & ((((X = (F @ Z))) & ((Xs2 = (map_dB_dB @ F @ Zs)))))))))))). % Cons_eq_map_conv
thf(fact_121_map__eq__Cons__D, axiom,
    ((![F : dB > dB, Xs2 : list_dB, Y : dB, Ys : list_dB]: (((map_dB_dB @ F @ Xs2) = (cons_dB @ Y @ Ys)) => (?[Z2 : dB, Zs2 : list_dB]: ((Xs2 = (cons_dB @ Z2 @ Zs2)) & (((F @ Z2) = Y) & ((map_dB_dB @ F @ Zs2) = Ys)))))))). % map_eq_Cons_D
thf(fact_122_Cons__eq__map__D, axiom,
    ((![X : dB, Xs2 : list_dB, F : dB > dB, Ys : list_dB]: (((cons_dB @ X @ Xs2) = (map_dB_dB @ F @ Ys)) => (?[Z2 : dB, Zs2 : list_dB]: ((Ys = (cons_dB @ Z2 @ Zs2)) & ((X = (F @ Z2)) & (Xs2 = (map_dB_dB @ F @ Zs2))))))))). % Cons_eq_map_D
thf(fact_123_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_124_not__Cons__self2, axiom,
    ((![X : dB, Xs2 : list_dB]: (~ (((cons_dB @ X @ Xs2) = Xs2)))))). % not_Cons_self2
thf(fact_125_foldl__Cons, axiom,
    ((![F : dB > dB > dB, A : dB, X : dB, Xs2 : list_dB]: ((foldl_dB_dB @ F @ A @ (cons_dB @ X @ Xs2)) = (foldl_dB_dB @ F @ (F @ A @ X) @ Xs2))))). % foldl_Cons
thf(fact_126_listsp__simps_I2_J, axiom,
    ((![A4 : dB > $o, X : dB, Xs2 : list_dB]: ((listsp_dB @ A4 @ (cons_dB @ X @ Xs2)) = (((A4 @ X)) & ((listsp_dB @ A4 @ Xs2))))))). % listsp_simps(2)
thf(fact_127_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_128_listsp_OCons, axiom,
    ((![A4 : dB > $o, A : dB, L : list_dB]: ((A4 @ A) => ((listsp_dB @ A4 @ L) => (listsp_dB @ A4 @ (cons_dB @ A @ L))))))). % listsp.Cons
thf(fact_129_typings_Osimps_I2_J, axiom,
    ((![E : nat > type, T2 : dB, Ts : list_dB, Ts2 : list_type]: ((typings @ E @ (cons_dB @ T2 @ Ts) @ Ts2) = (case_list_o_type @ $false @ (^[T8 : type]: (^[Ts5 : list_type]: (((typing @ E @ T2 @ T8)) & ((typings @ E @ Ts @ Ts5))))) @ Ts2))))). % typings.simps(2)
thf(fact_130_gen__length__code_I2_J, axiom,
    ((![N : nat, X : dB, Xs2 : list_dB]: ((gen_length_dB @ N @ (cons_dB @ X @ Xs2)) = (gen_length_dB @ (suc @ N) @ Xs2))))). % gen_length_code(2)
thf(fact_131_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_132_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_133_dB_Osize__gen_I3_J, axiom,
    ((![X3 : dB]: ((size_dB @ (abs @ X3)) = (plus_plus_nat @ (size_dB @ X3) @ (suc @ zero_zero_nat)))))). % dB.size_gen(3)
thf(fact_134_map__eq__map__tailrec, axiom,
    ((map_dB_dB = map_tailrec_dB_dB))). % map_eq_map_tailrec
thf(fact_135_add__left__cancel, axiom,
    ((![A : nat, B2 : nat, C : nat]: (((plus_plus_nat @ A @ B2) = (plus_plus_nat @ A @ C)) = (B2 = C))))). % add_left_cancel
thf(fact_136_add__right__cancel, axiom,
    ((![B2 : nat, A : nat, C : nat]: (((plus_plus_nat @ B2 @ A) = (plus_plus_nat @ C @ A)) = (B2 = C))))). % add_right_cancel
thf(fact_137_add_Oleft__neutral, axiom,
    ((![A : nat]: ((plus_plus_nat @ zero_zero_nat @ A) = A)))). % add.left_neutral
thf(fact_138_add_Oright__neutral, axiom,
    ((![A : nat]: ((plus_plus_nat @ A @ zero_zero_nat) = A)))). % add.right_neutral
thf(fact_139_add__cancel__left__left, axiom,
    ((![B2 : nat, A : nat]: (((plus_plus_nat @ B2 @ A) = A) = (B2 = zero_zero_nat))))). % add_cancel_left_left
thf(fact_140_add__cancel__left__right, axiom,
    ((![A : nat, B2 : nat]: (((plus_plus_nat @ A @ B2) = A) = (B2 = zero_zero_nat))))). % add_cancel_left_right
thf(fact_141_add__cancel__right__left, axiom,
    ((![A : nat, B2 : nat]: ((A = (plus_plus_nat @ B2 @ A)) = (B2 = zero_zero_nat))))). % add_cancel_right_left

% Conjectures (2)
thf(conj_0, hypothesis,
    ((![U7 : type]: ((typing @ (shift_type @ e @ i @ t2) @ (app @ (abs @ r) @ a) @ U7) => thesis)))).
thf(conj_1, conjecture,
    (thesis)).
