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

% Could-be-implicit typings (7)
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__List__Olist_It__Nat__Onat_J, type,
    list_nat : $tType).
thf(ty_n_t__Set__Oset_It__Nat__Onat_J, type,
    set_nat : $tType).
thf(ty_n_t__Lambda__OdB, type,
    dB : $tType).
thf(ty_n_t__Nat__Onat, type,
    nat : $tType).
thf(ty_n_t__Int__Oint, type,
    int : $tType).

% Explicit typings (39)
thf(sy_c_Groups_Oplus__class_Oplus_001t__Int__Oint, type,
    plus_plus_int : int > int > int).
thf(sy_c_Groups_Oplus__class_Oplus_001t__Nat__Onat, type,
    plus_plus_nat : nat > nat > nat).
thf(sy_c_Groups_Ozero__class_Ozero_001t__Int__Oint, type,
    zero_zero_int : int).
thf(sy_c_Groups_Ozero__class_Ozero_001t__Nat__Onat, type,
    zero_zero_nat : nat).
thf(sy_c_If_001t__Nat__Onat, type,
    if_nat : $o > nat > nat > nat).
thf(sy_c_InductTermi_OIT, type,
    it : dB > $o).
thf(sy_c_Lambda_OdB_OAbs, type,
    abs : dB > dB).
thf(sy_c_Lambda_OdB_OApp, type,
    app : dB > dB > dB).
thf(sy_c_Lambda_OdB_OVar, type,
    var : nat > dB).
thf(sy_c_Lambda_OdB_Osize__dB, type,
    size_dB : dB > nat).
thf(sy_c_Lambda_Olift, type,
    lift : dB > nat > dB).
thf(sy_c_Lambda_Osubst, type,
    subst : dB > dB > nat > dB).
thf(sy_c_List_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_Ofoldl_001t__Lambda__OdB_001t__Nat__Onat, type,
    foldl_dB_nat : (dB > nat > dB) > dB > list_nat > dB).
thf(sy_c_List_Ofoldl_001t__Nat__Onat_001t__Lambda__OdB, type,
    foldl_nat_dB : (nat > dB > nat) > nat > list_dB > nat).
thf(sy_c_List_Ofoldl_001t__Nat__Onat_001t__Nat__Onat, type,
    foldl_nat_nat : (nat > nat > nat) > nat > list_nat > nat).
thf(sy_c_List_Ogen__length_001t__Lambda__OdB, type,
    gen_length_dB : nat > list_dB > nat).
thf(sy_c_List_Olist_ONil_001t__Lambda__OdB, type,
    nil_dB : list_dB).
thf(sy_c_List_Olist_ONil_001t__Nat__Onat, type,
    nil_nat : list_nat).
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_Omap_001t__Lambda__OdB_001t__Nat__Onat, type,
    map_dB_nat : (dB > nat) > list_dB > list_nat).
thf(sy_c_List_Olist_Omap_001t__Nat__Onat_001t__Nat__Onat, type,
    map_nat_nat : (nat > nat) > list_nat > list_nat).
thf(sy_c_List_Olist_Oset_001t__Lambda__OdB, type,
    set_dB2 : list_dB > set_dB).
thf(sy_c_List_Olist_Oset_001t__Nat__Onat, type,
    set_nat2 : list_nat > set_nat).
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_Omap__tailrec_001t__Lambda__OdB_001t__Nat__Onat, type,
    map_tailrec_dB_nat : (dB > nat) > list_dB > list_nat).
thf(sy_c_Nat_Osemiring__1__class_Oof__nat_001t__Int__Oint, type,
    semiri2019852685at_int : nat > int).
thf(sy_c_Nat_Osemiring__1__class_Oof__nat_001t__Nat__Onat, type,
    semiri1382578993at_nat : nat > nat).
thf(sy_c_Nat_Osize__class_Osize_001t__Lambda__OdB, type,
    size_size_dB : dB > 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_Nat_Osize__class_Osize_001t__List__Olist_It__Nat__Onat_J, type,
    size_size_list_nat : list_nat > nat).
thf(sy_c_Orderings_Oord__class_Oless_001t__Int__Oint, type,
    ord_less_int : int > int > $o).
thf(sy_c_Orderings_Oord__class_Oless_001t__Nat__Onat, type,
    ord_less_nat : nat > nat > $o).
thf(sy_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_i, type,
    i : nat).
thf(sy_v_t, type,
    t : dB).

% Relevant facts (167)
thf(fact_0_Var__IT, axiom,
    ((![N : nat]: (it @ (var @ N))))). % Var_IT
thf(fact_1_dB_Oinject_I1_J, axiom,
    ((![X1 : nat, Y1 : nat]: (((var @ X1) = (var @ Y1)) = (X1 = Y1))))). % dB.inject(1)
thf(fact_2_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_3_dB_Odistinct_I1_J, axiom,
    ((![X1 : nat, X21 : dB, X22 : dB]: (~ (((var @ X1) = (app @ X21 @ X22))))))). % dB.distinct(1)
thf(fact_4_subst__Var__IT, axiom,
    ((![R : dB, I : nat, J : nat]: ((it @ R) => (it @ (subst @ R @ (var @ I) @ J)))))). % subst_Var_IT
thf(fact_5_lift__IT, axiom,
    ((![T : dB, I : nat]: ((it @ T) => (it @ (lift @ T @ I)))))). % lift_IT
thf(fact_6_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_7_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_8_dB_Oexhaust, axiom,
    ((![Y : dB]: ((![X12 : nat]: (~ ((Y = (var @ X12))))) => ((![X212 : dB, X222 : dB]: (~ ((Y = (app @ X212 @ X222))))) => (~ ((![X3 : dB]: (~ ((Y = (abs @ X3)))))))))))). % dB.exhaust
thf(fact_9_IT_OVar, axiom,
    ((![Rs : list_dB, N : nat]: ((listsp_dB @ it @ Rs) => (it @ (foldl_dB_dB @ app @ (var @ N) @ Rs)))))). % IT.Var
thf(fact_10_dB_Oinject_I3_J, axiom,
    ((![X32 : dB, Y3 : dB]: (((abs @ X32) = (abs @ Y3)) = (X32 = Y3))))). % dB.inject(3)
thf(fact_11_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_12_subst__eq, axiom,
    ((![K : nat, U : dB]: ((subst @ (var @ K) @ U @ K) = U)))). % subst_eq
thf(fact_13_subst__lift, axiom,
    ((![T : dB, K : nat, S : dB]: ((subst @ (lift @ T @ K) @ S @ K) = T)))). % subst_lift
thf(fact_14_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_15_dB_Odistinct_I5_J, axiom,
    ((![X21 : dB, X22 : dB, X32 : dB]: (~ (((app @ X21 @ X22) = (abs @ X32))))))). % dB.distinct(5)
thf(fact_16_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_17_dB_Odistinct_I3_J, axiom,
    ((![X1 : nat, X32 : dB]: (~ (((var @ X1) = (abs @ X32))))))). % dB.distinct(3)
thf(fact_18_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_19_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_20_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_21_Lambda, axiom,
    ((![R : dB]: ((it @ R) => (it @ (abs @ R)))))). % Lambda
thf(fact_22_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_23_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]: (?[S2 : dB]: (?[Ss2 : list_dB]: (((A = (foldl_dB_dB @ app @ (app @ (abs @ R2) @ S2) @ Ss2))) & ((((it @ (foldl_dB_dB @ app @ (subst @ R2 @ S2 @ zero_zero_nat) @ Ss2))) & ((it @ S2)))))))))))))))). % IT.simps
thf(fact_24_IT_Ocases, axiom,
    ((![A2 : dB]: ((it @ A2) => ((![Rs3 : list_dB]: ((?[N2 : nat]: (A2 = (foldl_dB_dB @ app @ (var @ N2) @ Rs3))) => (~ ((listsp_dB @ it @ Rs3))))) => ((![R3 : dB]: ((A2 = (abs @ R3)) => (~ ((it @ R3))))) => (~ ((![R3 : dB, S3 : dB, Ss3 : list_dB]: ((A2 = (foldl_dB_dB @ app @ (app @ (abs @ R3) @ S3) @ Ss3)) => ((it @ (foldl_dB_dB @ app @ (subst @ R3 @ S3 @ zero_zero_nat) @ Ss3)) => (~ ((it @ S3)))))))))))))). % IT.cases
thf(fact_25_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_26_Apps__dB__induct, axiom,
    ((![P : dB > $o, T : dB]: ((![N2 : nat, Ts2 : list_dB]: ((![X4 : dB]: ((member_dB @ X4 @ (set_dB2 @ Ts2)) => (P @ X4))) => (P @ (foldl_dB_dB @ app @ (var @ N2) @ Ts2)))) => ((![U2 : dB]: ((P @ U2) => (![Ts2 : list_dB]: ((![X4 : dB]: ((member_dB @ X4 @ (set_dB2 @ Ts2)) => (P @ X4))) => (P @ (foldl_dB_dB @ app @ (abs @ U2) @ Ts2)))))) => (P @ T)))))). % Apps_dB_induct
thf(fact_27_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_28_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_29_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_30_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_31_lem, axiom,
    ((![P : dB > $o, T : dB, N : nat]: ((![N2 : nat, Ts2 : list_dB]: ((![X4 : dB]: ((member_dB @ X4 @ (set_dB2 @ Ts2)) => (P @ X4))) => (P @ (foldl_dB_dB @ app @ (var @ N2) @ Ts2)))) => ((![U2 : dB]: ((P @ U2) => (![Ts2 : list_dB]: ((![X4 : dB]: ((member_dB @ X4 @ (set_dB2 @ Ts2)) => (P @ X4))) => (P @ (foldl_dB_dB @ app @ (abs @ U2) @ Ts2)))))) => (((size_size_dB @ T) = N) => (P @ T))))))). % lem
thf(fact_32_IT_Oinducts, axiom,
    ((![X5 : dB, P : dB > $o]: ((it @ X5) => ((![Rs3 : list_dB, N2 : nat]: ((listsp_dB @ (^[X6 : dB]: (((it @ X6)) & ((P @ X6)))) @ Rs3) => (P @ (foldl_dB_dB @ app @ (var @ N2) @ Rs3)))) => ((![R3 : dB]: ((it @ R3) => ((P @ R3) => (P @ (abs @ R3))))) => ((![R3 : dB, S3 : dB, Ss3 : list_dB]: ((it @ (foldl_dB_dB @ app @ (subst @ R3 @ S3 @ zero_zero_nat) @ Ss3)) => ((P @ (foldl_dB_dB @ app @ (subst @ R3 @ S3 @ zero_zero_nat) @ Ss3)) => ((it @ S3) => ((P @ S3) => (P @ (foldl_dB_dB @ app @ (app @ (abs @ R3) @ S3) @ Ss3))))))) => (P @ X5)))))))). % IT.inducts
thf(fact_33_dB_Osize_I4_J, axiom,
    ((![X1 : nat]: ((size_size_dB @ (var @ X1)) = zero_zero_nat)))). % dB.size(4)
thf(fact_34_in__listspI, axiom,
    ((![Xs : list_dB, A3 : dB > $o]: ((![X : dB]: ((member_dB @ X @ (set_dB2 @ Xs)) => (A3 @ X))) => (listsp_dB @ A3 @ Xs))))). % in_listspI
thf(fact_35_listsp__simps_I1_J, axiom,
    ((![A3 : dB > $o]: (listsp_dB @ A3 @ nil_dB)))). % listsp_simps(1)
thf(fact_36_bot__nat__0_Onot__eq__extremum, axiom,
    ((![A2 : nat]: ((~ ((A2 = zero_zero_nat))) = (ord_less_nat @ zero_zero_nat @ A2))))). % bot_nat_0.not_eq_extremum
thf(fact_37_less__nat__zero__code, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % less_nat_zero_code
thf(fact_38_neq0__conv, axiom,
    ((![N : nat]: ((~ ((N = zero_zero_nat))) = (ord_less_nat @ zero_zero_nat @ N))))). % neq0_conv
thf(fact_39_not__gr__zero, axiom,
    ((![N : nat]: ((~ ((ord_less_nat @ zero_zero_nat @ N))) = (N = zero_zero_nat))))). % not_gr_zero
thf(fact_40_listsp__conj__eq, axiom,
    ((![A3 : dB > $o, B : dB > $o]: ((listsp_dB @ (^[X6 : dB]: (((A3 @ X6)) & ((B @ X6))))) = (^[X6 : list_dB]: (((listsp_dB @ A3 @ X6)) & ((listsp_dB @ B @ X6)))))))). % listsp_conj_eq
thf(fact_41_zero__reorient, axiom,
    ((![X5 : nat]: ((zero_zero_nat = X5) = (X5 = zero_zero_nat))))). % zero_reorient
thf(fact_42_zero__reorient, axiom,
    ((![X5 : int]: ((zero_zero_int = X5) = (X5 = zero_zero_int))))). % zero_reorient
thf(fact_43_nat__neq__iff, axiom,
    ((![M : nat, N : nat]: ((~ ((M = N))) = (((ord_less_nat @ M @ N)) | ((ord_less_nat @ N @ M))))))). % nat_neq_iff
thf(fact_44_less__not__refl, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ N)))))). % less_not_refl
thf(fact_45_less__not__refl2, axiom,
    ((![N : nat, M : nat]: ((ord_less_nat @ N @ M) => (~ ((M = N))))))). % less_not_refl2
thf(fact_46_less__not__refl3, axiom,
    ((![S : nat, T : nat]: ((ord_less_nat @ S @ T) => (~ ((S = T))))))). % less_not_refl3
thf(fact_47_less__irrefl__nat, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ N)))))). % less_irrefl_nat
thf(fact_48_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_49_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_50_linorder__neqE__nat, axiom,
    ((![X5 : nat, Y : nat]: ((~ ((X5 = Y))) => ((~ ((ord_less_nat @ X5 @ Y))) => (ord_less_nat @ Y @ X5)))))). % linorder_neqE_nat
thf(fact_51_size__neq__size__imp__neq, axiom,
    ((![X5 : dB, Y : dB]: ((~ (((size_size_dB @ X5) = (size_size_dB @ Y)))) => (~ ((X5 = Y))))))). % size_neq_size_imp_neq
thf(fact_52_size__neq__size__imp__neq, axiom,
    ((![X5 : list_dB, Y : list_dB]: ((~ (((size_size_list_dB @ X5) = (size_size_list_dB @ Y)))) => (~ ((X5 = Y))))))). % size_neq_size_imp_neq
thf(fact_53_gr__zeroI, axiom,
    ((![N : nat]: ((~ ((N = zero_zero_nat))) => (ord_less_nat @ zero_zero_nat @ N))))). % gr_zeroI
thf(fact_54_not__less__zero, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % not_less_zero
thf(fact_55_gr__implies__not__zero, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (~ ((N = zero_zero_nat))))))). % gr_implies_not_zero
thf(fact_56_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_57_gr0I, axiom,
    ((![N : nat]: ((~ ((N = zero_zero_nat))) => (ord_less_nat @ zero_zero_nat @ N))))). % gr0I
thf(fact_58_not__gr0, axiom,
    ((![N : nat]: ((~ ((ord_less_nat @ zero_zero_nat @ N))) = (N = zero_zero_nat))))). % not_gr0
thf(fact_59_not__less0, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % not_less0
thf(fact_60_less__zeroE, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % less_zeroE
thf(fact_61_gr__implies__not0, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (~ ((N = zero_zero_nat))))))). % gr_implies_not0
thf(fact_62_infinite__descent0, axiom,
    ((![P : nat > $o, N : nat]: ((P @ zero_zero_nat) => ((![N2 : nat]: ((ord_less_nat @ zero_zero_nat @ N2) => ((~ ((P @ N2))) => (?[M2 : nat]: ((ord_less_nat @ M2 @ N2) & (~ ((P @ M2)))))))) => (P @ N)))))). % infinite_descent0
thf(fact_63_bot__nat__0_Oextremum__strict, axiom,
    ((![A2 : nat]: (~ ((ord_less_nat @ A2 @ zero_zero_nat)))))). % bot_nat_0.extremum_strict
thf(fact_64_foldl__Nil, axiom,
    ((![F : nat > nat > nat, A2 : nat]: ((foldl_nat_nat @ F @ A2 @ nil_nat) = A2)))). % foldl_Nil
thf(fact_65_foldl__Nil, axiom,
    ((![F : dB > dB > dB, A2 : dB]: ((foldl_dB_dB @ F @ A2 @ nil_dB) = A2)))). % foldl_Nil
thf(fact_66_foldl__cong, axiom,
    ((![A2 : nat, B2 : nat, L : list_nat, K : list_nat, F : nat > nat > nat, G : nat > nat > nat]: ((A2 = B2) => ((L = K) => ((![A4 : nat, X : nat]: ((member_nat @ X @ (set_nat2 @ L)) => ((F @ A4 @ X) = (G @ A4 @ X)))) => ((foldl_nat_nat @ F @ A2 @ L) = (foldl_nat_nat @ G @ B2 @ K)))))))). % foldl_cong
thf(fact_67_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, X : dB]: ((member_dB @ X @ (set_dB2 @ L)) => ((F @ A4 @ X) = (G @ A4 @ X)))) => ((foldl_dB_dB @ F @ A2 @ L) = (foldl_dB_dB @ G @ B2 @ K)))))))). % foldl_cong
thf(fact_68_listsp_ONil, axiom,
    ((![A3 : dB > $o]: (listsp_dB @ A3 @ nil_dB)))). % listsp.Nil
thf(fact_69_in__listspD, axiom,
    ((![A3 : dB > $o, Xs : list_dB]: ((listsp_dB @ A3 @ Xs) => (![X4 : dB]: ((member_dB @ X4 @ (set_dB2 @ Xs)) => (A3 @ X4))))))). % in_listspD
thf(fact_70_in__listsp__conv__set, axiom,
    ((listsp_dB = (^[A5 : dB > $o]: (^[Xs2 : list_dB]: (![X6 : dB]: (((member_dB @ X6 @ (set_dB2 @ Xs2))) => ((A5 @ X6))))))))). % in_listsp_conv_set
thf(fact_71_less__numeral__extra_I3_J, axiom,
    ((~ ((ord_less_nat @ zero_zero_nat @ zero_zero_nat))))). % less_numeral_extra(3)
thf(fact_72_less__numeral__extra_I3_J, axiom,
    ((~ ((ord_less_int @ zero_zero_int @ zero_zero_int))))). % less_numeral_extra(3)
thf(fact_73_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_74_dB_Osize__gen_I1_J, axiom,
    ((![X1 : nat]: ((size_dB @ (var @ X1)) = zero_zero_nat)))). % dB.size_gen(1)
thf(fact_75_lifts__IT, axiom,
    ((![Ts : list_dB]: ((listsp_dB @ it @ Ts) => (listsp_dB @ it @ (map_dB_dB @ (^[T2 : dB]: (lift @ T2 @ zero_zero_nat)) @ Ts)))))). % lifts_IT
thf(fact_76_of__nat__0__less__iff, axiom,
    ((![N : nat]: ((ord_less_nat @ zero_zero_nat @ (semiri1382578993at_nat @ N)) = (ord_less_nat @ zero_zero_nat @ N))))). % of_nat_0_less_iff
thf(fact_77_of__nat__0__less__iff, axiom,
    ((![N : nat]: ((ord_less_int @ zero_zero_int @ (semiri2019852685at_int @ N)) = (ord_less_nat @ zero_zero_nat @ N))))). % of_nat_0_less_iff
thf(fact_78_of__nat__eq__iff, axiom,
    ((![M : nat, N : nat]: (((semiri2019852685at_int @ M) = (semiri2019852685at_int @ N)) = (M = N))))). % of_nat_eq_iff
thf(fact_79_length__map, axiom,
    ((![F : dB > nat, Xs : list_dB]: ((size_size_list_nat @ (map_dB_nat @ F @ Xs)) = (size_size_list_dB @ Xs))))). % length_map
thf(fact_80_length__map, axiom,
    ((![F : dB > dB, Xs : list_dB]: ((size_size_list_dB @ (map_dB_dB @ F @ Xs)) = (size_size_list_dB @ Xs))))). % length_map
thf(fact_81_map__ident, axiom,
    (((map_dB_dB @ (^[X6 : dB]: X6)) = (^[Xs2 : list_dB]: Xs2)))). % map_ident
thf(fact_82_length__0__conv, axiom,
    ((![Xs : list_dB]: (((size_size_list_dB @ Xs) = zero_zero_nat) = (Xs = nil_dB))))). % length_0_conv
thf(fact_83_Nil__is__map__conv, axiom,
    ((![F : dB > dB, Xs : list_dB]: ((nil_dB = (map_dB_dB @ F @ Xs)) = (Xs = nil_dB))))). % Nil_is_map_conv
thf(fact_84_Nil__is__map__conv, axiom,
    ((![F : dB > nat, Xs : list_dB]: ((nil_nat = (map_dB_nat @ F @ Xs)) = (Xs = nil_dB))))). % Nil_is_map_conv
thf(fact_85_map__is__Nil__conv, axiom,
    ((![F : dB > dB, Xs : list_dB]: (((map_dB_dB @ F @ Xs) = nil_dB) = (Xs = nil_dB))))). % map_is_Nil_conv
thf(fact_86_map__is__Nil__conv, axiom,
    ((![F : dB > nat, Xs : list_dB]: (((map_dB_nat @ F @ Xs) = nil_nat) = (Xs = nil_dB))))). % map_is_Nil_conv
thf(fact_87_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_88_list_Omap__disc__iff, axiom,
    ((![F : dB > nat, A2 : list_dB]: (((map_dB_nat @ F @ A2) = nil_nat) = (A2 = nil_dB))))). % list.map_disc_iff
thf(fact_89_map__eq__conv, axiom,
    ((![F : dB > dB, Xs : list_dB, G : dB > dB]: (((map_dB_dB @ F @ Xs) = (map_dB_dB @ G @ Xs)) = (![X6 : dB]: (((member_dB @ X6 @ (set_dB2 @ Xs))) => (((F @ X6) = (G @ X6))))))))). % map_eq_conv
thf(fact_90_map__eq__conv, axiom,
    ((![F : dB > nat, Xs : list_dB, G : dB > nat]: (((map_dB_nat @ F @ Xs) = (map_dB_nat @ G @ Xs)) = (![X6 : dB]: (((member_dB @ X6 @ (set_dB2 @ Xs))) => (((F @ X6) = (G @ X6))))))))). % map_eq_conv
thf(fact_91_of__nat__eq__0__iff, axiom,
    ((![M : nat]: (((semiri1382578993at_nat @ M) = zero_zero_nat) = (M = zero_zero_nat))))). % of_nat_eq_0_iff
thf(fact_92_of__nat__eq__0__iff, axiom,
    ((![M : nat]: (((semiri2019852685at_int @ M) = zero_zero_int) = (M = zero_zero_nat))))). % of_nat_eq_0_iff
thf(fact_93_of__nat__0__eq__iff, axiom,
    ((![N : nat]: ((zero_zero_nat = (semiri1382578993at_nat @ N)) = (zero_zero_nat = N))))). % of_nat_0_eq_iff
thf(fact_94_of__nat__0__eq__iff, axiom,
    ((![N : nat]: ((zero_zero_int = (semiri2019852685at_int @ N)) = (zero_zero_nat = N))))). % of_nat_0_eq_iff
thf(fact_95_of__nat__0, axiom,
    (((semiri1382578993at_nat @ zero_zero_nat) = zero_zero_nat))). % of_nat_0
thf(fact_96_of__nat__0, axiom,
    (((semiri2019852685at_int @ zero_zero_nat) = zero_zero_int))). % of_nat_0
thf(fact_97_of__nat__less__iff, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ (semiri1382578993at_nat @ M) @ (semiri1382578993at_nat @ N)) = (ord_less_nat @ M @ N))))). % of_nat_less_iff
thf(fact_98_of__nat__less__iff, axiom,
    ((![M : nat, N : nat]: ((ord_less_int @ (semiri2019852685at_int @ M) @ (semiri2019852685at_int @ N)) = (ord_less_nat @ M @ N))))). % of_nat_less_iff
thf(fact_99_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_100_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 @ (^[T2 : dB]: (subst @ T2 @ U @ I)) @ Ts)))))). % subst_map
thf(fact_101_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_102_map__eq__imp__length__eq, axiom,
    ((![F : dB > dB, Xs : list_dB, G : dB > dB, Ys : list_dB]: (((map_dB_dB @ F @ Xs) = (map_dB_dB @ G @ Ys)) => ((size_size_list_dB @ Xs) = (size_size_list_dB @ Ys)))))). % map_eq_imp_length_eq
thf(fact_103_map__eq__imp__length__eq, axiom,
    ((![F : dB > nat, Xs : list_dB, G : dB > nat, Ys : list_dB]: (((map_dB_nat @ F @ Xs) = (map_dB_nat @ G @ Ys)) => ((size_size_list_dB @ Xs) = (size_size_list_dB @ Ys)))))). % map_eq_imp_length_eq
thf(fact_104_list_Omap__ident, axiom,
    ((![T : list_dB]: ((map_dB_dB @ (^[X6 : dB]: X6) @ T) = T)))). % list.map_ident
thf(fact_105_list_Osimps_I8_J, axiom,
    ((![F : dB > dB]: ((map_dB_dB @ F @ nil_dB) = nil_dB)))). % list.simps(8)
thf(fact_106_list_Osimps_I8_J, axiom,
    ((![F : dB > nat]: ((map_dB_nat @ F @ nil_dB) = nil_nat)))). % list.simps(8)
thf(fact_107_map__ext, axiom,
    ((![Xs : list_dB, F : dB > dB, G : dB > dB]: ((![X : dB]: ((member_dB @ X @ (set_dB2 @ Xs)) => ((F @ X) = (G @ X)))) => ((map_dB_dB @ F @ Xs) = (map_dB_dB @ G @ Xs)))))). % map_ext
thf(fact_108_map__ext, axiom,
    ((![Xs : list_dB, F : dB > nat, G : dB > nat]: ((![X : dB]: ((member_dB @ X @ (set_dB2 @ Xs)) => ((F @ X) = (G @ X)))) => ((map_dB_nat @ F @ Xs) = (map_dB_nat @ G @ Xs)))))). % map_ext
thf(fact_109_map__idI, axiom,
    ((![Xs : list_dB, F : dB > dB]: ((![X : dB]: ((member_dB @ X @ (set_dB2 @ Xs)) => ((F @ X) = X))) => ((map_dB_dB @ F @ Xs) = Xs))))). % map_idI
thf(fact_110_map__cong, axiom,
    ((![Xs : list_dB, Ys : list_dB, F : dB > dB, G : dB > dB]: ((Xs = Ys) => ((![X : dB]: ((member_dB @ X @ (set_dB2 @ Ys)) => ((F @ X) = (G @ X)))) => ((map_dB_dB @ F @ Xs) = (map_dB_dB @ G @ Ys))))))). % map_cong
thf(fact_111_map__cong, axiom,
    ((![Xs : list_dB, Ys : list_dB, F : dB > nat, G : dB > nat]: ((Xs = Ys) => ((![X : dB]: ((member_dB @ X @ (set_dB2 @ Ys)) => ((F @ X) = (G @ X)))) => ((map_dB_nat @ F @ Xs) = (map_dB_nat @ G @ Ys))))))). % map_cong
thf(fact_112_ex__map__conv, axiom,
    ((![Ys : list_nat, F : dB > nat]: ((?[Xs2 : list_dB]: (Ys = (map_dB_nat @ F @ Xs2))) = (![X6 : nat]: (((member_nat @ X6 @ (set_nat2 @ Ys))) => ((?[Y2 : dB]: (X6 = (F @ Y2)))))))))). % ex_map_conv
thf(fact_113_ex__map__conv, axiom,
    ((![Ys : list_dB, F : dB > dB]: ((?[Xs2 : list_dB]: (Ys = (map_dB_dB @ F @ Xs2))) = (![X6 : dB]: (((member_dB @ X6 @ (set_dB2 @ Ys))) => ((?[Y2 : dB]: (X6 = (F @ Y2)))))))))). % ex_map_conv
thf(fact_114_list_Omap__cong, axiom,
    ((![X5 : list_dB, Ya : list_dB, F : dB > dB, G : dB > dB]: ((X5 = Ya) => ((![Z : dB]: ((member_dB @ Z @ (set_dB2 @ Ya)) => ((F @ Z) = (G @ Z)))) => ((map_dB_dB @ F @ X5) = (map_dB_dB @ G @ Ya))))))). % list.map_cong
thf(fact_115_list_Omap__cong, axiom,
    ((![X5 : list_dB, Ya : list_dB, F : dB > nat, G : dB > nat]: ((X5 = Ya) => ((![Z : dB]: ((member_dB @ Z @ (set_dB2 @ Ya)) => ((F @ Z) = (G @ Z)))) => ((map_dB_nat @ F @ X5) = (map_dB_nat @ G @ Ya))))))). % list.map_cong
thf(fact_116_list_Omap__cong0, axiom,
    ((![X5 : list_dB, F : dB > dB, G : dB > dB]: ((![Z : dB]: ((member_dB @ Z @ (set_dB2 @ X5)) => ((F @ Z) = (G @ Z)))) => ((map_dB_dB @ F @ X5) = (map_dB_dB @ G @ X5)))))). % list.map_cong0
thf(fact_117_list_Omap__cong0, axiom,
    ((![X5 : list_dB, F : dB > nat, G : dB > nat]: ((![Z : dB]: ((member_dB @ Z @ (set_dB2 @ X5)) => ((F @ Z) = (G @ Z)))) => ((map_dB_nat @ F @ X5) = (map_dB_nat @ G @ X5)))))). % list.map_cong0
thf(fact_118_list_Oinj__map__strong, axiom,
    ((![X5 : list_dB, Xa : list_dB, F : dB > dB, Fa : dB > dB]: ((![Z : dB, Za : dB]: ((member_dB @ Z @ (set_dB2 @ X5)) => ((member_dB @ 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_119_list_Oinj__map__strong, axiom,
    ((![X5 : list_dB, Xa : list_dB, F : dB > nat, Fa : dB > nat]: ((![Z : dB, Za : dB]: ((member_dB @ Z @ (set_dB2 @ X5)) => ((member_dB @ Za @ (set_dB2 @ Xa)) => (((F @ Z) = (Fa @ Za)) => (Z = Za))))) => (((map_dB_nat @ F @ X5) = (map_dB_nat @ Fa @ Xa)) => (X5 = Xa)))))). % list.inj_map_strong
thf(fact_120_length__induct, axiom,
    ((![P : list_dB > $o, Xs : list_dB]: ((![Xs3 : list_dB]: ((![Ys2 : list_dB]: ((ord_less_nat @ (size_size_list_dB @ Ys2) @ (size_size_list_dB @ Xs3)) => (P @ Ys2))) => (P @ Xs3))) => (P @ Xs))))). % length_induct
thf(fact_121_foldl__map, axiom,
    ((![G : nat > nat > nat, A2 : nat, F : nat > nat, Xs : list_nat]: ((foldl_nat_nat @ G @ A2 @ (map_nat_nat @ F @ Xs)) = (foldl_nat_nat @ (^[A : nat]: (^[X6 : nat]: (G @ A @ (F @ X6)))) @ A2 @ Xs))))). % foldl_map
thf(fact_122_foldl__map, axiom,
    ((![G : dB > dB > dB, A2 : dB, F : dB > dB, Xs : list_dB]: ((foldl_dB_dB @ G @ A2 @ (map_dB_dB @ F @ Xs)) = (foldl_dB_dB @ (^[A : dB]: (^[X6 : dB]: (G @ A @ (F @ X6)))) @ A2 @ Xs))))). % foldl_map
thf(fact_123_foldl__map, axiom,
    ((![G : dB > nat > dB, A2 : dB, F : dB > nat, Xs : list_dB]: ((foldl_dB_nat @ G @ A2 @ (map_dB_nat @ F @ Xs)) = (foldl_dB_dB @ (^[A : dB]: (^[X6 : dB]: (G @ A @ (F @ X6)))) @ A2 @ Xs))))). % foldl_map
thf(fact_124_foldl__map, axiom,
    ((![G : nat > nat > nat, A2 : nat, F : dB > nat, Xs : list_dB]: ((foldl_nat_nat @ G @ A2 @ (map_dB_nat @ F @ Xs)) = (foldl_nat_dB @ (^[A : nat]: (^[X6 : dB]: (G @ A @ (F @ X6)))) @ A2 @ Xs))))). % foldl_map
thf(fact_125_of__nat__less__0__iff, axiom,
    ((![M : nat]: (~ ((ord_less_nat @ (semiri1382578993at_nat @ M) @ zero_zero_nat)))))). % of_nat_less_0_iff
thf(fact_126_of__nat__less__0__iff, axiom,
    ((![M : nat]: (~ ((ord_less_int @ (semiri2019852685at_int @ M) @ zero_zero_int)))))). % of_nat_less_0_iff
thf(fact_127_of__nat__less__imp__less, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ (semiri1382578993at_nat @ M) @ (semiri1382578993at_nat @ N)) => (ord_less_nat @ M @ N))))). % of_nat_less_imp_less
thf(fact_128_of__nat__less__imp__less, axiom,
    ((![M : nat, N : nat]: ((ord_less_int @ (semiri2019852685at_int @ M) @ (semiri2019852685at_int @ N)) => (ord_less_nat @ M @ N))))). % of_nat_less_imp_less
thf(fact_129_less__imp__of__nat__less, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (ord_less_nat @ (semiri1382578993at_nat @ M) @ (semiri1382578993at_nat @ N)))))). % less_imp_of_nat_less
thf(fact_130_less__imp__of__nat__less, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (ord_less_int @ (semiri2019852685at_int @ M) @ (semiri2019852685at_int @ N)))))). % less_imp_of_nat_less
thf(fact_131_list_Osize_I3_J, axiom,
    (((size_size_list_dB @ nil_dB) = zero_zero_nat))). % list.size(3)
thf(fact_132_length__pos__if__in__set, axiom,
    ((![X5 : dB, Xs : list_dB]: ((member_dB @ X5 @ (set_dB2 @ Xs)) => (ord_less_nat @ zero_zero_nat @ (size_size_list_dB @ Xs)))))). % length_pos_if_in_set
thf(fact_133_count__list_Osimps_I1_J, axiom,
    ((![Y : dB]: ((count_list_dB @ nil_dB @ Y) = zero_zero_nat)))). % count_list.simps(1)
thf(fact_134_pos__int__cases, axiom,
    ((![K : int]: ((ord_less_int @ zero_zero_int @ K) => (~ ((![N2 : nat]: ((K = (semiri2019852685at_int @ N2)) => (~ ((ord_less_nat @ zero_zero_nat @ N2))))))))))). % pos_int_cases
thf(fact_135_zero__less__imp__eq__int, axiom,
    ((![K : int]: ((ord_less_int @ zero_zero_int @ K) => (?[N2 : nat]: ((ord_less_nat @ zero_zero_nat @ N2) & (K = (semiri2019852685at_int @ N2)))))))). % zero_less_imp_eq_int
thf(fact_136_map__eq__map__tailrec, axiom,
    ((map_dB_dB = map_tailrec_dB_dB))). % map_eq_map_tailrec
thf(fact_137_map__eq__map__tailrec, axiom,
    ((map_dB_nat = map_tailrec_dB_nat))). % map_eq_map_tailrec
thf(fact_138_neq__if__length__neq, axiom,
    ((![Xs : list_dB, Ys : list_dB]: ((~ (((size_size_list_dB @ Xs) = (size_size_list_dB @ Ys)))) => (~ ((Xs = Ys))))))). % neq_if_length_neq
thf(fact_139_Ex__list__of__length, axiom,
    ((![N : nat]: (?[Xs3 : list_dB]: ((size_size_list_dB @ Xs3) = N))))). % Ex_list_of_length
thf(fact_140_int__int__eq, axiom,
    ((![M : nat, N : nat]: (((semiri2019852685at_int @ M) = (semiri2019852685at_int @ N)) = (M = N))))). % int_int_eq
thf(fact_141_less__int__code_I1_J, axiom,
    ((~ ((ord_less_int @ zero_zero_int @ zero_zero_int))))). % less_int_code(1)
thf(fact_142_nat__less__as__int, axiom,
    ((ord_less_nat = (^[A : nat]: (^[B3 : nat]: (ord_less_int @ (semiri2019852685at_int @ A) @ (semiri2019852685at_int @ B3))))))). % nat_less_as_int
thf(fact_143_nat__int__comparison_I2_J, axiom,
    ((ord_less_nat = (^[A : nat]: (^[B3 : nat]: (ord_less_int @ (semiri2019852685at_int @ A) @ (semiri2019852685at_int @ B3))))))). % nat_int_comparison(2)
thf(fact_144_verit__comp__simplify1_I1_J, axiom,
    ((![A2 : nat]: (~ ((ord_less_nat @ A2 @ A2)))))). % verit_comp_simplify1(1)
thf(fact_145_verit__comp__simplify1_I1_J, axiom,
    ((![A2 : int]: (~ ((ord_less_int @ A2 @ A2)))))). % verit_comp_simplify1(1)
thf(fact_146_nat__int__comparison_I1_J, axiom,
    (((^[Y4 : nat]: (^[Z2 : nat]: (Y4 = Z2))) = (^[A : nat]: (^[B3 : nat]: ((semiri2019852685at_int @ A) = (semiri2019852685at_int @ B3))))))). % nat_int_comparison(1)
thf(fact_147_int__if, axiom,
    ((![P : $o, A2 : nat, B2 : nat]: ((P => ((semiri2019852685at_int @ (if_nat @ P @ A2 @ B2)) = (semiri2019852685at_int @ A2))) & ((~ (P)) => ((semiri2019852685at_int @ (if_nat @ P @ A2 @ B2)) = (semiri2019852685at_int @ B2))))))). % int_if
thf(fact_148_int__ops_I1_J, axiom,
    (((semiri2019852685at_int @ zero_zero_nat) = zero_zero_int))). % int_ops(1)
thf(fact_149_size__apps, axiom,
    ((![R : dB, Rs : list_dB]: ((size_size_dB @ (foldl_dB_dB @ app @ R @ Rs)) = (plus_plus_nat @ (plus_plus_nat @ (size_size_dB @ R) @ (foldl_nat_nat @ plus_plus_nat @ zero_zero_nat @ (map_dB_nat @ size_size_dB @ Rs))) @ (size_size_list_dB @ Rs)))))). % size_apps
thf(fact_150_length__code, axiom,
    ((size_size_list_dB = (gen_length_dB @ zero_zero_nat)))). % length_code
thf(fact_151_add__right__cancel, axiom,
    ((![B2 : nat, A2 : nat, C : nat]: (((plus_plus_nat @ B2 @ A2) = (plus_plus_nat @ C @ A2)) = (B2 = C))))). % add_right_cancel
thf(fact_152_add__left__cancel, axiom,
    ((![A2 : nat, B2 : nat, C : nat]: (((plus_plus_nat @ A2 @ B2) = (plus_plus_nat @ A2 @ C)) = (B2 = C))))). % add_left_cancel
thf(fact_153_zero__eq__add__iff__both__eq__0, axiom,
    ((![X5 : nat, Y : nat]: ((zero_zero_nat = (plus_plus_nat @ X5 @ Y)) = (((X5 = zero_zero_nat)) & ((Y = zero_zero_nat))))))). % zero_eq_add_iff_both_eq_0
thf(fact_154_add__eq__0__iff__both__eq__0, axiom,
    ((![X5 : nat, Y : nat]: (((plus_plus_nat @ X5 @ Y) = zero_zero_nat) = (((X5 = zero_zero_nat)) & ((Y = zero_zero_nat))))))). % add_eq_0_iff_both_eq_0
thf(fact_155_add__cancel__right__right, axiom,
    ((![A2 : nat, B2 : nat]: ((A2 = (plus_plus_nat @ A2 @ B2)) = (B2 = zero_zero_nat))))). % add_cancel_right_right
thf(fact_156_add__cancel__right__right, axiom,
    ((![A2 : int, B2 : int]: ((A2 = (plus_plus_int @ A2 @ B2)) = (B2 = zero_zero_int))))). % add_cancel_right_right
thf(fact_157_add__cancel__right__left, axiom,
    ((![A2 : nat, B2 : nat]: ((A2 = (plus_plus_nat @ B2 @ A2)) = (B2 = zero_zero_nat))))). % add_cancel_right_left
thf(fact_158_add__cancel__right__left, axiom,
    ((![A2 : int, B2 : int]: ((A2 = (plus_plus_int @ B2 @ A2)) = (B2 = zero_zero_int))))). % add_cancel_right_left
thf(fact_159_add__cancel__left__right, axiom,
    ((![A2 : nat, B2 : nat]: (((plus_plus_nat @ A2 @ B2) = A2) = (B2 = zero_zero_nat))))). % add_cancel_left_right
thf(fact_160_add__cancel__left__right, axiom,
    ((![A2 : int, B2 : int]: (((plus_plus_int @ A2 @ B2) = A2) = (B2 = zero_zero_int))))). % add_cancel_left_right
thf(fact_161_add__cancel__left__left, axiom,
    ((![B2 : nat, A2 : nat]: (((plus_plus_nat @ B2 @ A2) = A2) = (B2 = zero_zero_nat))))). % add_cancel_left_left
thf(fact_162_add__cancel__left__left, axiom,
    ((![B2 : int, A2 : int]: (((plus_plus_int @ B2 @ A2) = A2) = (B2 = zero_zero_int))))). % add_cancel_left_left
thf(fact_163_double__zero__sym, axiom,
    ((![A2 : int]: ((zero_zero_int = (plus_plus_int @ A2 @ A2)) = (A2 = zero_zero_int))))). % double_zero_sym
thf(fact_164_double__zero, axiom,
    ((![A2 : int]: (((plus_plus_int @ A2 @ A2) = zero_zero_int) = (A2 = zero_zero_int))))). % double_zero
thf(fact_165_add_Oright__neutral, axiom,
    ((![A2 : nat]: ((plus_plus_nat @ A2 @ zero_zero_nat) = A2)))). % add.right_neutral
thf(fact_166_add_Oright__neutral, axiom,
    ((![A2 : int]: ((plus_plus_int @ A2 @ zero_zero_int) = A2)))). % add.right_neutral

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

% Conjectures (2)
thf(conj_0, hypothesis,
    ((it @ t))).
thf(conj_1, conjecture,
    ((it @ (app @ t @ (var @ i))))).
