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

% 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 (50)
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_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_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_Osize__class_Osize_001t__Lambda__OdB, type,
    size_size_dB : dB > nat).
thf(sy_c_Nat_Osize__class_Osize_001t__List__Olist_It__LambdaType__Otype_J, type,
    size_size_list_type : list_type > nat).
thf(sy_c_Nat_Osize__class_Osize_001t__List__Olist_It__Lambda__OdB_J, type,
    size_size_list_dB : list_dB > nat).
thf(sy_c_Orderings_Oord__class_Oless_001t__Nat__Onat, type,
    ord_less_nat : nat > nat > $o).
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_env______, type,
    env : nat > type).
thf(sy_v_t, type,
    t2 : dB).
thf(sy_v_ta______, type,
    ta2 : dB).

% Relevant facts (150)
thf(fact_0_Abs_Ohyps_I2_J, axiom,
    ((it @ ta2))). % Abs.hyps(2)
thf(fact_1_dB_Oinject_I3_J, axiom,
    ((![X3 : dB, Y3 : dB]: (((abs @ X3) = (abs @ Y3)) = (X3 = Y3))))). % dB.inject(3)
thf(fact_2_Lambda, axiom,
    ((![R : dB]: ((it @ R) => (it @ (abs @ R)))))). % Lambda
thf(fact_3_lift__IT, axiom,
    ((![T : dB, I : nat]: ((it @ T) => (it @ (lift @ T @ I)))))). % lift_IT
thf(fact_4_Var__IT, axiom,
    ((![N : nat]: (it @ (var @ N))))). % Var_IT
thf(fact_5_Abs_Ohyps_I1_J, axiom,
    ((typing @ (shift_type @ env @ zero_zero_nat @ ta) @ ta2 @ u))). % Abs.hyps(1)
thf(fact_6_dB_Odistinct_I3_J, axiom,
    ((![X1 : nat, X3 : dB]: (~ (((var @ X1) = (abs @ X3))))))). % dB.distinct(3)
thf(fact_7_beta__cases_I2_J, axiom,
    ((![R : dB, S : dB]: ((beta @ (abs @ R) @ S) => (~ ((![T2 : dB]: ((S = (abs @ T2)) => (~ ((beta @ R @ T2))))))))))). % beta_cases(2)
thf(fact_8_abs, axiom,
    ((![S : dB, T : dB]: ((beta @ S @ T) => (beta @ (abs @ S) @ (abs @ T)))))). % abs
thf(fact_9_dB_Odistinct_I5_J, axiom,
    ((![X21 : dB, X22 : dB, X3 : dB]: (~ (((app @ X21 @ X22) = (abs @ X3))))))). % dB.distinct(5)
thf(fact_10_subst__Var__IT, axiom,
    ((![R : dB, I : nat, J : nat]: ((it @ R) => (it @ (subst @ R @ (var @ I) @ J)))))). % subst_Var_IT
thf(fact_11_assms, axiom,
    ((typing @ e @ t2 @ t))). % assms
thf(fact_12_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_13_dB_Oinject_I1_J, axiom,
    ((![X1 : nat, Y1 : nat]: (((var @ X1) = (var @ Y1)) = (X1 = Y1))))). % dB.inject(1)
thf(fact_14_subst__eq, axiom,
    ((![K : nat, U : dB]: ((subst @ (var @ K) @ U @ K) = U)))). % subst_eq
thf(fact_15_subst__lift, axiom,
    ((![T : dB, K : nat, S : dB]: ((subst @ (lift @ T @ K) @ S @ K) = T)))). % subst_lift
thf(fact_16_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)))))) => ((![T2 : dB]: ((U = (app @ T2 @ T)) => (~ ((beta @ S @ T2))))) => (~ ((![T2 : dB]: ((U = (app @ S @ T2)) => (~ ((beta @ T @ T2))))))))))))). % beta_cases(3)
thf(fact_17_beta__cases_I1_J, axiom,
    ((![I : nat, T : dB]: (~ ((beta @ (var @ I) @ T)))))). % beta_cases(1)
thf(fact_18_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_19_dB_Odistinct_I1_J, axiom,
    ((![X1 : nat, X21 : dB, X22 : dB]: (~ (((var @ X1) = (app @ X21 @ X22))))))). % dB.distinct(1)
thf(fact_20_appL, axiom,
    ((![S : dB, T : dB, U : dB]: ((beta @ S @ T) => (beta @ (app @ S @ U) @ (app @ T @ U)))))). % appL
thf(fact_21_appR, axiom,
    ((![S : dB, T : dB, U : dB]: ((beta @ S @ T) => (beta @ (app @ U @ S) @ (app @ U @ T)))))). % appR
thf(fact_22_beta, axiom,
    ((![S : dB, T : dB]: (beta @ (app @ (abs @ S) @ T) @ (subst @ S @ T @ zero_zero_nat))))). % beta
thf(fact_23_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_24_beta_Ocases, axiom,
    ((![A1 : dB, A2 : dB]: ((beta @ A1 @ A2) => ((![S2 : dB, T2 : dB]: ((A1 = (app @ (abs @ S2) @ T2)) => (~ ((A2 = (subst @ S2 @ T2 @ zero_zero_nat)))))) => ((![S2 : dB, T2 : dB, U2 : dB]: ((A1 = (app @ S2 @ U2)) => ((A2 = (app @ T2 @ U2)) => (~ ((beta @ S2 @ T2)))))) => ((![S2 : dB, T2 : dB, U2 : dB]: ((A1 = (app @ U2 @ S2)) => ((A2 = (app @ U2 @ T2)) => (~ ((beta @ S2 @ T2)))))) => (~ ((![S2 : dB]: ((A1 = (abs @ S2)) => (![T2 : dB]: ((A2 = (abs @ T2)) => (~ ((beta @ S2 @ T2)))))))))))))))). % beta.cases
thf(fact_25_beta_Osimps, axiom,
    ((beta = (^[A12 : dB]: (^[A22 : dB]: (((?[S3 : dB]: (?[T3 : dB]: (((A12 = (app @ (abs @ S3) @ T3))) & ((A22 = (subst @ S3 @ T3 @ zero_zero_nat))))))) | ((((?[S3 : dB]: (?[T3 : dB]: (?[U3 : dB]: (((A12 = (app @ S3 @ U3))) & ((((A22 = (app @ T3 @ U3))) & ((beta @ S3 @ T3))))))))) | ((((?[S3 : dB]: (?[T3 : dB]: (?[U3 : dB]: (((A12 = (app @ U3 @ S3))) & ((((A22 = (app @ U3 @ T3))) & ((beta @ S3 @ T3))))))))) | ((?[S3 : dB]: (?[T3 : dB]: (((A12 = (abs @ S3))) & ((((A22 = (abs @ T3))) & ((beta @ S3 @ T3)))))))))))))))))). % beta.simps
thf(fact_26_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_27_beta_Oinducts, axiom,
    ((![X1 : dB, X23 : dB, P : dB > dB > $o]: ((beta @ X1 @ X23) => ((![S2 : dB, T2 : dB]: (P @ (app @ (abs @ S2) @ T2) @ (subst @ S2 @ T2 @ zero_zero_nat))) => ((![S2 : dB, T2 : dB, U2 : dB]: ((beta @ S2 @ T2) => ((P @ S2 @ T2) => (P @ (app @ S2 @ U2) @ (app @ T2 @ U2))))) => ((![S2 : dB, T2 : dB, U2 : dB]: ((beta @ S2 @ T2) => ((P @ S2 @ T2) => (P @ (app @ U2 @ S2) @ (app @ U2 @ T2))))) => ((![S2 : dB, T2 : dB]: ((beta @ S2 @ T2) => ((P @ S2 @ T2) => (P @ (abs @ S2) @ (abs @ T2))))) => (P @ X1 @ X23))))))))). % beta.inducts
thf(fact_28_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_29_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_30_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_31_subst__type__IT, axiom,
    ((![T : dB, E : nat > type, I : nat, U4 : type, T4 : type, U : dB]: ((it @ T) => ((typing @ (shift_type @ E @ I @ U4) @ T @ T4) => ((it @ U) => ((typing @ E @ U @ U4) => (it @ (subst @ T @ U @ I))))))))). % subst_type_IT
thf(fact_32_app__Var__IT, axiom,
    ((![T : dB, I : nat]: ((it @ T) => (it @ (app @ T @ (var @ I))))))). % app_Var_IT
thf(fact_33_lift__type, axiom,
    ((![E : nat > type, T : dB, T4 : type, I : nat, U4 : type]: ((typing @ E @ T @ T4) => (typing @ (shift_type @ E @ I @ U4) @ (lift @ T @ I) @ T4))))). % lift_type
thf(fact_34_abs__typeE, axiom,
    ((![E : nat > type, T : dB, T4 : type]: ((typing @ E @ (abs @ T) @ T4) => (~ ((![U5 : type, V : type]: (~ ((typing @ (shift_type @ E @ zero_zero_nat @ U5) @ T @ V)))))))))). % abs_typeE
thf(fact_35_subst__lemma, axiom,
    ((![E : nat > type, T : dB, T4 : type, E2 : nat > type, U : dB, U4 : type, I : nat]: ((typing @ E @ T @ T4) => ((typing @ E2 @ U @ U4) => ((E = (shift_type @ E2 @ I @ U4)) => (typing @ E2 @ (subst @ T @ U @ I) @ T4))))))). % subst_lemma
thf(fact_36_shift__eq, axiom,
    ((![I : nat, J : nat, E : nat > type, T4 : type]: ((I = J) => ((shift_type @ E @ I @ T4 @ J) = T4))))). % shift_eq
thf(fact_37_typing__elims_I1_J, axiom,
    ((![E : nat > type, I : nat, T4 : type]: ((typing @ E @ (var @ I) @ T4) => ((E @ I) = T4))))). % typing_elims(1)
thf(fact_38_typing_OVar, axiom,
    ((![Env : nat > type, X4 : nat, T4 : type]: (((Env @ X4) = T4) => (typing @ Env @ (var @ X4) @ T4))))). % typing.Var
thf(fact_39_subject__reduction, axiom,
    ((![E : nat > type, T : dB, T4 : type, T5 : dB]: ((typing @ E @ T @ T4) => ((beta @ T @ T5) => (typing @ E @ T5 @ T4)))))). % subject_reduction
thf(fact_40_typing_Ocases, axiom,
    ((![A1 : nat > type, A2 : dB, A3 : type]: ((typing @ A1 @ A2 @ A3) => ((![X : nat]: ((A2 = (var @ X)) => (~ (((A1 @ X) = A3))))) => ((![T6 : type, T2 : dB]: ((A2 = (abs @ T2)) => (![U5 : type]: ((A3 = (fun @ T6 @ U5)) => (~ ((typing @ (shift_type @ A1 @ zero_zero_nat @ T6) @ T2 @ U5))))))) => (~ ((![S2 : dB, T6 : type, U5 : type, T2 : dB]: ((A2 = (app @ S2 @ T2)) => ((A3 = U5) => ((typing @ A1 @ S2 @ (fun @ T6 @ U5)) => (~ ((typing @ A1 @ T2 @ T6))))))))))))))). % typing.cases
thf(fact_41_typing_Osimps, axiom,
    ((typing = (^[A12 : nat > type]: (^[A22 : dB]: (^[A32 : type]: (((?[Env2 : nat > type]: (?[X5 : nat]: (?[T7 : type]: (((A12 = Env2)) & ((((A22 = (var @ X5))) & ((((A32 = T7)) & (((Env2 @ X5) = T7))))))))))) | ((((?[Env2 : nat > type]: (?[T7 : type]: (?[T3 : dB]: (?[U6 : type]: (((A12 = Env2)) & ((((A22 = (abs @ T3))) & ((((A32 = (fun @ T7 @ U6))) & ((typing @ (shift_type @ Env2 @ zero_zero_nat @ T7) @ T3 @ U6)))))))))))) | ((?[Env2 : nat > type]: (?[S3 : dB]: (?[T7 : type]: (?[U6 : type]: (?[T3 : dB]: (((A12 = Env2)) & ((((A22 = (app @ S3 @ T3))) & ((((A32 = U6)) & ((((typing @ Env2 @ S3 @ (fun @ T7 @ U6))) & ((typing @ Env2 @ T3 @ T7)))))))))))))))))))))))). % typing.simps
thf(fact_42_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_43_type__induct, axiom,
    ((![P : type > $o, T4 : type]: ((![T6 : type]: ((![T1 : type, T22 : type]: ((T6 = (fun @ T1 @ T22)) => (P @ T1))) => ((![T1 : type, T22 : type]: ((T6 = (fun @ T1 @ T22)) => (P @ T22))) => (P @ T6)))) => (P @ T4))))). % type_induct
thf(fact_44_App, axiom,
    ((![Env : nat > type, S : dB, T4 : type, U4 : type, T : dB]: ((typing @ Env @ S @ (fun @ T4 @ U4)) => ((typing @ Env @ T @ T4) => (typing @ Env @ (app @ S @ T) @ U4)))))). % App
thf(fact_45_typing__elims_I2_J, axiom,
    ((![E : nat > type, T : dB, U : dB, T4 : type]: ((typing @ E @ (app @ T @ U) @ T4) => (~ ((![T6 : type]: ((typing @ E @ T @ (fun @ T6 @ T4)) => (~ ((typing @ E @ U @ T6))))))))))). % typing_elims(2)
thf(fact_46_zero__reorient, axiom,
    ((![X4 : nat]: ((zero_zero_nat = X4) = (X4 = zero_zero_nat))))). % zero_reorient
thf(fact_47_typing_OAbs, axiom,
    ((![Env : nat > type, T4 : type, T : dB, U4 : type]: ((typing @ (shift_type @ Env @ zero_zero_nat @ T4) @ T @ U4) => (typing @ Env @ (abs @ T) @ (fun @ T4 @ U4)))))). % typing.Abs
thf(fact_48_typing__elims_I3_J, axiom,
    ((![E : nat > type, T : dB, T4 : type]: ((typing @ E @ (abs @ T) @ T4) => (~ ((![T6 : type, U5 : type]: ((T4 = (fun @ T6 @ U5)) => (~ ((typing @ (shift_type @ E @ zero_zero_nat @ T6) @ T @ U5))))))))))). % typing_elims(3)
thf(fact_49_typing_Oinducts, axiom,
    ((![X1 : nat > type, X23 : dB, X3 : type, P : (nat > type) > dB > type > $o]: ((typing @ X1 @ X23 @ X3) => ((![Env3 : nat > type, X : nat, T6 : type]: (((Env3 @ X) = T6) => (P @ Env3 @ (var @ X) @ T6))) => ((![Env3 : nat > type, T6 : type, T2 : dB, U5 : type]: ((typing @ (shift_type @ Env3 @ zero_zero_nat @ T6) @ T2 @ U5) => ((P @ (shift_type @ Env3 @ zero_zero_nat @ T6) @ T2 @ U5) => (P @ Env3 @ (abs @ T2) @ (fun @ T6 @ U5))))) => ((![Env3 : nat > type, S2 : dB, T6 : type, U5 : type, T2 : dB]: ((typing @ Env3 @ S2 @ (fun @ T6 @ U5)) => ((P @ Env3 @ S2 @ (fun @ T6 @ U5)) => ((typing @ Env3 @ T2 @ T6) => ((P @ Env3 @ T2 @ T6) => (P @ Env3 @ (app @ S2 @ T2) @ U5)))))) => (P @ X1 @ X23 @ X3)))))))). % typing.inducts
thf(fact_50_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_51_dB_Osize__gen_I1_J, axiom,
    ((![X1 : nat]: ((size_dB @ (var @ X1)) = zero_zero_nat)))). % dB.size_gen(1)
thf(fact_52_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_53_dB_Osize_I4_J, axiom,
    ((![X1 : nat]: ((size_size_dB @ (var @ X1)) = zero_zero_nat)))). % dB.size(4)
thf(fact_54_zero__natural_Orsp, axiom,
    ((zero_zero_nat = zero_zero_nat))). % zero_natural.rsp
thf(fact_55_size__neq__size__imp__neq, axiom,
    ((![X4 : dB, Y : dB]: ((~ (((size_size_dB @ X4) = (size_size_dB @ Y)))) => (~ ((X4 = Y))))))). % size_neq_size_imp_neq
thf(fact_56_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_57_var__app__type__eq, axiom,
    ((![E : nat > type, I : nat, Ts : list_dB, T4 : type, U4 : type]: ((typing @ E @ (foldl_dB_dB @ app @ (var @ I) @ Ts) @ T4) => ((typing @ E @ (foldl_dB_dB @ app @ (var @ I) @ Ts) @ U4) => (T4 = U4)))))). % var_app_type_eq
thf(fact_58_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_59_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_60_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_61_ex__head__tail, axiom,
    ((![T : dB]: (?[Ts2 : list_dB, H : dB]: ((T = (foldl_dB_dB @ app @ H @ Ts2)) & ((?[N2 : nat]: (H = (var @ N2))) | (?[U2 : dB]: (H = (abs @ U2))))))))). % ex_head_tail
thf(fact_62_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_63_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_64_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_65_substn__subst__n, axiom,
    ((substn = (^[T3 : dB]: (^[S3 : dB]: (^[N3 : nat]: (subst @ T3 @ (liftn @ N3 @ S3 @ zero_zero_nat) @ N3))))))). % substn_subst_n
thf(fact_66_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_67_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_68_liftn__0, axiom,
    ((![T : dB, K : nat]: ((liftn @ zero_zero_nat @ T @ K) = T)))). % liftn_0
thf(fact_69_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_70_IT_OVar, axiom,
    ((![Rs : list_dB, N : nat]: ((listsp_dB @ it @ Rs) => (it @ (foldl_dB_dB @ app @ (var @ N) @ Rs)))))). % IT.Var
thf(fact_71_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)))) => ((![U2 : dB]: ((P @ U2) => (![Ts2 : list_dB]: ((![X6 : dB]: ((member_dB @ X6 @ (set_dB2 @ Ts2)) => (P @ X6))) => (P @ (foldl_dB_dB @ app @ (abs @ U2) @ Ts2)))))) => (((size_size_dB @ T) = N) => (P @ T))))))). % lem
thf(fact_72_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_73_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)))) => ((![U2 : dB]: ((P @ U2) => (![Ts2 : list_dB]: ((![X6 : dB]: ((member_dB @ X6 @ (set_dB2 @ Ts2)) => (P @ X6))) => (P @ (foldl_dB_dB @ app @ (abs @ U2) @ Ts2)))))) => (P @ T)))))). % Apps_dB_induct
thf(fact_74_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_75_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_76_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_77_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_78_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_79_listsp__simps_I1_J, axiom,
    ((![A5 : dB > $o]: (listsp_dB @ A5 @ nil_dB)))). % listsp_simps(1)
thf(fact_80_listsp__simps_I1_J, axiom,
    ((![A5 : type > $o]: (listsp_type @ A5 @ nil_type)))). % listsp_simps(1)
thf(fact_81_length__0__conv, axiom,
    ((![Xs : list_dB]: (((size_size_list_dB @ Xs) = zero_zero_nat) = (Xs = nil_dB))))). % length_0_conv
thf(fact_82_length__0__conv, axiom,
    ((![Xs : list_type]: (((size_size_list_type @ Xs) = zero_zero_nat) = (Xs = nil_type))))). % length_0_conv
thf(fact_83_list_Osize_I3_J, axiom,
    (((size_size_list_dB @ nil_dB) = zero_zero_nat))). % list.size(3)
thf(fact_84_list_Osize_I3_J, axiom,
    (((size_size_list_type @ nil_type) = zero_zero_nat))). % list.size(3)
thf(fact_85_foldl__Nil, axiom,
    ((![F : dB > dB > dB, A4 : dB]: ((foldl_dB_dB @ F @ A4 @ nil_dB) = A4)))). % foldl_Nil
thf(fact_86_foldl__cong, axiom,
    ((![A4 : dB, B : dB, L : list_dB, K : list_dB, F : dB > dB > dB, G : dB > dB > dB]: ((A4 = B) => ((L = K) => ((![A6 : dB, X : dB]: ((member_dB @ X @ (set_dB2 @ L)) => ((F @ A6 @ X) = (G @ A6 @ X)))) => ((foldl_dB_dB @ F @ A4 @ L) = (foldl_dB_dB @ G @ B @ K)))))))). % foldl_cong
thf(fact_87_listsp_ONil, axiom,
    ((![A5 : dB > $o]: (listsp_dB @ A5 @ nil_dB)))). % listsp.Nil
thf(fact_88_listsp_ONil, axiom,
    ((![A5 : type > $o]: (listsp_type @ A5 @ nil_type)))). % listsp.Nil
thf(fact_89_in__listsp__conv__set, axiom,
    ((listsp_dB = (^[A7 : dB > $o]: (^[Xs2 : list_dB]: (![X5 : dB]: (((member_dB @ X5 @ (set_dB2 @ Xs2))) => ((A7 @ X5))))))))). % in_listsp_conv_set
thf(fact_90_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_91_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)))))) => (~ ((![T2 : dB]: ((R = (abs @ T2)) => (![U2 : dB, Us : list_dB]: ((Rs = (cons_dB @ U2 @ Us)) => (~ ((S = (foldl_dB_dB @ app @ (subst @ T2 @ U2 @ zero_zero_nat) @ Us)))))))))))))))). % apps_betasE
thf(fact_92_count__notin, axiom,
    ((![X4 : dB, Xs : list_dB]: ((~ ((member_dB @ X4 @ (set_dB2 @ Xs)))) => ((count_list_dB @ Xs @ X4) = zero_zero_nat))))). % count_notin
thf(fact_93_foldl__Cons, axiom,
    ((![F : dB > dB > dB, A4 : dB, X4 : dB, Xs : list_dB]: ((foldl_dB_dB @ F @ A4 @ (cons_dB @ X4 @ Xs)) = (foldl_dB_dB @ F @ (F @ A4 @ X4) @ Xs))))). % foldl_Cons
thf(fact_94_listsp_OCons, axiom,
    ((![A5 : dB > $o, A4 : dB, L : list_dB]: ((A5 @ A4) => ((listsp_dB @ A5 @ L) => (listsp_dB @ A5 @ (cons_dB @ A4 @ L))))))). % listsp.Cons
thf(fact_95_listsp_OCons, axiom,
    ((![A5 : type > $o, A4 : type, L : list_type]: ((A5 @ A4) => ((listsp_type @ A5 @ L) => (listsp_type @ A5 @ (cons_type @ A4 @ L))))))). % listsp.Cons
thf(fact_96_listspE, axiom,
    ((![A5 : dB > $o, X4 : dB, L : list_dB]: ((listsp_dB @ A5 @ (cons_dB @ X4 @ L)) => (~ (((A5 @ X4) => (~ ((listsp_dB @ A5 @ L)))))))))). % listspE
thf(fact_97_listspE, axiom,
    ((![A5 : type > $o, X4 : type, L : list_type]: ((listsp_type @ A5 @ (cons_type @ X4 @ L)) => (~ (((A5 @ X4) => (~ ((listsp_type @ A5 @ L)))))))))). % listspE
thf(fact_98_listsp__simps_I2_J, axiom,
    ((![A5 : dB > $o, X4 : dB, Xs : list_dB]: ((listsp_dB @ A5 @ (cons_dB @ X4 @ Xs)) = (((A5 @ X4)) & ((listsp_dB @ A5 @ Xs))))))). % listsp_simps(2)
thf(fact_99_listsp__simps_I2_J, axiom,
    ((![A5 : type > $o, X4 : type, Xs : list_type]: ((listsp_type @ A5 @ (cons_type @ X4 @ Xs)) = (((A5 @ X4)) & ((listsp_type @ A5 @ Xs))))))). % listsp_simps(2)
thf(fact_100_listsp_Oinducts, axiom,
    ((![A5 : dB > $o, X4 : list_dB, P : list_dB > $o]: ((listsp_dB @ A5 @ X4) => ((P @ nil_dB) => ((![A6 : dB, L2 : list_dB]: ((A5 @ A6) => ((listsp_dB @ A5 @ L2) => ((P @ L2) => (P @ (cons_dB @ A6 @ L2)))))) => (P @ X4))))))). % listsp.inducts
thf(fact_101_listsp_Oinducts, axiom,
    ((![A5 : type > $o, X4 : list_type, P : list_type > $o]: ((listsp_type @ A5 @ X4) => ((P @ nil_type) => ((![A6 : type, L2 : list_type]: ((A5 @ A6) => ((listsp_type @ A5 @ L2) => ((P @ L2) => (P @ (cons_type @ A6 @ L2)))))) => (P @ X4))))))). % listsp.inducts
thf(fact_102_listsp_Osimps, axiom,
    ((listsp_dB = (^[A7 : dB > $o]: (^[A : list_dB]: (((A = nil_dB)) | ((?[B2 : dB]: (?[L3 : list_dB]: (((A = (cons_dB @ B2 @ L3))) & ((((A7 @ B2)) & ((listsp_dB @ A7 @ L3)))))))))))))). % listsp.simps
thf(fact_103_listsp_Osimps, axiom,
    ((listsp_type = (^[A7 : type > $o]: (^[A : list_type]: (((A = nil_type)) | ((?[B2 : type]: (?[L3 : list_type]: (((A = (cons_type @ B2 @ L3))) & ((((A7 @ B2)) & ((listsp_type @ A7 @ L3)))))))))))))). % listsp.simps
thf(fact_104_listsp_Ocases, axiom,
    ((![A5 : dB > $o, A4 : list_dB]: ((listsp_dB @ A5 @ A4) => ((~ ((A4 = nil_dB))) => (~ ((![A6 : dB, L2 : list_dB]: ((A4 = (cons_dB @ A6 @ L2)) => ((A5 @ A6) => (~ ((listsp_dB @ A5 @ L2))))))))))))). % listsp.cases
thf(fact_105_listsp_Ocases, axiom,
    ((![A5 : type > $o, A4 : list_type]: ((listsp_type @ A5 @ A4) => ((~ ((A4 = nil_type))) => (~ ((![A6 : type, L2 : list_type]: ((A4 = (cons_type @ A6 @ L2)) => ((A5 @ A6) => (~ ((listsp_type @ A5 @ L2))))))))))))). % listsp.cases
thf(fact_106_count__list_Osimps_I1_J, axiom,
    ((![Y : dB]: ((count_list_dB @ nil_dB @ Y) = zero_zero_nat)))). % count_list.simps(1)
thf(fact_107_count__list_Osimps_I1_J, axiom,
    ((![Y : type]: ((count_list_type @ nil_type @ Y) = zero_zero_nat)))). % count_list.simps(1)
thf(fact_108_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_109_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_110_nths__singleton, axiom,
    ((![A5 : set_nat, X4 : dB]: (((member_nat @ zero_zero_nat @ A5) => ((nths_dB @ (cons_dB @ X4 @ nil_dB) @ A5) = (cons_dB @ X4 @ nil_dB))) & ((~ ((member_nat @ zero_zero_nat @ A5))) => ((nths_dB @ (cons_dB @ X4 @ nil_dB) @ A5) = nil_dB)))))). % nths_singleton
thf(fact_111_nths__singleton, axiom,
    ((![A5 : set_nat, X4 : type]: (((member_nat @ zero_zero_nat @ A5) => ((nths_type @ (cons_type @ X4 @ nil_type) @ A5) = (cons_type @ X4 @ nil_type))) & ((~ ((member_nat @ zero_zero_nat @ A5))) => ((nths_type @ (cons_type @ X4 @ nil_type) @ A5) = nil_type)))))). % nths_singleton
thf(fact_112_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_113_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_114_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_115_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_116_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_117_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_118_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_119_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_120_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_121_types__snoc, axiom,
    ((![E : nat > type, Ts : list_dB, Ts3 : list_type, T : dB, T4 : type]: ((typings @ E @ Ts @ Ts3) => ((typing @ E @ T @ T4) => (typings @ E @ (append_dB @ Ts @ (cons_dB @ T @ nil_dB)) @ (append_type @ Ts3 @ (cons_type @ T4 @ nil_type)))))))). % types_snoc
thf(fact_122_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, U5 : type]: ((Ts3 = (append_type @ Us2 @ (cons_type @ U5 @ nil_type))) => ((typings @ E @ Ts @ Us2) => (~ ((typing @ E @ T @ U5)))))))))))). % types_snocE
thf(fact_123_typings_Osimps_I1_J, axiom,
    ((![E : nat > type, Ts3 : list_type]: ((typings @ E @ nil_dB @ Ts3) = (Ts3 = nil_type))))). % typings.simps(1)
thf(fact_124_types__snoc__eq, axiom,
    ((![E : nat > type, Ts : list_dB, T : dB, Ts3 : list_type, T4 : type]: ((typings @ E @ (append_dB @ Ts @ (cons_dB @ T @ nil_dB)) @ (append_type @ Ts3 @ (cons_type @ T4 @ nil_type))) = (((typings @ E @ Ts @ Ts3)) & ((typing @ E @ T @ T4))))))). % types_snoc_eq
thf(fact_125_var__app__types, axiom,
    ((![E : nat > type, I : nat, Ts : list_dB, Us3 : list_dB, T4 : type, Ts3 : list_type, U4 : type]: ((typing @ E @ (foldl_dB_dB @ app @ (foldl_dB_dB @ app @ (var @ I) @ Ts) @ Us3) @ T4) => ((typings @ E @ Ts @ Ts3) => ((typing @ E @ (foldl_dB_dB @ app @ (var @ I) @ Ts) @ U4) => (?[Us2 : list_type]: ((U4 = (foldr_type_type @ fun @ Us2 @ T4)) & (typings @ E @ Us3 @ Us2))))))))). % var_app_types
thf(fact_126_var__app__typesE, axiom,
    ((![E : nat > type, I : nat, Ts : list_dB, T4 : type]: ((typing @ E @ (foldl_dB_dB @ app @ (var @ I) @ Ts) @ T4) => (~ ((![Ts4 : list_type]: ((typing @ E @ (var @ I) @ (foldr_type_type @ fun @ Ts4 @ T4)) => (~ ((typings @ E @ Ts @ Ts4))))))))))). % var_app_typesE
thf(fact_127_list__app__typeD, axiom,
    ((![E : nat > type, T : dB, Ts : list_dB, T4 : type]: ((typing @ E @ (foldl_dB_dB @ app @ T @ Ts) @ T4) => (?[Ts4 : list_type]: ((typing @ E @ T @ (foldr_type_type @ fun @ Ts4 @ T4)) & (typings @ E @ Ts @ Ts4))))))). % list_app_typeD
thf(fact_128_list__app__typeE, axiom,
    ((![E : nat > type, T : dB, Ts : list_dB, T4 : type]: ((typing @ E @ (foldl_dB_dB @ app @ T @ Ts) @ T4) => (~ ((![Ts4 : list_type]: ((typing @ E @ T @ (foldr_type_type @ fun @ Ts4 @ T4)) => (~ ((typings @ E @ Ts @ Ts4))))))))))). % list_app_typeE
thf(fact_129_list__app__typeI, axiom,
    ((![E : nat > type, T : dB, Ts3 : list_type, T4 : type, Ts : list_dB]: ((typing @ E @ T @ (foldr_type_type @ fun @ Ts3 @ T4)) => ((typings @ E @ Ts @ Ts3) => (typing @ E @ (foldl_dB_dB @ app @ T @ Ts) @ T4)))))). % list_app_typeI
thf(fact_130_IT_Oinducts, axiom,
    ((![X4 : dB, P : dB > $o]: ((it @ X4) => ((![Rs3 : list_dB, N2 : nat]: ((listsp_dB @ (^[X5 : dB]: (((it @ X5)) & ((P @ X5)))) @ 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 @ X4)))))))). % IT.inducts
thf(fact_131_length__greater__0__conv, axiom,
    ((![Xs : list_dB]: ((ord_less_nat @ zero_zero_nat @ (size_size_list_dB @ Xs)) = (~ ((Xs = nil_dB))))))). % length_greater_0_conv
thf(fact_132_length__greater__0__conv, axiom,
    ((![Xs : list_type]: ((ord_less_nat @ zero_zero_nat @ (size_size_list_type @ Xs)) = (~ ((Xs = nil_type))))))). % length_greater_0_conv
thf(fact_133_listsp__conj__eq, axiom,
    ((![A5 : dB > $o, B3 : dB > $o]: ((listsp_dB @ (^[X5 : dB]: (((A5 @ X5)) & ((B3 @ X5))))) = (^[X5 : list_dB]: (((listsp_dB @ A5 @ X5)) & ((listsp_dB @ B3 @ X5)))))))). % listsp_conj_eq
thf(fact_134_not__gr__zero, axiom,
    ((![N : nat]: ((~ ((ord_less_nat @ zero_zero_nat @ N))) = (N = zero_zero_nat))))). % not_gr_zero
thf(fact_135_neq0__conv, axiom,
    ((![N : nat]: ((~ ((N = zero_zero_nat))) = (ord_less_nat @ zero_zero_nat @ N))))). % neq0_conv
thf(fact_136_less__nat__zero__code, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % less_nat_zero_code
thf(fact_137_bot__nat__0_Onot__eq__extremum, axiom,
    ((![A4 : nat]: ((~ ((A4 = zero_zero_nat))) = (ord_less_nat @ zero_zero_nat @ A4))))). % bot_nat_0.not_eq_extremum
thf(fact_138_shift__gt, axiom,
    ((![J : nat, I : nat, E : nat > type, T4 : type]: ((ord_less_nat @ J @ I) => ((shift_type @ E @ I @ T4 @ J) = (E @ J)))))). % shift_gt
thf(fact_139_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_140_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_141_gr__implies__not__zero, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (~ ((N = zero_zero_nat))))))). % gr_implies_not_zero
thf(fact_142_not__less__zero, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % not_less_zero
thf(fact_143_gr__zeroI, axiom,
    ((![N : nat]: ((~ ((N = zero_zero_nat))) => (ord_less_nat @ zero_zero_nat @ N))))). % gr_zeroI
thf(fact_144_linorder__neqE__nat, axiom,
    ((![X4 : nat, Y : nat]: ((~ ((X4 = Y))) => ((~ ((ord_less_nat @ X4 @ Y))) => (ord_less_nat @ Y @ X4)))))). % linorder_neqE_nat
thf(fact_145_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_146_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_147_less__irrefl__nat, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ N)))))). % less_irrefl_nat
thf(fact_148_less__not__refl3, axiom,
    ((![S : nat, T : nat]: ((ord_less_nat @ S @ T) => (~ ((S = T))))))). % less_not_refl3
thf(fact_149_less__not__refl2, axiom,
    ((![N : nat, M : nat]: ((ord_less_nat @ N @ M) => (~ ((M = N))))))). % less_not_refl2

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