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

% Could-be-implicit typings (5)
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__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__Lambda__OdB, type,
    dB : $tType).
thf(ty_n_t__Nat__Onat, type,
    nat : $tType).

% Explicit typings (35)
thf(sy_c_Groups_Ozero__class_Ozero_001t__Nat__Onat, type,
    zero_zero_nat : nat).
thf(sy_c_InductTermi_OIT, type,
    it : dB > $o).
thf(sy_c_Lambda_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__Lambda__OdB, type,
    append_dB : list_dB > list_dB > list_dB).
thf(sy_c_List_Obind_001t__Lambda__OdB_001t__Lambda__OdB, type,
    bind_dB_dB : list_dB > (dB > list_dB) > list_dB).
thf(sy_c_List_Ocan__select_001t__Lambda__OdB, type,
    can_select_dB : (dB > $o) > set_dB > $o).
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_Ogen__length_001t__Lambda__OdB, type,
    gen_length_dB : nat > list_dB > nat).
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__Lambda__OdB_J, type,
    cons_list_dB : list_dB > list_list_dB > list_list_dB).
thf(sy_c_List_Olist_ONil_001t__Lambda__OdB, type,
    nil_dB : list_dB).
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_Omap_001t__Lambda__OdB_001t__Lambda__OdB, type,
    map_dB_dB : (dB > dB) > list_dB > list_dB).
thf(sy_c_List_Olist_Orec__list_001t__List__Olist_It__Lambda__OdB_J_001t__Lambda__OdB, type,
    rec_list_list_dB_dB : list_dB > (dB > list_dB > list_dB > list_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_Olist__ex1_001t__Lambda__OdB, type,
    list_ex1_dB : (dB > $o) > list_dB > $o).
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_List_Omember_001t__Lambda__OdB, type,
    member_dB : list_dB > dB > $o).
thf(sy_c_Nat_Osize__class_Osize_001t__Lambda__OdB, type,
    size_size_dB : dB > nat).
thf(sy_c_Set_Othe__elem_001t__Lambda__OdB, type,
    the_elem_dB : set_dB > dB).
thf(sy_c_member_001t__Lambda__OdB, type,
    member_dB2 : dB > set_dB > $o).
thf(sy_v_ia, type,
    ia : nat).
thf(sy_v_n, type,
    n : nat).
thf(sy_v_rs, type,
    rs : list_dB).

% Relevant facts (133)
thf(fact_0_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_1_IT_OVar, axiom,
    ((![Rs : list_dB, N : nat]: ((listsp_dB @ it @ Rs) => (it @ (foldl_dB_dB @ app @ (var @ N) @ Rs)))))). % IT.Var
thf(fact_2_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_3_listsp__conj__eq, axiom,
    ((![A : dB > $o, B : dB > $o]: ((listsp_dB @ (^[X : dB]: (((A @ X)) & ((B @ X))))) = (^[X : list_dB]: (((listsp_dB @ A @ X)) & ((listsp_dB @ B @ X)))))))). % listsp_conj_eq
thf(fact_4_dB_Oinject_I1_J, axiom,
    ((![X1 : nat, Y1 : nat]: (((var @ X1) = (var @ Y1)) = (X1 = Y1))))). % dB.inject(1)
thf(fact_5_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_6_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_7_dB_Odistinct_I1_J, axiom,
    ((![X1 : nat, X21 : dB, X22 : dB]: (~ (((var @ X1) = (app @ X21 @ X22))))))). % dB.distinct(1)
thf(fact_8_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_9_lift__map, axiom,
    ((![T : dB, Ts : list_dB, I : nat]: ((lift @ (foldl_dB_dB @ app @ T @ Ts) @ I) = (foldl_dB_dB @ app @ (lift @ T @ I) @ (map_dB_dB @ (^[T2 : dB]: (lift @ T2 @ I)) @ Ts)))))). % lift_map
thf(fact_10_ex__head__tail, axiom,
    ((![T : dB]: (?[Ts2 : list_dB, H : dB]: ((T = (foldl_dB_dB @ app @ H @ Ts2)) & ((?[N2 : nat]: (H = (var @ N2))) | (?[U : dB]: (H = (abs @ U))))))))). % ex_head_tail
thf(fact_11_dB_Oinject_I3_J, axiom,
    ((![X3 : dB, Y3 : dB]: (((abs @ X3) = (abs @ Y3)) = (X3 = Y3))))). % dB.inject(3)
thf(fact_12_map__ident, axiom,
    (((map_dB_dB @ (^[X : dB]: X)) = (^[Xs : list_dB]: Xs)))). % map_ident
thf(fact_13_Nil__is__map__conv, axiom,
    ((![F : dB > dB, Xs2 : list_dB]: ((nil_dB = (map_dB_dB @ F @ Xs2)) = (Xs2 = nil_dB))))). % Nil_is_map_conv
thf(fact_14_map__is__Nil__conv, axiom,
    ((![F : dB > dB, Xs2 : list_dB]: (((map_dB_dB @ F @ Xs2) = nil_dB) = (Xs2 = nil_dB))))). % map_is_Nil_conv
thf(fact_15_list_Omap__disc__iff, axiom,
    ((![F : dB > dB, A2 : list_dB]: (((map_dB_dB @ F @ A2) = nil_dB) = (A2 = nil_dB))))). % list.map_disc_iff
thf(fact_16_listsp__simps_I1_J, axiom,
    ((![A : dB > $o]: (listsp_dB @ A @ nil_dB)))). % listsp_simps(1)
thf(fact_17_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_18_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_19_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_20_list_Osimps_I8_J, axiom,
    ((![F : dB > dB]: ((map_dB_dB @ F @ nil_dB) = nil_dB)))). % list.simps(8)
thf(fact_21_list_Omap__ident, axiom,
    ((![T : list_dB]: ((map_dB_dB @ (^[X : dB]: X) @ T) = T)))). % list.map_ident
thf(fact_22_dB_Odistinct_I5_J, axiom,
    ((![X21 : dB, X22 : dB, X3 : dB]: (~ (((app @ X21 @ X22) = (abs @ X3))))))). % dB.distinct(5)
thf(fact_23_foldl__Nil, axiom,
    ((![F : dB > dB > dB, A2 : dB]: ((foldl_dB_dB @ F @ A2 @ nil_dB) = A2)))). % foldl_Nil
thf(fact_24_dB_Odistinct_I3_J, axiom,
    ((![X1 : nat, X3 : dB]: (~ (((var @ X1) = (abs @ X3))))))). % dB.distinct(3)
thf(fact_25_listsp_ONil, axiom,
    ((![A : dB > $o]: (listsp_dB @ A @ nil_dB)))). % listsp.Nil
thf(fact_26_Lambda, axiom,
    ((![R : dB]: ((it @ R) => (it @ (abs @ R)))))). % Lambda
thf(fact_27_foldl__map, axiom,
    ((![G : dB > dB > dB, A2 : dB, F : dB > dB, Xs2 : list_dB]: ((foldl_dB_dB @ G @ A2 @ (map_dB_dB @ F @ Xs2)) = (foldl_dB_dB @ (^[A3 : dB]: (^[X : dB]: (G @ A3 @ (F @ X)))) @ A2 @ Xs2))))). % foldl_map
thf(fact_28_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_29_dB_Oinduct, axiom,
    ((![P : dB > $o, DB : dB]: ((![X2 : nat]: (P @ (var @ X2))) => ((![X1a : dB, X23 : dB]: ((P @ X1a) => ((P @ X23) => (P @ (app @ X1a @ X23))))) => ((![X2 : dB]: ((P @ X2) => (P @ (abs @ X2)))) => (P @ DB))))))). % dB.induct
thf(fact_30_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_31_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_32_subst__map, axiom,
    ((![T : dB, Ts : list_dB, U2 : dB, I : nat]: ((subst @ (foldl_dB_dB @ app @ T @ Ts) @ U2 @ I) = (foldl_dB_dB @ app @ (subst @ T @ U2 @ I) @ (map_dB_dB @ (^[T2 : dB]: (subst @ T2 @ U2 @ I)) @ Ts)))))). % subst_map
thf(fact_33_map__eq__map__tailrec, axiom,
    ((map_dB_dB = map_tailrec_dB_dB))). % map_eq_map_tailrec
thf(fact_34_list__ex1__simps_I1_J, axiom,
    ((![P : dB > $o]: (~ ((list_ex1_dB @ P @ nil_dB)))))). % list_ex1_simps(1)
thf(fact_35_Apps__dB__induct, axiom,
    ((![P : dB > $o, T : dB]: ((![N2 : nat, Ts2 : list_dB]: ((![X4 : dB]: ((member_dB2 @ X4 @ (set_dB2 @ Ts2)) => (P @ X4))) => (P @ (foldl_dB_dB @ app @ (var @ N2) @ Ts2)))) => ((![U : dB]: ((P @ U) => (![Ts2 : list_dB]: ((![X4 : dB]: ((member_dB2 @ X4 @ (set_dB2 @ Ts2)) => (P @ X4))) => (P @ (foldl_dB_dB @ app @ (abs @ U) @ Ts2)))))) => (P @ T)))))). % Apps_dB_induct
thf(fact_36_IT_Oinducts, axiom,
    ((![X5 : dB, P : dB > $o]: ((it @ X5) => ((![Rs2 : list_dB, N2 : nat]: ((listsp_dB @ (^[X : dB]: (((it @ X)) & ((P @ X)))) @ 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 @ X5)))))))). % IT.inducts
thf(fact_37_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_38_IT_Ocases, axiom,
    ((![A2 : dB]: ((it @ A2) => ((![Rs2 : list_dB]: ((?[N2 : nat]: (A2 = (foldl_dB_dB @ app @ (var @ N2) @ Rs2))) => (~ ((listsp_dB @ it @ Rs2))))) => ((![R2 : dB]: ((A2 = (abs @ R2)) => (~ ((it @ R2))))) => (~ ((![R2 : dB, S2 : dB, Ss2 : list_dB]: ((A2 = (foldl_dB_dB @ app @ (app @ (abs @ R2) @ S2) @ Ss2)) => ((it @ (foldl_dB_dB @ app @ (subst @ R2 @ S2 @ zero_zero_nat) @ Ss2)) => (~ ((it @ S2)))))))))))))). % IT.cases
thf(fact_39_bind__simps_I1_J, axiom,
    ((![F : dB > list_dB]: ((bind_dB_dB @ nil_dB @ F) = nil_dB)))). % bind_simps(1)
thf(fact_40_member__rec_I2_J, axiom,
    ((![Y : dB]: (~ ((member_dB @ nil_dB @ Y)))))). % member_rec(2)
thf(fact_41_gen__length__code_I1_J, axiom,
    ((![N : nat]: ((gen_length_dB @ N @ nil_dB) = N)))). % gen_length_code(1)
thf(fact_42_map__eq__conv, axiom,
    ((![F : dB > dB, Xs2 : list_dB, G : dB > dB]: (((map_dB_dB @ F @ Xs2) = (map_dB_dB @ G @ Xs2)) = (![X : dB]: (((member_dB2 @ X @ (set_dB2 @ Xs2))) => (((F @ X) = (G @ X))))))))). % map_eq_conv
thf(fact_43_in__listspI, axiom,
    ((![Xs2 : list_dB, A : dB > $o]: ((![X2 : dB]: ((member_dB2 @ X2 @ (set_dB2 @ Xs2)) => (A @ X2))) => (listsp_dB @ A @ Xs2))))). % in_listspI
thf(fact_44_subst__eq, axiom,
    ((![K : nat, U2 : dB]: ((subst @ (var @ K) @ U2 @ K) = U2)))). % subst_eq
thf(fact_45_subst__lift, axiom,
    ((![T : dB, K : nat, S : dB]: ((subst @ (lift @ T @ K) @ S @ K) = T)))). % subst_lift
thf(fact_46_list__ex1__iff, axiom,
    ((list_ex1_dB = (^[P2 : dB > $o]: (^[Xs : list_dB]: (?[X : dB]: (((((member_dB2 @ X @ (set_dB2 @ Xs))) & ((P2 @ X)))) & ((![Y2 : dB]: (((((member_dB2 @ Y2 @ (set_dB2 @ Xs))) & ((P2 @ Y2)))) => ((Y2 = X)))))))))))). % list_ex1_iff
thf(fact_47_in__set__member, axiom,
    ((![X5 : dB, Xs2 : list_dB]: ((member_dB2 @ X5 @ (set_dB2 @ Xs2)) = (member_dB @ Xs2 @ X5))))). % in_set_member
thf(fact_48_list_Oinj__map__strong, axiom,
    ((![X5 : list_dB, Xa : list_dB, F : dB > dB, Fa : dB > dB]: ((![Z : dB, Za : dB]: ((member_dB2 @ Z @ (set_dB2 @ X5)) => ((member_dB2 @ Za @ (set_dB2 @ Xa)) => (((F @ Z) = (Fa @ Za)) => (Z = Za))))) => (((map_dB_dB @ F @ X5) = (map_dB_dB @ Fa @ Xa)) => (X5 = Xa)))))). % list.inj_map_strong
thf(fact_49_list_Omap__cong0, axiom,
    ((![X5 : list_dB, F : dB > dB, G : dB > dB]: ((![Z : dB]: ((member_dB2 @ Z @ (set_dB2 @ X5)) => ((F @ Z) = (G @ Z)))) => ((map_dB_dB @ F @ X5) = (map_dB_dB @ G @ X5)))))). % list.map_cong0
thf(fact_50_list_Omap__cong, axiom,
    ((![X5 : list_dB, Ya : list_dB, F : dB > dB, G : dB > dB]: ((X5 = Ya) => ((![Z : dB]: ((member_dB2 @ Z @ (set_dB2 @ Ya)) => ((F @ Z) = (G @ Z)))) => ((map_dB_dB @ F @ X5) = (map_dB_dB @ G @ Ya))))))). % list.map_cong
thf(fact_51_ex__map__conv, axiom,
    ((![Ys : list_dB, F : dB > dB]: ((?[Xs : list_dB]: (Ys = (map_dB_dB @ F @ Xs))) = (![X : dB]: (((member_dB2 @ X @ (set_dB2 @ Ys))) => ((?[Y2 : dB]: (X = (F @ Y2)))))))))). % ex_map_conv
thf(fact_52_map__cong, axiom,
    ((![Xs2 : list_dB, Ys : list_dB, F : dB > dB, G : dB > dB]: ((Xs2 = Ys) => ((![X2 : dB]: ((member_dB2 @ X2 @ (set_dB2 @ Ys)) => ((F @ X2) = (G @ X2)))) => ((map_dB_dB @ F @ Xs2) = (map_dB_dB @ G @ Ys))))))). % map_cong
thf(fact_53_map__idI, axiom,
    ((![Xs2 : list_dB, F : dB > dB]: ((![X2 : dB]: ((member_dB2 @ X2 @ (set_dB2 @ Xs2)) => ((F @ X2) = X2))) => ((map_dB_dB @ F @ Xs2) = Xs2))))). % map_idI
thf(fact_54_map__ext, axiom,
    ((![Xs2 : list_dB, F : dB > dB, G : dB > dB]: ((![X2 : dB]: ((member_dB2 @ X2 @ (set_dB2 @ Xs2)) => ((F @ X2) = (G @ X2)))) => ((map_dB_dB @ F @ Xs2) = (map_dB_dB @ G @ Xs2)))))). % map_ext
thf(fact_55_foldl__cong, axiom,
    ((![A2 : dB, B2 : dB, L : list_dB, K : list_dB, F : dB > dB > dB, G : dB > dB > dB]: ((A2 = B2) => ((L = K) => ((![A4 : dB, X2 : dB]: ((member_dB2 @ X2 @ (set_dB2 @ L)) => ((F @ A4 @ X2) = (G @ A4 @ X2)))) => ((foldl_dB_dB @ F @ A2 @ L) = (foldl_dB_dB @ G @ B2 @ K)))))))). % foldl_cong
thf(fact_56_in__listspD, axiom,
    ((![A : dB > $o, Xs2 : list_dB]: ((listsp_dB @ A @ Xs2) => (![X4 : dB]: ((member_dB2 @ X4 @ (set_dB2 @ Xs2)) => (A @ X4))))))). % in_listspD
thf(fact_57_in__listsp__conv__set, axiom,
    ((listsp_dB = (^[A5 : dB > $o]: (^[Xs : list_dB]: (![X : dB]: (((member_dB2 @ X @ (set_dB2 @ Xs))) => ((A5 @ X))))))))). % in_listsp_conv_set
thf(fact_58_subst__App, axiom,
    ((![T : dB, U2 : dB, S : dB, K : nat]: ((subst @ (app @ T @ U2) @ S @ K) = (app @ (subst @ T @ S @ K) @ (subst @ U2 @ S @ K)))))). % subst_App
thf(fact_59_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_60_can__select__set__list__ex1, axiom,
    ((![P : dB > $o, A : list_dB]: ((can_select_dB @ P @ (set_dB2 @ A)) = (list_ex1_dB @ P @ A))))). % can_select_set_list_ex1
thf(fact_61_lem, axiom,
    ((![P : dB > $o, T : dB, N : nat]: ((![N2 : nat, Ts2 : list_dB]: ((![X4 : dB]: ((member_dB2 @ X4 @ (set_dB2 @ Ts2)) => (P @ X4))) => (P @ (foldl_dB_dB @ app @ (var @ N2) @ Ts2)))) => ((![U : dB]: ((P @ U) => (![Ts2 : list_dB]: ((![X4 : dB]: ((member_dB2 @ X4 @ (set_dB2 @ Ts2)) => (P @ X4))) => (P @ (foldl_dB_dB @ app @ (abs @ U) @ Ts2)))))) => (((size_size_dB @ T) = N) => (P @ T))))))). % lem
thf(fact_62_count__notin, axiom,
    ((![X5 : dB, Xs2 : list_dB]: ((~ ((member_dB2 @ X5 @ (set_dB2 @ Xs2)))) => ((count_list_dB @ Xs2 @ X5) = zero_zero_nat))))). % count_notin
thf(fact_63_dB_Osize__gen_I1_J, axiom,
    ((![X1 : nat]: ((size_dB @ (var @ X1)) = zero_zero_nat)))). % dB.size_gen(1)
thf(fact_64_zero__reorient, axiom,
    ((![X5 : nat]: ((zero_zero_nat = X5) = (X5 = zero_zero_nat))))). % zero_reorient
thf(fact_65_dB_Osize_I4_J, axiom,
    ((![X1 : nat]: ((size_size_dB @ (var @ X1)) = zero_zero_nat)))). % dB.size(4)
thf(fact_66_count__list_Osimps_I1_J, axiom,
    ((![Y : dB]: ((count_list_dB @ nil_dB @ Y) = zero_zero_nat)))). % count_list.simps(1)
thf(fact_67_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_68_beta__cases_I3_J, axiom,
    ((![S : dB, T : dB, U2 : dB]: ((beta @ (app @ S @ T) @ U2) => ((![S2 : dB]: ((S = (abs @ S2)) => (~ ((U2 = (subst @ S2 @ T @ zero_zero_nat)))))) => ((![T3 : dB]: ((U2 = (app @ T3 @ T)) => (~ ((beta @ S @ T3))))) => (~ ((![T3 : dB]: ((U2 = (app @ S @ T3)) => (~ ((beta @ T @ T3))))))))))))). % beta_cases(3)
thf(fact_69_beta, axiom,
    ((![S : dB, T : dB]: (beta @ (app @ (abs @ S) @ T) @ (subst @ S @ T @ zero_zero_nat))))). % beta
thf(fact_70_beta_Ocases, axiom,
    ((![A1 : dB, A22 : dB]: ((beta @ A1 @ A22) => ((![S2 : dB, T3 : dB]: ((A1 = (app @ (abs @ S2) @ T3)) => (~ ((A22 = (subst @ S2 @ T3 @ zero_zero_nat)))))) => ((![S2 : dB, T3 : dB, U : dB]: ((A1 = (app @ S2 @ U)) => ((A22 = (app @ T3 @ U)) => (~ ((beta @ S2 @ T3)))))) => ((![S2 : dB, T3 : dB, U : dB]: ((A1 = (app @ U @ S2)) => ((A22 = (app @ U @ T3)) => (~ ((beta @ S2 @ T3)))))) => (~ ((![S2 : dB]: ((A1 = (abs @ S2)) => (![T3 : dB]: ((A22 = (abs @ T3)) => (~ ((beta @ S2 @ T3)))))))))))))))). % beta.cases
thf(fact_71_appR, axiom,
    ((![S : dB, T : dB, U2 : dB]: ((beta @ S @ T) => (beta @ (app @ U2 @ S) @ (app @ U2 @ T)))))). % appR
thf(fact_72_appL, axiom,
    ((![S : dB, T : dB, U2 : dB]: ((beta @ S @ T) => (beta @ (app @ S @ U2) @ (app @ T @ U2)))))). % appL
thf(fact_73_beta__cases_I2_J, axiom,
    ((![R : dB, S : dB]: ((beta @ (abs @ R) @ S) => (~ ((![T3 : dB]: ((S = (abs @ T3)) => (~ ((beta @ R @ T3))))))))))). % beta_cases(2)
thf(fact_74_abs, axiom,
    ((![S : dB, T : dB]: ((beta @ S @ T) => (beta @ (abs @ S) @ (abs @ T)))))). % abs
thf(fact_75_beta__cases_I1_J, axiom,
    ((![I : nat, T : dB]: (~ ((beta @ (var @ I) @ T)))))). % beta_cases(1)
thf(fact_76_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_77_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_78_substn_Osimps_I2_J, axiom,
    ((![T : dB, U2 : dB, S : dB, K : nat]: ((substn @ (app @ T @ U2) @ S @ K) = (app @ (substn @ T @ S @ K) @ (substn @ U2 @ S @ K)))))). % substn.simps(2)
thf(fact_79_beta_Oinducts, axiom,
    ((![X1 : dB, X24 : dB, P : dB > dB > $o]: ((beta @ X1 @ X24) => ((![S2 : dB, T3 : dB]: (P @ (app @ (abs @ S2) @ T3) @ (subst @ S2 @ T3 @ zero_zero_nat))) => ((![S2 : dB, T3 : dB, U : dB]: ((beta @ S2 @ T3) => ((P @ S2 @ T3) => (P @ (app @ S2 @ U) @ (app @ T3 @ U))))) => ((![S2 : dB, T3 : dB, U : dB]: ((beta @ S2 @ T3) => ((P @ S2 @ T3) => (P @ (app @ U @ S2) @ (app @ U @ T3))))) => ((![S2 : dB, T3 : dB]: ((beta @ S2 @ T3) => ((P @ S2 @ T3) => (P @ (abs @ S2) @ (abs @ T3))))) => (P @ X1 @ X24))))))))). % beta.inducts
thf(fact_80_beta_Osimps, axiom,
    ((beta = (^[A12 : dB]: (^[A23 : dB]: (((?[S3 : dB]: (?[T2 : dB]: (((A12 = (app @ (abs @ S3) @ T2))) & ((A23 = (subst @ S3 @ T2 @ zero_zero_nat))))))) | ((((?[S3 : dB]: (?[T2 : dB]: (?[U3 : dB]: (((A12 = (app @ S3 @ U3))) & ((((A23 = (app @ T2 @ U3))) & ((beta @ S3 @ T2))))))))) | ((((?[S3 : dB]: (?[T2 : dB]: (?[U3 : dB]: (((A12 = (app @ U3 @ S3))) & ((((A23 = (app @ U3 @ T2))) & ((beta @ S3 @ T2))))))))) | ((?[S3 : dB]: (?[T2 : dB]: (((A12 = (abs @ S3))) & ((((A23 = (abs @ T2))) & ((beta @ S3 @ T2)))))))))))))))))). % beta.simps
thf(fact_81_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_82_substn__subst__n, axiom,
    ((substn = (^[T2 : dB]: (^[S3 : dB]: (^[N3 : nat]: (subst @ T2 @ (liftn @ N3 @ S3 @ zero_zero_nat) @ N3))))))). % substn_subst_n
thf(fact_83_head__Var__reduction, axiom,
    ((![N : nat, Rs : list_dB, V : dB]: ((beta @ (foldl_dB_dB @ app @ (var @ N) @ Rs) @ V) => (?[Ss2 : list_dB]: ((step1_dB @ beta @ Rs @ Ss2) & (V = (foldl_dB_dB @ app @ (var @ N) @ Ss2)))))))). % head_Var_reduction
thf(fact_84_liftn__0, axiom,
    ((![T : dB, K : nat]: ((liftn @ zero_zero_nat @ T @ K) = T)))). % liftn_0
thf(fact_85_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_86_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_87_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)))))) => (~ ((![T3 : dB]: ((R = (abs @ T3)) => (![U : dB, Us : list_dB]: ((Rs = (cons_dB @ U @ Us)) => (~ ((S = (foldl_dB_dB @ app @ (subst @ T3 @ U @ zero_zero_nat) @ Us)))))))))))))))). % apps_betasE
thf(fact_88_ex__step1I, axiom,
    ((![X5 : dB, Xs2 : list_dB, R : dB > dB > $o, Y : dB]: ((member_dB2 @ X5 @ (set_dB2 @ Xs2)) => ((R @ Y @ X5) => (?[Ys2 : list_dB]: ((step1_dB @ R @ Ys2 @ Xs2) & (member_dB2 @ Y @ (set_dB2 @ Ys2))))))))). % ex_step1I
thf(fact_89_not__step1__Nil, axiom,
    ((![R : dB > dB > $o, Xs2 : list_dB]: (~ ((step1_dB @ R @ Xs2 @ nil_dB)))))). % not_step1_Nil
thf(fact_90_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_91_Cons__step1__Cons, axiom,
    ((![R : dB > dB > $o, Y : dB, Ys : list_dB, X5 : dB, Xs2 : list_dB]: ((step1_dB @ R @ (cons_dB @ Y @ Ys) @ (cons_dB @ X5 @ Xs2)) = (((((R @ Y @ X5)) & ((Xs2 = Ys)))) | ((((X5 = Y)) & ((step1_dB @ R @ Ys @ Xs2))))))))). % Cons_step1_Cons
thf(fact_92_Cons__step1E, axiom,
    ((![R : dB > dB > $o, Ys : list_dB, X5 : dB, Xs2 : list_dB]: ((step1_dB @ R @ Ys @ (cons_dB @ X5 @ Xs2)) => ((![Y4 : dB]: ((Ys = (cons_dB @ Y4 @ Xs2)) => (~ ((R @ Y4 @ X5))))) => (~ ((![Zs : list_dB]: ((Ys = (cons_dB @ X5 @ Zs)) => (~ ((step1_dB @ R @ Zs @ Xs2)))))))))))). % Cons_step1E
thf(fact_93_list_Odistinct_I1_J, axiom,
    ((![X21 : dB, X22 : list_dB]: (~ ((nil_dB = (cons_dB @ X21 @ X22))))))). % list.distinct(1)
thf(fact_94_list_OdiscI, axiom,
    ((![List : list_dB, X21 : dB, X22 : list_dB]: ((List = (cons_dB @ X21 @ X22)) => (~ ((List = nil_dB))))))). % list.discI
thf(fact_95_list_Oexhaust, axiom,
    ((![Y : list_dB]: ((~ ((Y = nil_dB))) => (~ ((![X212 : dB, X222 : list_dB]: (~ ((Y = (cons_dB @ X212 @ X222))))))))))). % list.exhaust
thf(fact_96_list_Oinducts, axiom,
    ((![P : list_dB > $o, List : list_dB]: ((P @ nil_dB) => ((![X12 : dB, X23 : list_dB]: ((P @ X23) => (P @ (cons_dB @ X12 @ X23)))) => (P @ List)))))). % list.inducts
thf(fact_97_neq__Nil__conv, axiom,
    ((![Xs2 : list_dB]: ((~ ((Xs2 = nil_dB))) = (?[Y2 : dB]: (?[Ys3 : list_dB]: (Xs2 = (cons_dB @ Y2 @ Ys3)))))))). % neq_Nil_conv
thf(fact_98_list__induct2_H, axiom,
    ((![P : list_dB > list_dB > $o, Xs2 : list_dB, Ys : list_dB]: ((P @ nil_dB @ nil_dB) => ((![X2 : dB, Xs3 : list_dB]: (P @ (cons_dB @ X2 @ Xs3) @ nil_dB)) => ((![Y4 : dB, Ys2 : list_dB]: (P @ nil_dB @ (cons_dB @ Y4 @ Ys2))) => ((![X2 : dB, Xs3 : list_dB, Y4 : dB, Ys2 : list_dB]: ((P @ Xs3 @ Ys2) => (P @ (cons_dB @ X2 @ Xs3) @ (cons_dB @ Y4 @ Ys2)))) => (P @ Xs2 @ Ys)))))))). % list_induct2'
thf(fact_99_splice_Oinduct, axiom,
    ((![P : list_dB > list_dB > $o, A0 : list_dB, A1 : list_dB]: ((![X_1 : list_dB]: (P @ nil_dB @ X_1)) => ((![X2 : dB, Xs3 : list_dB, Ys2 : list_dB]: ((P @ Ys2 @ Xs3) => (P @ (cons_dB @ X2 @ Xs3) @ Ys2))) => (P @ A0 @ A1)))))). % splice.induct
thf(fact_100_induct__list012, axiom,
    ((![P : list_dB > $o, Xs2 : list_dB]: ((P @ nil_dB) => ((![X2 : dB]: (P @ (cons_dB @ X2 @ nil_dB))) => ((![X2 : dB, Y4 : dB, Zs : list_dB]: ((P @ Zs) => ((P @ (cons_dB @ Y4 @ Zs)) => (P @ (cons_dB @ X2 @ (cons_dB @ Y4 @ Zs)))))) => (P @ Xs2))))))). % induct_list012
thf(fact_101_shuffles_Oinduct, axiom,
    ((![P : list_dB > list_dB > $o, A0 : list_dB, A1 : list_dB]: ((![X_1 : list_dB]: (P @ nil_dB @ X_1)) => ((![Xs3 : list_dB]: (P @ Xs3 @ nil_dB)) => ((![X2 : dB, Xs3 : list_dB, Y4 : dB, Ys2 : list_dB]: ((P @ Xs3 @ (cons_dB @ Y4 @ Ys2)) => ((P @ (cons_dB @ X2 @ Xs3) @ Ys2) => (P @ (cons_dB @ X2 @ Xs3) @ (cons_dB @ Y4 @ Ys2))))) => (P @ A0 @ A1))))))). % shuffles.induct
thf(fact_102_remdups__adj_Ocases, axiom,
    ((![X5 : list_dB]: ((~ ((X5 = nil_dB))) => ((![X2 : dB]: (~ ((X5 = (cons_dB @ X2 @ nil_dB))))) => (~ ((![X2 : dB, Y4 : dB, Xs3 : list_dB]: (~ ((X5 = (cons_dB @ X2 @ (cons_dB @ Y4 @ Xs3))))))))))))). % remdups_adj.cases
thf(fact_103_sorted__wrt_Oinduct, axiom,
    ((![P : (dB > dB > $o) > list_dB > $o, A0 : dB > dB > $o, A1 : list_dB]: ((![P3 : dB > dB > $o]: (P @ P3 @ nil_dB)) => ((![P3 : dB > dB > $o, X2 : dB, Ys2 : list_dB]: ((P @ P3 @ Ys2) => (P @ P3 @ (cons_dB @ X2 @ Ys2)))) => (P @ A0 @ A1)))))). % sorted_wrt.induct
thf(fact_104_remdups__adj_Oinduct, axiom,
    ((![P : list_dB > $o, A0 : list_dB]: ((P @ nil_dB) => ((![X2 : dB]: (P @ (cons_dB @ X2 @ nil_dB))) => ((![X2 : dB, Y4 : dB, Xs3 : list_dB]: (((X2 = Y4) => (P @ (cons_dB @ X2 @ Xs3))) => (((~ ((X2 = Y4))) => (P @ (cons_dB @ Y4 @ Xs3))) => (P @ (cons_dB @ X2 @ (cons_dB @ Y4 @ Xs3)))))) => (P @ A0))))))). % remdups_adj.induct
thf(fact_105_successively_Oinduct, axiom,
    ((![P : (dB > dB > $o) > list_dB > $o, A0 : dB > dB > $o, A1 : list_dB]: ((![P3 : dB > dB > $o]: (P @ P3 @ nil_dB)) => ((![P3 : dB > dB > $o, X2 : dB]: (P @ P3 @ (cons_dB @ X2 @ nil_dB))) => ((![P3 : dB > dB > $o, X2 : dB, Y4 : dB, Xs3 : list_dB]: ((P @ P3 @ (cons_dB @ Y4 @ Xs3)) => (P @ P3 @ (cons_dB @ X2 @ (cons_dB @ Y4 @ Xs3))))) => (P @ A0 @ A1))))))). % successively.induct
thf(fact_106_list__nonempty__induct, axiom,
    ((![Xs2 : list_dB, P : list_dB > $o]: ((~ ((Xs2 = nil_dB))) => ((![X2 : dB]: (P @ (cons_dB @ X2 @ nil_dB))) => ((![X2 : dB, Xs3 : list_dB]: ((~ ((Xs3 = nil_dB))) => ((P @ Xs3) => (P @ (cons_dB @ X2 @ Xs3))))) => (P @ Xs2))))))). % list_nonempty_induct
thf(fact_107_map__tailrec__rev_Oinduct, axiom,
    ((![P : (dB > dB) > list_dB > list_dB > $o, A0 : dB > dB, A1 : list_dB, A22 : list_dB]: ((![F2 : dB > dB, X_1 : list_dB]: (P @ F2 @ nil_dB @ X_1)) => ((![F2 : dB > dB, A4 : dB, As : list_dB, Bs : list_dB]: ((P @ F2 @ As @ (cons_dB @ (F2 @ A4) @ Bs)) => (P @ F2 @ (cons_dB @ A4 @ As) @ Bs))) => (P @ A0 @ A1 @ A22)))))). % map_tailrec_rev.induct
thf(fact_108_list_Oset__cases, axiom,
    ((![E : dB, A2 : list_dB]: ((member_dB2 @ E @ (set_dB2 @ A2)) => ((![Z2 : list_dB]: (~ ((A2 = (cons_dB @ E @ Z2))))) => (~ ((![Z1 : dB, Z2 : list_dB]: ((A2 = (cons_dB @ Z1 @ Z2)) => (~ ((member_dB2 @ E @ (set_dB2 @ Z2))))))))))))). % list.set_cases
thf(fact_109_set__ConsD, axiom,
    ((![Y : dB, X5 : dB, Xs2 : list_dB]: ((member_dB2 @ Y @ (set_dB2 @ (cons_dB @ X5 @ Xs2))) => ((Y = X5) | (member_dB2 @ Y @ (set_dB2 @ Xs2))))))). % set_ConsD
thf(fact_110_list_Oset__intros_I1_J, axiom,
    ((![X21 : dB, X22 : list_dB]: (member_dB2 @ X21 @ (set_dB2 @ (cons_dB @ X21 @ X22)))))). % list.set_intros(1)
thf(fact_111_list_Oset__intros_I2_J, axiom,
    ((![Y : dB, X22 : list_dB, X21 : dB]: ((member_dB2 @ Y @ (set_dB2 @ X22)) => (member_dB2 @ Y @ (set_dB2 @ (cons_dB @ X21 @ X22))))))). % list.set_intros(2)
thf(fact_112_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_113_Cons__eq__map__D, axiom,
    ((![X5 : dB, Xs2 : list_dB, F : dB > dB, Ys : list_dB]: (((cons_dB @ X5 @ Xs2) = (map_dB_dB @ F @ Ys)) => (?[Z : dB, Zs : list_dB]: ((Ys = (cons_dB @ Z @ Zs)) & ((X5 = (F @ Z)) & (Xs2 = (map_dB_dB @ F @ Zs))))))))). % Cons_eq_map_D
thf(fact_114_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)) => (?[Z : dB, Zs : list_dB]: ((Xs2 = (cons_dB @ Z @ Zs)) & (((F @ Z) = Y) & ((map_dB_dB @ F @ Zs) = Ys)))))))). % map_eq_Cons_D
thf(fact_115_Cons__eq__map__conv, axiom,
    ((![X5 : dB, Xs2 : list_dB, F : dB > dB, Ys : list_dB]: (((cons_dB @ X5 @ Xs2) = (map_dB_dB @ F @ Ys)) = (?[Z3 : dB]: (?[Zs2 : list_dB]: (((Ys = (cons_dB @ Z3 @ Zs2))) & ((((X5 = (F @ Z3))) & ((Xs2 = (map_dB_dB @ F @ Zs2)))))))))))). % Cons_eq_map_conv
thf(fact_116_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)) = (?[Z3 : dB]: (?[Zs2 : list_dB]: (((Xs2 = (cons_dB @ Z3 @ Zs2))) & (((((F @ Z3) = Y)) & (((map_dB_dB @ F @ Zs2) = Ys))))))))))). % map_eq_Cons_conv
thf(fact_117_foldl__Cons, axiom,
    ((![F : dB > dB > dB, A2 : dB, X5 : dB, Xs2 : list_dB]: ((foldl_dB_dB @ F @ A2 @ (cons_dB @ X5 @ Xs2)) = (foldl_dB_dB @ F @ (F @ A2 @ X5) @ Xs2))))). % foldl_Cons
thf(fact_118_listsp_OCons, axiom,
    ((![A : dB > $o, A2 : dB, L : list_dB]: ((A @ A2) => ((listsp_dB @ A @ L) => (listsp_dB @ A @ (cons_dB @ A2 @ L))))))). % listsp.Cons
thf(fact_119_listspE, axiom,
    ((![A : dB > $o, X5 : dB, L : list_dB]: ((listsp_dB @ A @ (cons_dB @ X5 @ L)) => (~ (((A @ X5) => (~ ((listsp_dB @ A @ L)))))))))). % listspE
thf(fact_120_listsp__simps_I2_J, axiom,
    ((![A : dB > $o, X5 : dB, Xs2 : list_dB]: ((listsp_dB @ A @ (cons_dB @ X5 @ Xs2)) = (((A @ X5)) & ((listsp_dB @ A @ Xs2))))))). % listsp_simps(2)
thf(fact_121_not__Cons__self2, axiom,
    ((![X5 : dB, Xs2 : list_dB]: (~ (((cons_dB @ X5 @ Xs2) = Xs2)))))). % not_Cons_self2
thf(fact_122_transpose_Ocases, axiom,
    ((![X5 : list_list_dB]: ((~ ((X5 = nil_list_dB))) => ((![Xss : list_list_dB]: (~ ((X5 = (cons_list_dB @ nil_dB @ Xss))))) => (~ ((![X2 : dB, Xs3 : list_dB, Xss : list_list_dB]: (~ ((X5 = (cons_list_dB @ (cons_dB @ X2 @ Xs3) @ Xss)))))))))))). % transpose.cases
thf(fact_123_member__rec_I1_J, axiom,
    ((![X5 : dB, Xs2 : list_dB, Y : dB]: ((member_dB @ (cons_dB @ X5 @ Xs2) @ Y) = (((X5 = Y)) | ((member_dB @ Xs2 @ Y))))))). % member_rec(1)
thf(fact_124_listsp_Oinducts, axiom,
    ((![A : dB > $o, X5 : list_dB, P : list_dB > $o]: ((listsp_dB @ A @ X5) => ((P @ nil_dB) => ((![A4 : dB, L2 : list_dB]: ((A @ A4) => ((listsp_dB @ A @ L2) => ((P @ L2) => (P @ (cons_dB @ A4 @ L2)))))) => (P @ X5))))))). % listsp.inducts
thf(fact_125_listsp_Osimps, axiom,
    ((listsp_dB = (^[A5 : dB > $o]: (^[A3 : list_dB]: (((A3 = nil_dB)) | ((?[B3 : dB]: (?[L3 : list_dB]: (((A3 = (cons_dB @ B3 @ L3))) & ((((A5 @ B3)) & ((listsp_dB @ A5 @ L3)))))))))))))). % listsp.simps
thf(fact_126_listsp_Ocases, axiom,
    ((![A : dB > $o, A2 : list_dB]: ((listsp_dB @ A @ A2) => ((~ ((A2 = nil_dB))) => (~ ((![A4 : dB, L2 : list_dB]: ((A2 = (cons_dB @ A4 @ L2)) => ((A @ A4) => (~ ((listsp_dB @ A @ L2))))))))))))). % listsp.cases
thf(fact_127_not__Nil__step1, axiom,
    ((![R : dB > dB > $o, Xs2 : list_dB]: (~ ((step1_dB @ R @ nil_dB @ Xs2)))))). % not_Nil_step1
thf(fact_128_the__elem__set, axiom,
    ((![X5 : dB]: ((the_elem_dB @ (set_dB2 @ (cons_dB @ X5 @ nil_dB))) = X5)))). % the_elem_set
thf(fact_129_map__rec, axiom,
    ((map_dB_dB = (^[F3 : dB > dB]: (rec_list_list_dB_dB @ nil_dB @ (^[X : dB]: (^[Uu : list_dB]: (cons_dB @ (F3 @ X))))))))). % map_rec
thf(fact_130_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)))) => ((?[Ss3 : list_dB]: (((Ts = (append_dB @ Ss3 @ (cons_dB @ S @ nil_dB)))) & ((R = (foldl_dB_dB @ app @ T @ Ss3))))))))))))). % App_eq_foldl_conv
thf(fact_131_same__append__eq, axiom,
    ((![Xs2 : list_dB, Ys : list_dB, Zs3 : list_dB]: (((append_dB @ Xs2 @ Ys) = (append_dB @ Xs2 @ Zs3)) = (Ys = Zs3))))). % same_append_eq
thf(fact_132_append__same__eq, axiom,
    ((![Ys : list_dB, Xs2 : list_dB, Zs3 : list_dB]: (((append_dB @ Ys @ Xs2) = (append_dB @ Zs3 @ Xs2)) = (Ys = Zs3))))). % append_same_eq

% Conjectures (2)
thf(conj_0, hypothesis,
    ((listsp_dB @ (^[X : dB]: (((it @ X)) & ((![Y2 : nat]: (it @ (lift @ X @ Y2)))))) @ rs))).
thf(conj_1, conjecture,
    ((it @ (lift @ (foldl_dB_dB @ app @ (var @ n) @ rs) @ ia)))).
