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

% Could-be-implicit typings (9)
thf(ty_n_t__List__Olist_It__List__Olist_It__LambdaType__Otype_J_J, type,
    list_list_type : $tType).
thf(ty_n_t__List__Olist_It__List__Olist_It__Lambda__OdB_J_J, type,
    list_list_dB : $tType).
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__Set__Oset_It__Lambda__OdB_J, type,
    set_dB : $tType).
thf(ty_n_t__Set__Oset_It__Nat__Onat_J, type,
    set_nat : $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 (54)
thf(sy_c_Groups_Ozero__class_Ozero_001t__Nat__Onat, type,
    zero_zero_nat : nat).
thf(sy_c_If_001t__List__Olist_It__LambdaType__Otype_J, type,
    if_list_type : $o > list_type > list_type > list_type).
thf(sy_c_If_001t__List__Olist_It__Lambda__OdB_J, type,
    if_list_dB : $o > list_dB > list_dB > list_dB).
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_Oappend_001t__LambdaType__Otype, type,
    append_type : list_type > list_type > list_type).
thf(sy_c_List_Oappend_001t__Lambda__OdB, type,
    append_dB : list_dB > list_dB > list_dB).
thf(sy_c_List_Ocount__list_001t__LambdaType__Otype, type,
    count_list_type : list_type > type > nat).
thf(sy_c_List_Ocount__list_001t__Lambda__OdB, type,
    count_list_dB : list_dB > dB > nat).
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_OCons_001t__List__Olist_It__LambdaType__Otype_J, type,
    cons_list_type : list_type > list_list_type > list_list_type).
thf(sy_c_List_Olist_OCons_001t__List__Olist_It__Lambda__OdB_J, type,
    cons_list_dB : list_dB > list_list_dB > list_list_dB).
thf(sy_c_List_Olist_ONil_001t__LambdaType__Otype, type,
    nil_type : list_type).
thf(sy_c_List_Olist_ONil_001t__Lambda__OdB, type,
    nil_dB : list_dB).
thf(sy_c_List_Olist_ONil_001t__List__Olist_It__LambdaType__Otype_J, type,
    nil_list_type : list_list_type).
thf(sy_c_List_Olist_ONil_001t__List__Olist_It__Lambda__OdB_J, type,
    nil_list_dB : list_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_Olist_Oset_001t__Lambda__OdB, type,
    set_dB2 : list_dB > set_dB).
thf(sy_c_List_Olistsp_001t__LambdaType__Otype, type,
    listsp_type : (type > $o) > list_type > $o).
thf(sy_c_List_Olistsp_001t__Lambda__OdB, type,
    listsp_dB : (dB > $o) > list_dB > $o).
thf(sy_c_List_On__lists_001t__LambdaType__Otype, type,
    n_lists_type : nat > list_type > list_list_type).
thf(sy_c_List_On__lists_001t__Lambda__OdB, type,
    n_lists_dB : nat > list_dB > list_list_dB).
thf(sy_c_List_Onths_001t__LambdaType__Otype, type,
    nths_type : list_type > set_nat > list_type).
thf(sy_c_List_Onths_001t__Lambda__OdB, type,
    nths_dB : list_dB > set_nat > list_dB).
thf(sy_c_Nat_OSuc, type,
    suc : nat > nat).
thf(sy_c_Nat_Osize__class_Osize_001t__Lambda__OdB, type,
    size_size_dB : dB > nat).
thf(sy_c_Set_OCollect_001t__Nat__Onat, type,
    collect_nat : (nat > $o) > set_nat).
thf(sy_c_member_001t__Lambda__OdB, type,
    member_dB : dB > set_dB > $o).
thf(sy_c_member_001t__Nat__Onat, type,
    member_nat : nat > set_nat > $o).
thf(sy_v_T, type,
    t : type).
thf(sy_v_Ta____, type,
    ta : type).
thf(sy_v_U____, type,
    u : type).
thf(sy_v_e, type,
    e : nat > type).
thf(sy_v_ea____, type,
    ea : nat > type).
thf(sy_v_s____, type,
    s : dB).
thf(sy_v_t, type,
    t2 : dB).
thf(sy_v_ta____, type,
    ta2 : dB).

% Relevant facts (159)
thf(fact_0_App_Ohyps_I2_J, axiom,
    ((it @ s))). % App.hyps(2)
thf(fact_1_App_Ohyps_I4_J, axiom,
    ((it @ ta2))). % App.hyps(4)
thf(fact_2_lift__IT, axiom,
    ((![T : dB, I : nat]: ((it @ T) => (it @ (lift @ T @ I)))))). % lift_IT
thf(fact_3_Var__IT, axiom,
    ((![N : nat]: (it @ (var @ N))))). % Var_IT
thf(fact_4_App_Ohyps_I1_J, axiom,
    ((typing @ ea @ s @ (fun @ ta @ u)))). % App.hyps(1)
thf(fact_5_Lambda, axiom,
    ((![R : dB]: ((it @ R) => (it @ (abs @ R)))))). % Lambda
thf(fact_6_subst__Var__IT, axiom,
    ((![R : dB, I : nat, J : nat]: ((it @ R) => (it @ (subst @ R @ (var @ I) @ J)))))). % subst_Var_IT
thf(fact_7__092_060open_062IT_A_Ilift_At_A0_J_092_060close_062, axiom,
    ((it @ (lift @ ta2 @ zero_zero_nat)))). % \<open>IT (lift t 0)\<close>
thf(fact_8_app__Var__IT, axiom,
    ((![T : dB, I : nat]: ((it @ T) => (it @ (app @ T @ (var @ I))))))). % app_Var_IT
thf(fact_9_assms, axiom,
    ((typing @ e @ t2 @ t))). % assms
thf(fact_10_App_Ohyps_I3_J, axiom,
    ((typing @ ea @ ta2 @ ta))). % App.hyps(3)
thf(fact_11__092_060open_062IT_A_IVar_A0_A_092_060degree_062_Alift_At_A0_J_092_060close_062, axiom,
    ((it @ (app @ (var @ zero_zero_nat) @ (lift @ ta2 @ zero_zero_nat))))). % \<open>IT (Var 0 \<degree> lift t 0)\<close>
thf(fact_12__092_060open_062e_092_060langle_0620_058T_A_092_060Rightarrow_062_AU_092_060rangle_062_A_092_060turnstile_062_AVar_A0_A_092_060degree_062_Alift_At_A0_A_058_AU_092_060close_062, axiom,
    ((typing @ (shift_type @ ea @ zero_zero_nat @ (fun @ ta @ u)) @ (app @ (var @ zero_zero_nat) @ (lift @ ta2 @ zero_zero_nat)) @ u))). % \<open>e\<langle>0:T \<Rightarrow> U\<rangle> \<turnstile> Var 0 \<degree> lift t 0 : U\<close>
thf(fact_13__092_060open_062e_092_060langle_0620_058T_A_092_060Rightarrow_062_AU_092_060rangle_062_A_092_060turnstile_062_Alift_At_A0_A_058_AT_092_060close_062, axiom,
    ((typing @ (shift_type @ ea @ zero_zero_nat @ (fun @ ta @ u)) @ (lift @ ta2 @ zero_zero_nat) @ ta))). % \<open>e\<langle>0:T \<Rightarrow> U\<rangle> \<turnstile> lift t 0 : T\<close>
thf(fact_14__092_060open_062e_092_060langle_0620_058T_A_092_060Rightarrow_062_AU_092_060rangle_062_A_092_060turnstile_062_AVar_A0_A_058_AT_A_092_060Rightarrow_062_AU_092_060close_062, axiom,
    ((typing @ (shift_type @ ea @ zero_zero_nat @ (fun @ ta @ u)) @ (var @ zero_zero_nat) @ (fun @ ta @ u)))). % \<open>e\<langle>0:T \<Rightarrow> U\<rangle> \<turnstile> Var 0 : T \<Rightarrow> U\<close>
thf(fact_15_subst__lift, axiom,
    ((![T : dB, K : nat, S : dB]: ((subst @ (lift @ T @ K) @ S @ K) = T)))). % subst_lift
thf(fact_16_subst__eq, axiom,
    ((![K : nat, U : dB]: ((subst @ (var @ K) @ U @ K) = U)))). % subst_eq
thf(fact_17_typing__elims_I2_J, axiom,
    ((![E : nat > type, T : dB, U : dB, T2 : type]: ((typing @ E @ (app @ T @ U) @ T2) => (~ ((![T3 : type]: ((typing @ E @ T @ (fun @ T3 @ T2)) => (~ ((typing @ E @ U @ T3))))))))))). % typing_elims(2)
thf(fact_18_typing_OApp, axiom,
    ((![Env : nat > type, S : dB, T2 : type, U2 : type, T : dB]: ((typing @ Env @ S @ (fun @ T2 @ U2)) => ((typing @ Env @ T @ T2) => (typing @ Env @ (app @ S @ T) @ U2)))))). % typing.App
thf(fact_19_dB_Oinduct, axiom,
    ((![P : dB > $o, DB : dB]: ((![X : nat]: (P @ (var @ X))) => ((![X1a : dB, X2 : dB]: ((P @ X1a) => ((P @ X2) => (P @ (app @ X1a @ X2))))) => ((![X : dB]: ((P @ X) => (P @ (abs @ X)))) => (P @ DB))))))). % dB.induct
thf(fact_20_dB_Oexhaust, axiom,
    ((![Y : dB]: ((![X1 : nat]: (~ ((Y = (var @ X1))))) => ((![X21 : dB, X22 : dB]: (~ ((Y = (app @ X21 @ X22))))) => (~ ((![X3 : dB]: (~ ((Y = (abs @ X3)))))))))))). % dB.exhaust
thf(fact_21_type_Oinject_I2_J, axiom,
    ((![X212 : type, X222 : type, Y21 : type, Y22 : type]: (((fun @ X212 @ X222) = (fun @ Y21 @ Y22)) = (((X212 = Y21)) & ((X222 = Y22))))))). % type.inject(2)
thf(fact_22_dB_Oinject_I2_J, axiom,
    ((![X212 : dB, X222 : dB, Y21 : dB, Y22 : dB]: (((app @ X212 @ X222) = (app @ Y21 @ Y22)) = (((X212 = Y21)) & ((X222 = Y22))))))). % dB.inject(2)
thf(fact_23_dB_Oinject_I1_J, axiom,
    ((![X12 : nat, Y1 : nat]: (((var @ X12) = (var @ Y1)) = (X12 = Y1))))). % dB.inject(1)
thf(fact_24_dB_Oinject_I3_J, axiom,
    ((![X32 : dB, Y3 : dB]: (((abs @ X32) = (abs @ Y3)) = (X32 = Y3))))). % dB.inject(3)
thf(fact_25_shift__eq, axiom,
    ((![I : nat, J : nat, E : nat > type, T2 : type]: ((I = J) => ((shift_type @ E @ I @ T2 @ J) = T2))))). % shift_eq
thf(fact_26_lift__type, axiom,
    ((![E : nat > type, T : dB, T2 : type, I : nat, U2 : type]: ((typing @ E @ T @ T2) => (typing @ (shift_type @ E @ I @ U2) @ (lift @ T @ I) @ T2))))). % lift_type
thf(fact_27_subst__lemma, axiom,
    ((![E : nat > type, T : dB, T2 : type, E2 : nat > type, U : dB, U2 : type, I : nat]: ((typing @ E @ T @ T2) => ((typing @ E2 @ U @ U2) => ((E = (shift_type @ E2 @ I @ U2)) => (typing @ E2 @ (subst @ T @ U @ I) @ T2))))))). % subst_lemma
thf(fact_28_abs__typeE, axiom,
    ((![E : nat > type, T : dB, T2 : type]: ((typing @ E @ (abs @ T) @ T2) => (~ ((![U3 : type, V : type]: (~ ((typing @ (shift_type @ E @ zero_zero_nat @ U3) @ T @ V)))))))))). % abs_typeE
thf(fact_29_Abs, axiom,
    ((![Env : nat > type, T2 : type, T : dB, U2 : type]: ((typing @ (shift_type @ Env @ zero_zero_nat @ T2) @ T @ U2) => (typing @ Env @ (abs @ T) @ (fun @ T2 @ U2)))))). % Abs
thf(fact_30_typing__elims_I3_J, axiom,
    ((![E : nat > type, T : dB, T2 : type]: ((typing @ E @ (abs @ T) @ T2) => (~ ((![T3 : type, U3 : type]: ((T2 = (fun @ T3 @ U3)) => (~ ((typing @ (shift_type @ E @ zero_zero_nat @ T3) @ T @ U3))))))))))). % typing_elims(3)
thf(fact_31_type__induct, axiom,
    ((![P : type > $o, T2 : type]: ((![T3 : type]: ((![T1 : type, T22 : type]: ((T3 = (fun @ T1 @ T22)) => (P @ T1))) => ((![T1 : type, T22 : type]: ((T3 = (fun @ T1 @ T22)) => (P @ T22))) => (P @ T3)))) => (P @ T2))))). % type_induct
thf(fact_32_subst__type__IT, axiom,
    ((![T : dB, E : nat > type, I : nat, U2 : type, T2 : type, U : dB]: ((it @ T) => ((typing @ (shift_type @ E @ I @ U2) @ T @ T2) => ((it @ U) => ((typing @ E @ U @ U2) => (it @ (subst @ T @ U @ I))))))))). % subst_type_IT
thf(fact_33_typing_Oinducts, axiom,
    ((![X12 : nat > type, X23 : dB, X32 : type, P : (nat > type) > dB > type > $o]: ((typing @ X12 @ X23 @ X32) => ((![Env2 : nat > type, X : nat, T3 : type]: (((Env2 @ X) = T3) => (P @ Env2 @ (var @ X) @ T3))) => ((![Env2 : nat > type, T3 : type, T4 : dB, U3 : type]: ((typing @ (shift_type @ Env2 @ zero_zero_nat @ T3) @ T4 @ U3) => ((P @ (shift_type @ Env2 @ zero_zero_nat @ T3) @ T4 @ U3) => (P @ Env2 @ (abs @ T4) @ (fun @ T3 @ U3))))) => ((![Env2 : nat > type, S2 : dB, T3 : type, U3 : type, T4 : dB]: ((typing @ Env2 @ S2 @ (fun @ T3 @ U3)) => ((P @ Env2 @ S2 @ (fun @ T3 @ U3)) => ((typing @ Env2 @ T4 @ T3) => ((P @ Env2 @ T4 @ T3) => (P @ Env2 @ (app @ S2 @ T4) @ U3)))))) => (P @ X12 @ X23 @ X32)))))))). % typing.inducts
thf(fact_34_typing_Osimps, axiom,
    ((typing = (^[A1 : nat > type]: (^[A2 : dB]: (^[A3 : type]: (((?[Env3 : nat > type]: (?[X4 : nat]: (?[T5 : type]: (((A1 = Env3)) & ((((A2 = (var @ X4))) & ((((A3 = T5)) & (((Env3 @ X4) = T5))))))))))) | ((((?[Env3 : nat > type]: (?[T5 : type]: (?[T6 : dB]: (?[U4 : type]: (((A1 = Env3)) & ((((A2 = (abs @ T6))) & ((((A3 = (fun @ T5 @ U4))) & ((typing @ (shift_type @ Env3 @ zero_zero_nat @ T5) @ T6 @ U4)))))))))))) | ((?[Env3 : nat > type]: (?[S3 : dB]: (?[T5 : type]: (?[U4 : type]: (?[T6 : dB]: (((A1 = Env3)) & ((((A2 = (app @ S3 @ T6))) & ((((A3 = U4)) & ((((typing @ Env3 @ S3 @ (fun @ T5 @ U4))) & ((typing @ Env3 @ T6 @ T5)))))))))))))))))))))))). % typing.simps
thf(fact_35_typing_Ocases, axiom,
    ((![A12 : nat > type, A22 : dB, A32 : type]: ((typing @ A12 @ A22 @ A32) => ((![X : nat]: ((A22 = (var @ X)) => (~ (((A12 @ X) = A32))))) => ((![T3 : type, T4 : dB]: ((A22 = (abs @ T4)) => (![U3 : type]: ((A32 = (fun @ T3 @ U3)) => (~ ((typing @ (shift_type @ A12 @ zero_zero_nat @ T3) @ T4 @ U3))))))) => (~ ((![S2 : dB, T3 : type, U3 : type, T4 : dB]: ((A22 = (app @ S2 @ T4)) => ((A32 = U3) => ((typing @ A12 @ S2 @ (fun @ T3 @ U3)) => (~ ((typing @ A12 @ T4 @ T3))))))))))))))). % typing.cases
thf(fact_36_dB_Odistinct_I1_J, axiom,
    ((![X12 : nat, X212 : dB, X222 : dB]: (~ (((var @ X12) = (app @ X212 @ X222))))))). % dB.distinct(1)
thf(fact_37_dB_Odistinct_I5_J, axiom,
    ((![X212 : dB, X222 : dB, X32 : dB]: (~ (((app @ X212 @ X222) = (abs @ X32))))))). % dB.distinct(5)
thf(fact_38_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_39_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_40_dB_Odistinct_I3_J, axiom,
    ((![X12 : nat, X32 : dB]: (~ (((var @ X12) = (abs @ X32))))))). % dB.distinct(3)
thf(fact_41_typing_OVar, axiom,
    ((![Env : nat > type, X5 : nat, T2 : type]: (((Env @ X5) = T2) => (typing @ Env @ (var @ X5) @ T2))))). % typing.Var
thf(fact_42_typing__elims_I1_J, axiom,
    ((![E : nat > type, I : nat, T2 : type]: ((typing @ E @ (var @ I) @ T2) => ((E @ I) = T2))))). % typing_elims(1)
thf(fact_43_dB_Osize__gen_I1_J, axiom,
    ((![X12 : nat]: ((size_dB @ (var @ X12)) = zero_zero_nat)))). % dB.size_gen(1)
thf(fact_44_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_45_substn__subst__0, axiom,
    ((![T : dB, S : dB]: ((substn @ T @ S @ zero_zero_nat) = (subst @ T @ S @ zero_zero_nat))))). % substn_subst_0
thf(fact_46_beta_Oinducts, axiom,
    ((![X12 : dB, X23 : dB, P : dB > dB > $o]: ((beta @ X12 @ X23) => ((![S2 : dB, T4 : dB]: (P @ (app @ (abs @ S2) @ T4) @ (subst @ S2 @ T4 @ zero_zero_nat))) => ((![S2 : dB, T4 : dB, U5 : dB]: ((beta @ S2 @ T4) => ((P @ S2 @ T4) => (P @ (app @ S2 @ U5) @ (app @ T4 @ U5))))) => ((![S2 : dB, T4 : dB, U5 : dB]: ((beta @ S2 @ T4) => ((P @ S2 @ T4) => (P @ (app @ U5 @ S2) @ (app @ U5 @ T4))))) => ((![S2 : dB, T4 : dB]: ((beta @ S2 @ T4) => ((P @ S2 @ T4) => (P @ (abs @ S2) @ (abs @ T4))))) => (P @ X12 @ X23))))))))). % beta.inducts
thf(fact_47_beta_Osimps, axiom,
    ((beta = (^[A1 : dB]: (^[A2 : dB]: (((?[S3 : dB]: (?[T6 : dB]: (((A1 = (app @ (abs @ S3) @ T6))) & ((A2 = (subst @ S3 @ T6 @ zero_zero_nat))))))) | ((((?[S3 : dB]: (?[T6 : dB]: (?[U6 : dB]: (((A1 = (app @ S3 @ U6))) & ((((A2 = (app @ T6 @ U6))) & ((beta @ S3 @ T6))))))))) | ((((?[S3 : dB]: (?[T6 : dB]: (?[U6 : dB]: (((A1 = (app @ U6 @ S3))) & ((((A2 = (app @ U6 @ T6))) & ((beta @ S3 @ T6))))))))) | ((?[S3 : dB]: (?[T6 : dB]: (((A1 = (abs @ S3))) & ((((A2 = (abs @ T6))) & ((beta @ S3 @ T6)))))))))))))))))). % beta.simps
thf(fact_48_beta_Ocases, axiom,
    ((![A12 : dB, A22 : dB]: ((beta @ A12 @ A22) => ((![S2 : dB, T4 : dB]: ((A12 = (app @ (abs @ S2) @ T4)) => (~ ((A22 = (subst @ S2 @ T4 @ zero_zero_nat)))))) => ((![S2 : dB, T4 : dB, U5 : dB]: ((A12 = (app @ S2 @ U5)) => ((A22 = (app @ T4 @ U5)) => (~ ((beta @ S2 @ T4)))))) => ((![S2 : dB, T4 : dB, U5 : dB]: ((A12 = (app @ U5 @ S2)) => ((A22 = (app @ U5 @ T4)) => (~ ((beta @ S2 @ T4)))))) => (~ ((![S2 : dB]: ((A12 = (abs @ S2)) => (![T4 : dB]: ((A22 = (abs @ T4)) => (~ ((beta @ S2 @ T4)))))))))))))))). % beta.cases
thf(fact_49_beta, axiom,
    ((![S : dB, T : dB]: (beta @ (app @ (abs @ S) @ T) @ (subst @ S @ T @ zero_zero_nat))))). % beta
thf(fact_50_beta__cases_I3_J, axiom,
    ((![S : dB, T : dB, U : dB]: ((beta @ (app @ S @ T) @ U) => ((![S2 : dB]: ((S = (abs @ S2)) => (~ ((U = (subst @ S2 @ T @ zero_zero_nat)))))) => ((![T4 : dB]: ((U = (app @ T4 @ T)) => (~ ((beta @ S @ T4))))) => (~ ((![T4 : dB]: ((U = (app @ S @ T4)) => (~ ((beta @ T @ T4))))))))))))). % beta_cases(3)
thf(fact_51_appL, axiom,
    ((![S : dB, T : dB, U : dB]: ((beta @ S @ T) => (beta @ (app @ S @ U) @ (app @ T @ U)))))). % appL
thf(fact_52_appR, axiom,
    ((![S : dB, T : dB, U : dB]: ((beta @ S @ T) => (beta @ (app @ U @ S) @ (app @ U @ T)))))). % appR
thf(fact_53_beta__cases_I1_J, axiom,
    ((![I : nat, T : dB]: (~ ((beta @ (var @ I) @ T)))))). % beta_cases(1)
thf(fact_54_beta__cases_I2_J, axiom,
    ((![R : dB, S : dB]: ((beta @ (abs @ R) @ S) => (~ ((![T4 : dB]: ((S = (abs @ T4)) => (~ ((beta @ R @ T4))))))))))). % beta_cases(2)
thf(fact_55_abs, axiom,
    ((![S : dB, T : dB]: ((beta @ S @ T) => (beta @ (abs @ S) @ (abs @ T)))))). % abs
thf(fact_56_subject__reduction, axiom,
    ((![E : nat > type, T : dB, T2 : type, T7 : dB]: ((typing @ E @ T @ T2) => ((beta @ T @ T7) => (typing @ E @ T7 @ T2)))))). % subject_reduction
thf(fact_57_subst__preserves__beta, axiom,
    ((![R : dB, S : dB, T : dB, I : nat]: ((beta @ R @ S) => (beta @ (subst @ R @ T @ I) @ (subst @ S @ T @ I)))))). % subst_preserves_beta
thf(fact_58_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_59_substn_Osimps_I2_J, axiom,
    ((![T : dB, U : dB, S : dB, K : nat]: ((substn @ (app @ T @ U) @ S @ K) = (app @ (substn @ T @ S @ K) @ (substn @ U @ S @ K)))))). % substn.simps(2)
thf(fact_60_var__app__type__eq, axiom,
    ((![E : nat > type, I : nat, Ts : list_dB, T2 : type, U2 : type]: ((typing @ E @ (foldl_dB_dB @ app @ (var @ I) @ Ts) @ T2) => ((typing @ E @ (foldl_dB_dB @ app @ (var @ I) @ Ts) @ U2) => (T2 = U2)))))). % var_app_type_eq
thf(fact_61_zero__reorient, axiom,
    ((![X5 : nat]: ((zero_zero_nat = X5) = (X5 = zero_zero_nat))))). % zero_reorient
thf(fact_62_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_63_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_64_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_65_ex__head__tail, axiom,
    ((![T : dB]: (?[Ts2 : list_dB, H : dB]: ((T = (foldl_dB_dB @ app @ H @ Ts2)) & ((?[N2 : nat]: (H = (var @ N2))) | (?[U5 : dB]: (H = (abs @ U5))))))))). % ex_head_tail
thf(fact_66_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_67_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_68_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_69_substn__subst__n, axiom,
    ((substn = (^[T6 : dB]: (^[S3 : dB]: (^[N3 : nat]: (subst @ T6 @ (liftn @ N3 @ S3 @ zero_zero_nat) @ N3))))))). % substn_subst_n
thf(fact_70_IT_Osimps, axiom,
    ((it = (^[A : dB]: (((?[Rs2 : list_dB]: (?[N3 : nat]: (((A = (foldl_dB_dB @ app @ (var @ N3) @ Rs2))) & ((listsp_dB @ it @ Rs2)))))) | ((((?[R2 : dB]: (((A = (abs @ R2))) & ((it @ R2))))) | ((?[R2 : dB]: (?[S3 : dB]: (?[Ss2 : list_dB]: (((A = (foldl_dB_dB @ app @ (app @ (abs @ R2) @ S3) @ Ss2))) & ((((it @ (foldl_dB_dB @ app @ (subst @ R2 @ S3 @ zero_zero_nat) @ Ss2))) & ((it @ S3)))))))))))))))). % IT.simps
thf(fact_71_IT_Ocases, axiom,
    ((![A4 : dB]: ((it @ A4) => ((![Rs3 : list_dB]: ((?[N2 : nat]: (A4 = (foldl_dB_dB @ app @ (var @ N2) @ Rs3))) => (~ ((listsp_dB @ it @ Rs3))))) => ((![R3 : dB]: ((A4 = (abs @ R3)) => (~ ((it @ R3))))) => (~ ((![R3 : dB, S2 : dB, Ss3 : list_dB]: ((A4 = (foldl_dB_dB @ app @ (app @ (abs @ R3) @ S2) @ Ss3)) => ((it @ (foldl_dB_dB @ app @ (subst @ R3 @ S2 @ zero_zero_nat) @ Ss3)) => (~ ((it @ S2)))))))))))))). % IT.cases
thf(fact_72_liftn__0, axiom,
    ((![T : dB, K : nat]: ((liftn @ zero_zero_nat @ T @ K) = T)))). % liftn_0
thf(fact_73_liftn_Osimps_I2_J, axiom,
    ((![N : nat, S : dB, T : dB, K : nat]: ((liftn @ N @ (app @ S @ T) @ K) = (app @ (liftn @ N @ S @ K) @ (liftn @ N @ T @ K)))))). % liftn.simps(2)
thf(fact_74_IT_OVar, axiom,
    ((![Rs : list_dB, N : nat]: ((listsp_dB @ it @ Rs) => (it @ (foldl_dB_dB @ app @ (var @ N) @ Rs)))))). % IT.Var
thf(fact_75__092_060open_062IT_A_IVar_A0_A_092_060degree_062_092_060degree_062_A_091lift_At_A0_093_J_092_060close_062, axiom,
    ((it @ (foldl_dB_dB @ app @ (var @ zero_zero_nat) @ (cons_dB @ (lift @ ta2 @ zero_zero_nat) @ nil_dB))))). % \<open>IT (Var 0 \<degree>\<degree> [lift t 0])\<close>
thf(fact_76_head__Var__reduction, axiom,
    ((![N : nat, Rs : list_dB, V2 : dB]: ((beta @ (foldl_dB_dB @ app @ (var @ N) @ Rs) @ V2) => (?[Ss3 : list_dB]: ((step1_dB @ beta @ Rs @ Ss3) & (V2 = (foldl_dB_dB @ app @ (var @ N) @ Ss3)))))))). % head_Var_reduction
thf(fact_77__092_060open_062Var_A0_A_092_060degree_062_092_060degree_062_A_091lift_At_A0_093_A_061_AVar_A0_A_092_060degree_062_Alift_At_A0_092_060close_062, axiom,
    (((foldl_dB_dB @ app @ (var @ zero_zero_nat) @ (cons_dB @ (lift @ ta2 @ zero_zero_nat) @ nil_dB)) = (app @ (var @ zero_zero_nat) @ (lift @ ta2 @ zero_zero_nat))))). % \<open>Var 0 \<degree>\<degree> [lift t 0] = Var 0 \<degree> lift t 0\<close>
thf(fact_78__092_060open_062listsp_AIT_A_091lift_At_A0_093_092_060close_062, axiom,
    ((listsp_dB @ it @ (cons_dB @ (lift @ ta2 @ zero_zero_nat) @ nil_dB)))). % \<open>listsp IT [lift t 0]\<close>
thf(fact_79_Var__eq__apps__conv, axiom,
    ((![M : nat, S : dB, Ss : list_dB]: (((var @ M) = (foldl_dB_dB @ app @ S @ Ss)) = ((((var @ M) = S)) & ((Ss = nil_dB))))))). % Var_eq_apps_conv
thf(fact_80_apps__eq__Abs__conv, axiom,
    ((![S : dB, Ss : list_dB, R : dB]: (((foldl_dB_dB @ app @ S @ Ss) = (abs @ R)) = (((S = (abs @ R))) & ((Ss = nil_dB))))))). % apps_eq_Abs_conv
thf(fact_81_Abs__eq__apps__conv, axiom,
    ((![R : dB, S : dB, Ss : list_dB]: (((abs @ R) = (foldl_dB_dB @ app @ S @ Ss)) = ((((abs @ R) = S)) & ((Ss = nil_dB))))))). % Abs_eq_apps_conv
thf(fact_82_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)))))) => (~ ((![T4 : dB]: ((R = (abs @ T4)) => (![U5 : dB, Us : list_dB]: ((Rs = (cons_dB @ U5 @ Us)) => (~ ((S = (foldl_dB_dB @ app @ (subst @ T4 @ U5 @ zero_zero_nat) @ Us)))))))))))))))). % apps_betasE
thf(fact_83_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_84_listsp__simps_I1_J, axiom,
    ((![A5 : dB > $o]: (listsp_dB @ A5 @ nil_dB)))). % listsp_simps(1)
thf(fact_85_listsp__simps_I1_J, axiom,
    ((![A5 : type > $o]: (listsp_type @ A5 @ nil_type)))). % listsp_simps(1)
thf(fact_86_listsp_Ocases, axiom,
    ((![A5 : dB > $o, A4 : list_dB]: ((listsp_dB @ A5 @ A4) => ((~ ((A4 = nil_dB))) => (~ ((![A6 : dB, L : list_dB]: ((A4 = (cons_dB @ A6 @ L)) => ((A5 @ A6) => (~ ((listsp_dB @ A5 @ L))))))))))))). % listsp.cases
thf(fact_87_listsp_Ocases, axiom,
    ((![A5 : type > $o, A4 : list_type]: ((listsp_type @ A5 @ A4) => ((~ ((A4 = nil_type))) => (~ ((![A6 : type, L : list_type]: ((A4 = (cons_type @ A6 @ L)) => ((A5 @ A6) => (~ ((listsp_type @ A5 @ L))))))))))))). % listsp.cases
thf(fact_88_listsp_Osimps, axiom,
    ((listsp_dB = (^[A7 : dB > $o]: (^[A : list_dB]: (((A = nil_dB)) | ((?[B : dB]: (?[L2 : list_dB]: (((A = (cons_dB @ B @ L2))) & ((((A7 @ B)) & ((listsp_dB @ A7 @ L2)))))))))))))). % listsp.simps
thf(fact_89_listsp_Osimps, axiom,
    ((listsp_type = (^[A7 : type > $o]: (^[A : list_type]: (((A = nil_type)) | ((?[B : type]: (?[L2 : list_type]: (((A = (cons_type @ B @ L2))) & ((((A7 @ B)) & ((listsp_type @ A7 @ L2)))))))))))))). % listsp.simps
thf(fact_90_listsp_Oinducts, axiom,
    ((![A5 : dB > $o, X5 : list_dB, P : list_dB > $o]: ((listsp_dB @ A5 @ X5) => ((P @ nil_dB) => ((![A6 : dB, L : list_dB]: ((A5 @ A6) => ((listsp_dB @ A5 @ L) => ((P @ L) => (P @ (cons_dB @ A6 @ L)))))) => (P @ X5))))))). % listsp.inducts
thf(fact_91_listsp_Oinducts, axiom,
    ((![A5 : type > $o, X5 : list_type, P : list_type > $o]: ((listsp_type @ A5 @ X5) => ((P @ nil_type) => ((![A6 : type, L : list_type]: ((A5 @ A6) => ((listsp_type @ A5 @ L) => ((P @ L) => (P @ (cons_type @ A6 @ L)))))) => (P @ X5))))))). % listsp.inducts
thf(fact_92_foldl__Cons, axiom,
    ((![F : dB > dB > dB, A4 : dB, X5 : dB, Xs : list_dB]: ((foldl_dB_dB @ F @ A4 @ (cons_dB @ X5 @ Xs)) = (foldl_dB_dB @ F @ (F @ A4 @ X5) @ Xs))))). % foldl_Cons
thf(fact_93_foldl__Nil, axiom,
    ((![F : dB > dB > dB, A4 : dB]: ((foldl_dB_dB @ F @ A4 @ nil_dB) = A4)))). % foldl_Nil
thf(fact_94_listsp_OCons, axiom,
    ((![A5 : dB > $o, A4 : dB, L3 : list_dB]: ((A5 @ A4) => ((listsp_dB @ A5 @ L3) => (listsp_dB @ A5 @ (cons_dB @ A4 @ L3))))))). % listsp.Cons
thf(fact_95_listsp_OCons, axiom,
    ((![A5 : type > $o, A4 : type, L3 : list_type]: ((A5 @ A4) => ((listsp_type @ A5 @ L3) => (listsp_type @ A5 @ (cons_type @ A4 @ L3))))))). % listsp.Cons
thf(fact_96_listspE, axiom,
    ((![A5 : dB > $o, X5 : dB, L3 : list_dB]: ((listsp_dB @ A5 @ (cons_dB @ X5 @ L3)) => (~ (((A5 @ X5) => (~ ((listsp_dB @ A5 @ L3)))))))))). % listspE
thf(fact_97_listspE, axiom,
    ((![A5 : type > $o, X5 : type, L3 : list_type]: ((listsp_type @ A5 @ (cons_type @ X5 @ L3)) => (~ (((A5 @ X5) => (~ ((listsp_type @ A5 @ L3)))))))))). % listspE
thf(fact_98_listsp__simps_I2_J, axiom,
    ((![A5 : dB > $o, X5 : dB, Xs : list_dB]: ((listsp_dB @ A5 @ (cons_dB @ X5 @ Xs)) = (((A5 @ X5)) & ((listsp_dB @ A5 @ Xs))))))). % listsp_simps(2)
thf(fact_99_listsp__simps_I2_J, axiom,
    ((![A5 : type > $o, X5 : type, Xs : list_type]: ((listsp_type @ A5 @ (cons_type @ X5 @ Xs)) = (((A5 @ X5)) & ((listsp_type @ A5 @ Xs))))))). % listsp_simps(2)
thf(fact_100_listsp_ONil, axiom,
    ((![A5 : dB > $o]: (listsp_dB @ A5 @ nil_dB)))). % listsp.Nil
thf(fact_101_listsp_ONil, axiom,
    ((![A5 : type > $o]: (listsp_type @ A5 @ nil_type)))). % listsp.Nil
thf(fact_102_n__lists__Nil, axiom,
    ((![N : nat]: (((N = zero_zero_nat) => ((n_lists_dB @ N @ nil_dB) = (cons_list_dB @ nil_dB @ nil_list_dB))) & ((~ ((N = zero_zero_nat))) => ((n_lists_dB @ N @ nil_dB) = nil_list_dB)))))). % n_lists_Nil
thf(fact_103_n__lists__Nil, axiom,
    ((![N : nat]: (((N = zero_zero_nat) => ((n_lists_type @ N @ nil_type) = (cons_list_type @ nil_type @ nil_list_type))) & ((~ ((N = zero_zero_nat))) => ((n_lists_type @ N @ nil_type) = nil_list_type)))))). % n_lists_Nil
thf(fact_104_App__eq__foldl__conv, axiom,
    ((![R : dB, S : dB, T : dB, Ts : list_dB]: (((app @ R @ S) = (foldl_dB_dB @ app @ T @ Ts)) = (((((Ts = nil_dB)) => (((app @ R @ S) = T)))) & ((((~ ((Ts = nil_dB)))) => ((?[Ss2 : list_dB]: (((Ts = (append_dB @ Ss2 @ (cons_dB @ S @ nil_dB)))) & ((R = (foldl_dB_dB @ app @ T @ Ss2))))))))))))). % App_eq_foldl_conv
thf(fact_105_app__last, axiom,
    ((![T : dB, Ts : list_dB, U : dB]: ((app @ (foldl_dB_dB @ app @ T @ Ts) @ U) = (foldl_dB_dB @ app @ T @ (append_dB @ Ts @ (cons_dB @ U @ nil_dB))))))). % app_last
thf(fact_106_foldl__append, axiom,
    ((![F : dB > dB > dB, A4 : dB, Xs : list_dB, Ys : list_dB]: ((foldl_dB_dB @ F @ A4 @ (append_dB @ Xs @ Ys)) = (foldl_dB_dB @ F @ (foldl_dB_dB @ F @ A4 @ Xs) @ Ys))))). % foldl_append
thf(fact_107_append__in__listsp__conv, axiom,
    ((![A5 : type > $o, Xs : list_type, Ys : list_type]: ((listsp_type @ A5 @ (append_type @ Xs @ Ys)) = (((listsp_type @ A5 @ Xs)) & ((listsp_type @ A5 @ Ys))))))). % append_in_listsp_conv
thf(fact_108_append__in__listsp__conv, axiom,
    ((![A5 : dB > $o, Xs : list_dB, Ys : list_dB]: ((listsp_dB @ A5 @ (append_dB @ Xs @ Ys)) = (((listsp_dB @ A5 @ Xs)) & ((listsp_dB @ A5 @ Ys))))))). % append_in_listsp_conv
thf(fact_109_rev__exhaust2, axiom,
    ((![Xs : list_dB]: ((~ ((Xs = nil_dB))) => (~ ((![Ys2 : list_dB, Y2 : dB]: (~ ((Xs = (append_dB @ Ys2 @ (cons_dB @ Y2 @ nil_dB)))))))))))). % rev_exhaust2
thf(fact_110_rev__exhaust2, axiom,
    ((![Xs : list_type]: ((~ ((Xs = nil_type))) => (~ ((![Ys2 : list_type, Y2 : type]: (~ ((Xs = (append_type @ Ys2 @ (cons_type @ Y2 @ nil_type)))))))))))). % rev_exhaust2
thf(fact_111_n__lists_Osimps_I1_J, axiom,
    ((![Xs : list_dB]: ((n_lists_dB @ zero_zero_nat @ Xs) = (cons_list_dB @ nil_dB @ nil_list_dB))))). % n_lists.simps(1)
thf(fact_112_n__lists_Osimps_I1_J, axiom,
    ((![Xs : list_type]: ((n_lists_type @ zero_zero_nat @ Xs) = (cons_list_type @ nil_type @ nil_list_type))))). % n_lists.simps(1)
thf(fact_113_nths__singleton, axiom,
    ((![A5 : set_nat, X5 : dB]: (((member_nat @ zero_zero_nat @ A5) => ((nths_dB @ (cons_dB @ X5 @ nil_dB) @ A5) = (cons_dB @ X5 @ nil_dB))) & ((~ ((member_nat @ zero_zero_nat @ A5))) => ((nths_dB @ (cons_dB @ X5 @ nil_dB) @ A5) = nil_dB)))))). % nths_singleton
thf(fact_114_nths__singleton, axiom,
    ((![A5 : set_nat, X5 : type]: (((member_nat @ zero_zero_nat @ A5) => ((nths_type @ (cons_type @ X5 @ nil_type) @ A5) = (cons_type @ X5 @ nil_type))) & ((~ ((member_nat @ zero_zero_nat @ A5))) => ((nths_type @ (cons_type @ X5 @ nil_type) @ A5) = nil_type)))))). % nths_singleton
thf(fact_115_Apps__dB__induct, axiom,
    ((![P : dB > $o, T : dB]: ((![N2 : nat, Ts2 : list_dB]: ((![X6 : dB]: ((member_dB @ X6 @ (set_dB2 @ Ts2)) => (P @ X6))) => (P @ (foldl_dB_dB @ app @ (var @ N2) @ Ts2)))) => ((![U5 : dB]: ((P @ U5) => (![Ts2 : list_dB]: ((![X6 : dB]: ((member_dB @ X6 @ (set_dB2 @ Ts2)) => (P @ X6))) => (P @ (foldl_dB_dB @ app @ (abs @ U5) @ Ts2)))))) => (P @ T)))))). % Apps_dB_induct
thf(fact_116_IT_Oinducts, axiom,
    ((![X5 : dB, P : dB > $o]: ((it @ X5) => ((![Rs3 : list_dB, N2 : nat]: ((listsp_dB @ (^[X4 : dB]: (((it @ X4)) & ((P @ X4)))) @ Rs3) => (P @ (foldl_dB_dB @ app @ (var @ N2) @ Rs3)))) => ((![R3 : dB]: ((it @ R3) => ((P @ R3) => (P @ (abs @ R3))))) => ((![R3 : dB, S2 : dB, Ss3 : list_dB]: ((it @ (foldl_dB_dB @ app @ (subst @ R3 @ S2 @ zero_zero_nat) @ Ss3)) => ((P @ (foldl_dB_dB @ app @ (subst @ R3 @ S2 @ zero_zero_nat) @ Ss3)) => ((it @ S2) => ((P @ S2) => (P @ (foldl_dB_dB @ app @ (app @ (abs @ R3) @ S2) @ Ss3))))))) => (P @ X5)))))))). % IT.inducts
thf(fact_117_listsp__conj__eq, axiom,
    ((![A5 : dB > $o, B2 : dB > $o]: ((listsp_dB @ (^[X4 : dB]: (((A5 @ X4)) & ((B2 @ X4))))) = (^[X4 : list_dB]: (((listsp_dB @ A5 @ X4)) & ((listsp_dB @ B2 @ X4)))))))). % listsp_conj_eq
thf(fact_118_in__listspI, axiom,
    ((![Xs : list_dB, A5 : dB > $o]: ((![X : dB]: ((member_dB @ X @ (set_dB2 @ Xs)) => (A5 @ X))) => (listsp_dB @ A5 @ Xs))))). % in_listspI
thf(fact_119_foldl__cong, axiom,
    ((![A4 : dB, B3 : dB, L3 : list_dB, K : list_dB, F : dB > dB > dB, G : dB > dB > dB]: ((A4 = B3) => ((L3 = K) => ((![A6 : dB, X : dB]: ((member_dB @ X @ (set_dB2 @ L3)) => ((F @ A6 @ X) = (G @ A6 @ X)))) => ((foldl_dB_dB @ F @ A4 @ L3) = (foldl_dB_dB @ G @ B3 @ K)))))))). % foldl_cong
thf(fact_120_in__listspD, axiom,
    ((![A5 : dB > $o, Xs : list_dB]: ((listsp_dB @ A5 @ Xs) => (![X6 : dB]: ((member_dB @ X6 @ (set_dB2 @ Xs)) => (A5 @ X6))))))). % in_listspD
thf(fact_121_in__listsp__conv__set, axiom,
    ((listsp_dB = (^[A7 : dB > $o]: (^[Xs2 : list_dB]: (![X4 : dB]: (((member_dB @ X4 @ (set_dB2 @ Xs2))) => ((A7 @ X4))))))))). % in_listsp_conv_set
thf(fact_122_lem, axiom,
    ((![P : dB > $o, T : dB, N : nat]: ((![N2 : nat, Ts2 : list_dB]: ((![X6 : dB]: ((member_dB @ X6 @ (set_dB2 @ Ts2)) => (P @ X6))) => (P @ (foldl_dB_dB @ app @ (var @ N2) @ Ts2)))) => ((![U5 : dB]: ((P @ U5) => (![Ts2 : list_dB]: ((![X6 : dB]: ((member_dB @ X6 @ (set_dB2 @ Ts2)) => (P @ X6))) => (P @ (foldl_dB_dB @ app @ (abs @ U5) @ Ts2)))))) => (((size_size_dB @ T) = N) => (P @ T))))))). % lem
thf(fact_123_types__snoc, axiom,
    ((![E : nat > type, Ts : list_dB, Ts3 : list_type, T : dB, T2 : type]: ((typings @ E @ Ts @ Ts3) => ((typing @ E @ T @ T2) => (typings @ E @ (append_dB @ Ts @ (cons_dB @ T @ nil_dB)) @ (append_type @ Ts3 @ (cons_type @ T2 @ nil_type)))))))). % types_snoc
thf(fact_124_types__snocE, axiom,
    ((![E : nat > type, Ts : list_dB, T : dB, Ts3 : list_type]: ((typings @ E @ (append_dB @ Ts @ (cons_dB @ T @ nil_dB)) @ Ts3) => (~ ((![Us2 : list_type, U3 : type]: ((Ts3 = (append_type @ Us2 @ (cons_type @ U3 @ nil_type))) => ((typings @ E @ Ts @ Us2) => (~ ((typing @ E @ T @ U3)))))))))))). % types_snocE
thf(fact_125_typings_Osimps_I1_J, axiom,
    ((![E : nat > type, Ts3 : list_type]: ((typings @ E @ nil_dB @ Ts3) = (Ts3 = nil_type))))). % typings.simps(1)
thf(fact_126_dB_Osize_I4_J, axiom,
    ((![X12 : nat]: ((size_size_dB @ (var @ X12)) = zero_zero_nat)))). % dB.size(4)
thf(fact_127_types__snoc__eq, axiom,
    ((![E : nat > type, Ts : list_dB, T : dB, Ts3 : list_type, T2 : type]: ((typings @ E @ (append_dB @ Ts @ (cons_dB @ T @ nil_dB)) @ (append_type @ Ts3 @ (cons_type @ T2 @ nil_type))) = (((typings @ E @ Ts @ Ts3)) & ((typing @ E @ T @ T2))))))). % types_snoc_eq
thf(fact_128_var__app__typesE, axiom,
    ((![E : nat > type, I : nat, Ts : list_dB, T2 : type]: ((typing @ E @ (foldl_dB_dB @ app @ (var @ I) @ Ts) @ T2) => (~ ((![Ts4 : list_type]: ((typing @ E @ (var @ I) @ (foldr_type_type @ fun @ Ts4 @ T2)) => (~ ((typings @ E @ Ts @ Ts4))))))))))). % var_app_typesE
thf(fact_129_var__app__types, axiom,
    ((![E : nat > type, I : nat, Ts : list_dB, Us3 : list_dB, T2 : type, Ts3 : list_type, U2 : type]: ((typing @ E @ (foldl_dB_dB @ app @ (foldl_dB_dB @ app @ (var @ I) @ Ts) @ Us3) @ T2) => ((typings @ E @ Ts @ Ts3) => ((typing @ E @ (foldl_dB_dB @ app @ (var @ I) @ Ts) @ U2) => (?[Us2 : list_type]: ((U2 = (foldr_type_type @ fun @ Us2 @ T2)) & (typings @ E @ Us3 @ Us2))))))))). % var_app_types
thf(fact_130_list__app__typeD, axiom,
    ((![E : nat > type, T : dB, Ts : list_dB, T2 : type]: ((typing @ E @ (foldl_dB_dB @ app @ T @ Ts) @ T2) => (?[Ts4 : list_type]: ((typing @ E @ T @ (foldr_type_type @ fun @ Ts4 @ T2)) & (typings @ E @ Ts @ Ts4))))))). % list_app_typeD
thf(fact_131_list__app__typeE, axiom,
    ((![E : nat > type, T : dB, Ts : list_dB, T2 : type]: ((typing @ E @ (foldl_dB_dB @ app @ T @ Ts) @ T2) => (~ ((![Ts4 : list_type]: ((typing @ E @ T @ (foldr_type_type @ fun @ Ts4 @ T2)) => (~ ((typings @ E @ Ts @ Ts4))))))))))). % list_app_typeE
thf(fact_132_list__app__typeI, axiom,
    ((![E : nat > type, T : dB, Ts3 : list_type, T2 : type, Ts : list_dB]: ((typing @ E @ T @ (foldr_type_type @ fun @ Ts3 @ T2)) => ((typings @ E @ Ts @ Ts3) => (typing @ E @ (foldl_dB_dB @ app @ T @ Ts) @ T2)))))). % list_app_typeI
thf(fact_133_typings_Osimps_I2_J, axiom,
    ((![E : nat > type, T : dB, Ts : list_dB, Ts3 : list_type]: ((typings @ E @ (cons_dB @ T @ Ts) @ Ts3) = (case_list_o_type @ $false @ (^[T5 : type]: (^[Ts5 : list_type]: (((typing @ E @ T @ T5)) & ((typings @ E @ Ts @ Ts5))))) @ Ts3))))). % typings.simps(2)
thf(fact_134_count__notin, axiom,
    ((![X5 : dB, Xs : list_dB]: ((~ ((member_dB @ X5 @ (set_dB2 @ Xs)))) => ((count_list_dB @ Xs @ X5) = zero_zero_nat))))). % count_notin
thf(fact_135_count__list_Osimps_I1_J, axiom,
    ((![Y : dB]: ((count_list_dB @ nil_dB @ Y) = zero_zero_nat)))). % count_list.simps(1)
thf(fact_136_count__list_Osimps_I1_J, axiom,
    ((![Y : type]: ((count_list_type @ nil_type @ Y) = zero_zero_nat)))). % count_list.simps(1)
thf(fact_137_nths__Cons, axiom,
    ((![X5 : dB, L3 : list_dB, A5 : set_nat]: ((nths_dB @ (cons_dB @ X5 @ L3) @ A5) = (append_dB @ (if_list_dB @ (member_nat @ zero_zero_nat @ A5) @ (cons_dB @ X5 @ nil_dB) @ nil_dB) @ (nths_dB @ L3 @ (collect_nat @ (^[J2 : nat]: (member_nat @ (suc @ J2) @ A5))))))))). % nths_Cons
thf(fact_138_nths__Cons, axiom,
    ((![X5 : type, L3 : list_type, A5 : set_nat]: ((nths_type @ (cons_type @ X5 @ L3) @ A5) = (append_type @ (if_list_type @ (member_nat @ zero_zero_nat @ A5) @ (cons_type @ X5 @ nil_type) @ nil_type) @ (nths_type @ L3 @ (collect_nat @ (^[J2 : nat]: (member_nat @ (suc @ J2) @ A5))))))))). % nths_Cons
thf(fact_139_substs__lemma, axiom,
    ((![E : nat > type, U : dB, T2 : type, I : nat, Ts : list_dB, Ts3 : list_type]: ((typing @ E @ U @ T2) => ((typings @ (shift_type @ E @ I @ T2) @ Ts @ Ts3) => (typings @ E @ (map_dB_dB @ (^[T6 : dB]: (subst @ T6 @ U @ I)) @ Ts) @ Ts3)))))). % substs_lemma
thf(fact_140_shift__commute, axiom,
    ((![E : nat > type, I : nat, U2 : type, T2 : type]: ((shift_type @ (shift_type @ E @ I @ U2) @ zero_zero_nat @ T2) = (shift_type @ (shift_type @ E @ zero_zero_nat @ T2) @ (suc @ I) @ U2))))). % shift_commute
thf(fact_141_liftn__lift, axiom,
    ((![N : nat, T : dB, K : nat]: ((liftn @ (suc @ N) @ T @ K) = (lift @ (liftn @ N @ T @ K) @ K))))). % liftn_lift
thf(fact_142_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 @ (^[T6 : dB]: (subst @ T6 @ U @ I)) @ Ts)))))). % subst_map
thf(fact_143_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 @ (^[T6 : dB]: (lift @ T6 @ I)) @ Ts)))))). % lift_map
thf(fact_144_foldl__map, axiom,
    ((![G : dB > dB > dB, A4 : dB, F : dB > dB, Xs : list_dB]: ((foldl_dB_dB @ G @ A4 @ (map_dB_dB @ F @ Xs)) = (foldl_dB_dB @ (^[A : dB]: (^[X4 : dB]: (G @ A @ (F @ X4)))) @ A4 @ Xs))))). % foldl_map
thf(fact_145_lift__types, axiom,
    ((![E : nat > type, Ts : list_dB, Ts3 : list_type, I : nat, U2 : type]: ((typings @ E @ Ts @ Ts3) => (typings @ (shift_type @ E @ I @ U2) @ (map_dB_dB @ (^[T6 : dB]: (lift @ T6 @ I)) @ Ts) @ Ts3))))). % lift_types
thf(fact_146_lifts__IT, axiom,
    ((![Ts : list_dB]: ((listsp_dB @ it @ Ts) => (listsp_dB @ it @ (map_dB_dB @ (^[T6 : dB]: (lift @ T6 @ zero_zero_nat)) @ Ts)))))). % lifts_IT
thf(fact_147_nat_Odistinct_I1_J, axiom,
    ((![X23 : nat]: (~ ((zero_zero_nat = (suc @ X23))))))). % nat.distinct(1)
thf(fact_148_old_Onat_Odistinct_I2_J, axiom,
    ((![Nat : nat]: (~ (((suc @ Nat) = zero_zero_nat)))))). % old.nat.distinct(2)
thf(fact_149_not0__implies__Suc, axiom,
    ((![N : nat]: ((~ ((N = zero_zero_nat))) => (?[M2 : nat]: (N = (suc @ M2))))))). % not0_implies_Suc
thf(fact_150_old_Onat_Oinducts, axiom,
    ((![P : nat > $o, Nat2 : nat]: ((P @ zero_zero_nat) => ((![Nat3 : nat]: ((P @ Nat3) => (P @ (suc @ Nat3)))) => (P @ Nat2)))))). % old.nat.inducts
thf(fact_151_old_Onat_Oexhaust, axiom,
    ((![Y : nat]: ((~ ((Y = zero_zero_nat))) => (~ ((![Nat3 : nat]: (~ ((Y = (suc @ Nat3))))))))))). % old.nat.exhaust
thf(fact_152_Zero__not__Suc, axiom,
    ((![M : nat]: (~ ((zero_zero_nat = (suc @ M))))))). % Zero_not_Suc
thf(fact_153_Zero__neq__Suc, axiom,
    ((![M : nat]: (~ ((zero_zero_nat = (suc @ M))))))). % Zero_neq_Suc
thf(fact_154_Suc__neq__Zero, axiom,
    ((![M : nat]: (~ (((suc @ M) = zero_zero_nat)))))). % Suc_neq_Zero
thf(fact_155_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_156_diff__induct, axiom,
    ((![P : nat > nat > $o, M : nat, N : nat]: ((![X : nat]: (P @ X @ zero_zero_nat)) => ((![Y2 : nat]: (P @ zero_zero_nat @ (suc @ Y2))) => ((![X : nat, Y2 : nat]: ((P @ X @ Y2) => (P @ (suc @ X) @ (suc @ Y2)))) => (P @ M @ N))))))). % diff_induct
thf(fact_157_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_158_nat_OdiscI, axiom,
    ((![Nat2 : nat, X23 : nat]: ((Nat2 = (suc @ X23)) => (~ ((Nat2 = zero_zero_nat))))))). % nat.discI

% Helper facts (5)
thf(help_If_2_1_If_001t__List__Olist_It__Lambda__OdB_J_T, axiom,
    ((![X5 : list_dB, Y : list_dB]: ((if_list_dB @ $false @ X5 @ Y) = Y)))).
thf(help_If_1_1_If_001t__List__Olist_It__Lambda__OdB_J_T, axiom,
    ((![X5 : list_dB, Y : list_dB]: ((if_list_dB @ $true @ X5 @ Y) = X5)))).
thf(help_If_3_1_If_001t__List__Olist_It__LambdaType__Otype_J_T, axiom,
    ((![P : $o]: ((P = $true) | (P = $false))))).
thf(help_If_2_1_If_001t__List__Olist_It__LambdaType__Otype_J_T, axiom,
    ((![X5 : list_type, Y : list_type]: ((if_list_type @ $false @ X5 @ Y) = Y)))).
thf(help_If_1_1_If_001t__List__Olist_It__LambdaType__Otype_J_T, axiom,
    ((![X5 : list_type, Y : list_type]: ((if_list_type @ $true @ X5 @ Y) = X5)))).

% Conjectures (1)
thf(conj_0, conjecture,
    ((it @ s))).
