TPTP Problem File: ITP103^1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : ITP103^1 : TPTP v9.0.0. Released v7.5.0.
% Domain : Interactive Theorem Proving
% Problem : Sledgehammer ListSlice problem prob_142__5617098_1
% Version : Especial.
% English :
% Refs : [BH+15] Blanchette et al. (2015), Mining the Archive of Formal
% : [Des21] Desharnais (2021), Email to Geoff Sutcliffe
% Source : [Des21]
% Names : ListSlice/prob_142__5617098_1 [Des21]
% Status : Theorem
% Rating : 0.25 v9.0.0, 0.20 v8.2.0, 0.23 v8.1.0, 0.27 v7.5.0
% Syntax : Number of formulae : 210 ( 98 unt; 24 typ; 0 def)
% Number of atoms : 465 ( 229 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 1304 ( 84 ~; 19 |; 28 &;1000 @)
% ( 0 <=>; 173 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Number of types : 7 ( 6 usr)
% Number of type conns : 43 ( 43 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 18 usr; 4 con; 0-2 aty)
% Number of variables : 412 ( 10 ^; 386 !; 16 ?; 412 :)
% SPC : TH0_THM_EQU_NAR
% Comments : This file was generated by Sledgehammer 2021-02-23 15:31:19.022
%------------------------------------------------------------------------------
% Could-be-implicit typings (6)
thf(ty_n_t__List__Olist_It__Product____Type__Oprod_It__Product____Type__Oprod_Itf__a_Mtf__a_J_Mt__Product____Type__Oprod_Itf__a_Mtf__a_J_J_J,type,
list_P1891567085od_a_a: $tType ).
thf(ty_n_t__List__Olist_It__Product____Type__Oprod_Itf__a_Mt__Product____Type__Oprod_Itf__a_Mtf__a_J_J_J,type,
list_P1458844246od_a_a: $tType ).
thf(ty_n_t__List__Olist_It__Product____Type__Oprod_It__Product____Type__Oprod_Itf__a_Mtf__a_J_Mtf__a_J_J,type,
list_P319927492_a_a_a: $tType ).
thf(ty_n_t__List__Olist_It__Product____Type__Oprod_Itf__a_Mtf__a_J_J,type,
list_P1467822637od_a_a: $tType ).
thf(ty_n_t__List__Olist_Itf__a_J,type,
list_a: $tType ).
thf(ty_n_t__Nat__Onat,type,
nat: $tType ).
% Explicit typings (18)
thf(sy_c_Groups_Otimes__class_Otimes_001t__Nat__Onat,type,
times_times_nat: nat > nat > nat ).
thf(sy_c_Groups_Ozero__class_Ozero_001t__Nat__Onat,type,
zero_zero_nat: nat ).
thf(sy_c_List_Oproduct_001t__Product____Type__Oprod_Itf__a_Mtf__a_J_001t__Product____Type__Oprod_Itf__a_Mtf__a_J,type,
produc1055075589od_a_a: list_P1467822637od_a_a > list_P1467822637od_a_a > list_P1891567085od_a_a ).
thf(sy_c_List_Oproduct_001t__Product____Type__Oprod_Itf__a_Mtf__a_J_001tf__a,type,
produc778776796_a_a_a: list_P1467822637od_a_a > list_a > list_P319927492_a_a_a ).
thf(sy_c_List_Oproduct_001tf__a_001t__Product____Type__Oprod_Itf__a_Mtf__a_J,type,
produc16441326od_a_a: list_a > list_P1467822637od_a_a > list_P1458844246od_a_a ).
thf(sy_c_List_Oproduct_001tf__a_001tf__a,type,
product_a_a: list_a > list_a > list_P1467822637od_a_a ).
thf(sy_c_Nat_OSuc,type,
suc: nat > nat ).
thf(sy_c_Nat_Osize__class_Osize_001t__List__Olist_It__Product____Type__Oprod_It__Product____Type__Oprod_Itf__a_Mtf__a_J_Mt__Product____Type__Oprod_Itf__a_Mtf__a_J_J_J,type,
size_s1052379225od_a_a: list_P1891567085od_a_a > nat ).
thf(sy_c_Nat_Osize__class_Osize_001t__List__Olist_It__Product____Type__Oprod_It__Product____Type__Oprod_Itf__a_Mtf__a_J_Mtf__a_J_J,type,
size_s736232240_a_a_a: list_P319927492_a_a_a > nat ).
thf(sy_c_Nat_Osize__class_Osize_001t__List__Olist_It__Product____Type__Oprod_Itf__a_Mt__Product____Type__Oprod_Itf__a_Mtf__a_J_J_J,type,
size_s1875148994od_a_a: list_P1458844246od_a_a > nat ).
thf(sy_c_Nat_Osize__class_Osize_001t__List__Olist_It__Product____Type__Oprod_Itf__a_Mtf__a_J_J,type,
size_s642698393od_a_a: list_P1467822637od_a_a > nat ).
thf(sy_c_Nat_Osize__class_Osize_001t__List__Olist_Itf__a_J,type,
size_size_list_a: list_a > nat ).
thf(sy_c_Orderings_Oord__class_Oless_001t__Nat__Onat,type,
ord_less_nat: nat > nat > $o ).
thf(sy_c_Orderings_Oord__class_Oless__eq_001t__Nat__Onat,type,
ord_less_eq_nat: nat > nat > $o ).
thf(sy_c_Rings_Odivide__class_Odivide_001t__Nat__Onat,type,
divide_divide_nat: nat > nat > nat ).
thf(sy_v_k,type,
k: nat ).
thf(sy_v_n,type,
n: nat ).
thf(sy_v_xs,type,
xs: list_a ).
% Relevant facts (183)
thf(fact_0_div__mult__self__is__m,axiom,
! [N: nat,M: nat] :
( ( ord_less_nat @ zero_zero_nat @ N )
=> ( ( divide_divide_nat @ ( times_times_nat @ M @ N ) @ N )
= M ) ) ).
% div_mult_self_is_m
thf(fact_1_div__mult__self1__is__m,axiom,
! [N: nat,M: nat] :
( ( ord_less_nat @ zero_zero_nat @ N )
=> ( ( divide_divide_nat @ ( times_times_nat @ N @ M ) @ N )
= M ) ) ).
% div_mult_self1_is_m
thf(fact_2_nat__mult__div__cancel__disj,axiom,
! [K: nat,M: nat,N: nat] :
( ( ( K = zero_zero_nat )
=> ( ( divide_divide_nat @ ( times_times_nat @ K @ M ) @ ( times_times_nat @ K @ N ) )
= zero_zero_nat ) )
& ( ( K != zero_zero_nat )
=> ( ( divide_divide_nat @ ( times_times_nat @ K @ M ) @ ( times_times_nat @ K @ N ) )
= ( divide_divide_nat @ M @ N ) ) ) ) ).
% nat_mult_div_cancel_disj
thf(fact_3_div__less,axiom,
! [M: nat,N: nat] :
( ( ord_less_nat @ M @ N )
=> ( ( divide_divide_nat @ M @ N )
= zero_zero_nat ) ) ).
% div_less
thf(fact_4_div__by__Suc__0,axiom,
! [M: nat] :
( ( divide_divide_nat @ M @ ( suc @ zero_zero_nat ) )
= M ) ).
% div_by_Suc_0
thf(fact_5_mult__less__cancel2,axiom,
! [M: nat,K: nat,N: nat] :
( ( ord_less_nat @ ( times_times_nat @ M @ K ) @ ( times_times_nat @ N @ K ) )
= ( ( ord_less_nat @ zero_zero_nat @ K )
& ( ord_less_nat @ M @ N ) ) ) ).
% mult_less_cancel2
thf(fact_6_nat__0__less__mult__iff,axiom,
! [M: nat,N: nat] :
( ( ord_less_nat @ zero_zero_nat @ ( times_times_nat @ M @ N ) )
= ( ( ord_less_nat @ zero_zero_nat @ M )
& ( ord_less_nat @ zero_zero_nat @ N ) ) ) ).
% nat_0_less_mult_iff
thf(fact_7_nat__mult__less__cancel__disj,axiom,
! [K: nat,M: nat,N: nat] :
( ( ord_less_nat @ ( times_times_nat @ K @ M ) @ ( times_times_nat @ K @ N ) )
= ( ( ord_less_nat @ zero_zero_nat @ K )
& ( ord_less_nat @ M @ N ) ) ) ).
% nat_mult_less_cancel_disj
thf(fact_8_mult__eq__1__iff,axiom,
! [M: nat,N: nat] :
( ( ( times_times_nat @ M @ N )
= ( suc @ zero_zero_nat ) )
= ( ( M
= ( suc @ zero_zero_nat ) )
& ( N
= ( suc @ zero_zero_nat ) ) ) ) ).
% mult_eq_1_iff
thf(fact_9_one__eq__mult__iff,axiom,
! [M: nat,N: nat] :
( ( ( suc @ zero_zero_nat )
= ( times_times_nat @ M @ N ) )
= ( ( M
= ( suc @ zero_zero_nat ) )
& ( N
= ( suc @ zero_zero_nat ) ) ) ) ).
% one_eq_mult_iff
thf(fact_10_less__Suc0,axiom,
! [N: nat] :
( ( ord_less_nat @ N @ ( suc @ zero_zero_nat ) )
= ( N = zero_zero_nat ) ) ).
% less_Suc0
thf(fact_11_zero__less__Suc,axiom,
! [N: nat] : ( ord_less_nat @ zero_zero_nat @ ( suc @ N ) ) ).
% zero_less_Suc
thf(fact_12_old_Onat_Oinject,axiom,
! [Nat: nat,Nat2: nat] :
( ( ( suc @ Nat )
= ( suc @ Nat2 ) )
= ( Nat = Nat2 ) ) ).
% old.nat.inject
thf(fact_13_nat_Oinject,axiom,
! [X2: nat,Y2: nat] :
( ( ( suc @ X2 )
= ( suc @ Y2 ) )
= ( X2 = Y2 ) ) ).
% nat.inject
thf(fact_14_bot__nat__0_Onot__eq__extremum,axiom,
! [A: nat] :
( ( A != zero_zero_nat )
= ( ord_less_nat @ zero_zero_nat @ A ) ) ).
% bot_nat_0.not_eq_extremum
thf(fact_15_less__nat__zero__code,axiom,
! [N: nat] :
~ ( ord_less_nat @ N @ zero_zero_nat ) ).
% less_nat_zero_code
thf(fact_16_neq0__conv,axiom,
! [N: nat] :
( ( N != zero_zero_nat )
= ( ord_less_nat @ zero_zero_nat @ N ) ) ).
% neq0_conv
thf(fact_17_Suc__less__eq,axiom,
! [M: nat,N: nat] :
( ( ord_less_nat @ ( suc @ M ) @ ( suc @ N ) )
= ( ord_less_nat @ M @ N ) ) ).
% Suc_less_eq
thf(fact_18_Suc__mono,axiom,
! [M: nat,N: nat] :
( ( ord_less_nat @ M @ N )
=> ( ord_less_nat @ ( suc @ M ) @ ( suc @ N ) ) ) ).
% Suc_mono
thf(fact_19_lessI,axiom,
! [N: nat] : ( ord_less_nat @ N @ ( suc @ N ) ) ).
% lessI
thf(fact_20_mult__cancel2,axiom,
! [M: nat,K: nat,N: nat] :
( ( ( times_times_nat @ M @ K )
= ( times_times_nat @ N @ K ) )
= ( ( M = N )
| ( K = zero_zero_nat ) ) ) ).
% mult_cancel2
thf(fact_21_mult__cancel1,axiom,
! [K: nat,M: nat,N: nat] :
( ( ( times_times_nat @ K @ M )
= ( times_times_nat @ K @ N ) )
= ( ( M = N )
| ( K = zero_zero_nat ) ) ) ).
% mult_cancel1
thf(fact_22_mult__0__right,axiom,
! [M: nat] :
( ( times_times_nat @ M @ zero_zero_nat )
= zero_zero_nat ) ).
% mult_0_right
thf(fact_23_mult__is__0,axiom,
! [M: nat,N: nat] :
( ( ( times_times_nat @ M @ N )
= zero_zero_nat )
= ( ( M = zero_zero_nat )
| ( N = zero_zero_nat ) ) ) ).
% mult_is_0
thf(fact_24_div__mult__mult1__if,axiom,
! [C: nat,A: nat,B: nat] :
( ( ( C = zero_zero_nat )
=> ( ( divide_divide_nat @ ( times_times_nat @ C @ A ) @ ( times_times_nat @ C @ B ) )
= zero_zero_nat ) )
& ( ( C != zero_zero_nat )
=> ( ( divide_divide_nat @ ( times_times_nat @ C @ A ) @ ( times_times_nat @ C @ B ) )
= ( divide_divide_nat @ A @ B ) ) ) ) ).
% div_mult_mult1_if
thf(fact_25_div__mult__mult2,axiom,
! [C: nat,A: nat,B: nat] :
( ( C != zero_zero_nat )
=> ( ( divide_divide_nat @ ( times_times_nat @ A @ C ) @ ( times_times_nat @ B @ C ) )
= ( divide_divide_nat @ A @ B ) ) ) ).
% div_mult_mult2
thf(fact_26_div__mult__mult1,axiom,
! [C: nat,A: nat,B: nat] :
( ( C != zero_zero_nat )
=> ( ( divide_divide_nat @ ( times_times_nat @ C @ A ) @ ( times_times_nat @ C @ B ) )
= ( divide_divide_nat @ A @ B ) ) ) ).
% div_mult_mult1
thf(fact_27_n__not__Suc__n,axiom,
! [N: nat] :
( N
!= ( suc @ N ) ) ).
% n_not_Suc_n
thf(fact_28_Suc__inject,axiom,
! [X: nat,Y: nat] :
( ( ( suc @ X )
= ( suc @ Y ) )
=> ( X = Y ) ) ).
% Suc_inject
thf(fact_29_linorder__neqE__nat,axiom,
! [X: nat,Y: nat] :
( ( X != Y )
=> ( ~ ( ord_less_nat @ X @ Y )
=> ( ord_less_nat @ Y @ X ) ) ) ).
% linorder_neqE_nat
thf(fact_30_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_31_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_32_less__irrefl__nat,axiom,
! [N: nat] :
~ ( ord_less_nat @ N @ N ) ).
% less_irrefl_nat
thf(fact_33_less__not__refl3,axiom,
! [S: nat,T: nat] :
( ( ord_less_nat @ S @ T )
=> ( S != T ) ) ).
% less_not_refl3
thf(fact_34_less__not__refl2,axiom,
! [N: nat,M: nat] :
( ( ord_less_nat @ N @ M )
=> ( M != N ) ) ).
% less_not_refl2
thf(fact_35_less__not__refl,axiom,
! [N: nat] :
~ ( ord_less_nat @ N @ N ) ).
% less_not_refl
thf(fact_36_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_37_size__neq__size__imp__neq,axiom,
! [X: list_P1467822637od_a_a,Y: list_P1467822637od_a_a] :
( ( ( size_s642698393od_a_a @ X )
!= ( size_s642698393od_a_a @ Y ) )
=> ( X != Y ) ) ).
% size_neq_size_imp_neq
thf(fact_38_size__neq__size__imp__neq,axiom,
! [X: list_a,Y: list_a] :
( ( ( size_size_list_a @ X )
!= ( size_size_list_a @ Y ) )
=> ( X != Y ) ) ).
% size_neq_size_imp_neq
thf(fact_39_not0__implies__Suc,axiom,
! [N: nat] :
( ( N != zero_zero_nat )
=> ? [M3: nat] :
( N
= ( suc @ M3 ) ) ) ).
% not0_implies_Suc
thf(fact_40_old_Onat_Oinducts,axiom,
! [P: nat > $o,Nat: nat] :
( ( P @ zero_zero_nat )
=> ( ! [Nat3: nat] :
( ( P @ Nat3 )
=> ( P @ ( suc @ Nat3 ) ) )
=> ( P @ Nat ) ) ) ).
% old.nat.inducts
thf(fact_41_old_Onat_Oexhaust,axiom,
! [Y: nat] :
( ( Y != zero_zero_nat )
=> ~ ! [Nat3: nat] :
( Y
!= ( suc @ Nat3 ) ) ) ).
% old.nat.exhaust
thf(fact_42_Zero__not__Suc,axiom,
! [M: nat] :
( zero_zero_nat
!= ( suc @ M ) ) ).
% Zero_not_Suc
thf(fact_43_Zero__neq__Suc,axiom,
! [M: nat] :
( zero_zero_nat
!= ( suc @ M ) ) ).
% Zero_neq_Suc
thf(fact_44_Suc__neq__Zero,axiom,
! [M: nat] :
( ( suc @ M )
!= zero_zero_nat ) ).
% Suc_neq_Zero
thf(fact_45_zero__induct,axiom,
! [P: nat > $o,K: nat] :
( ( P @ K )
=> ( ! [N2: nat] :
( ( P @ ( suc @ N2 ) )
=> ( P @ N2 ) )
=> ( P @ zero_zero_nat ) ) ) ).
% zero_induct
thf(fact_46_diff__induct,axiom,
! [P: nat > nat > $o,M: nat,N: nat] :
( ! [X3: nat] : ( P @ X3 @ zero_zero_nat )
=> ( ! [Y3: nat] : ( P @ zero_zero_nat @ ( suc @ Y3 ) )
=> ( ! [X3: nat,Y3: nat] :
( ( P @ X3 @ Y3 )
=> ( P @ ( suc @ X3 ) @ ( suc @ Y3 ) ) )
=> ( P @ M @ N ) ) ) ) ).
% diff_induct
thf(fact_47_nat__induct,axiom,
! [P: nat > $o,N: nat] :
( ( P @ zero_zero_nat )
=> ( ! [N2: nat] :
( ( P @ N2 )
=> ( P @ ( suc @ N2 ) ) )
=> ( P @ N ) ) ) ).
% nat_induct
thf(fact_48_nat_OdiscI,axiom,
! [Nat: nat,X2: nat] :
( ( Nat
= ( suc @ X2 ) )
=> ( Nat != zero_zero_nat ) ) ).
% nat.discI
thf(fact_49_old_Onat_Odistinct_I1_J,axiom,
! [Nat2: nat] :
( zero_zero_nat
!= ( suc @ Nat2 ) ) ).
% old.nat.distinct(1)
thf(fact_50_old_Onat_Odistinct_I2_J,axiom,
! [Nat2: nat] :
( ( suc @ Nat2 )
!= zero_zero_nat ) ).
% old.nat.distinct(2)
thf(fact_51_nat_Odistinct_I1_J,axiom,
! [X2: nat] :
( zero_zero_nat
!= ( suc @ X2 ) ) ).
% nat.distinct(1)
thf(fact_52_bot__nat__0_Oextremum__strict,axiom,
! [A: nat] :
~ ( ord_less_nat @ A @ zero_zero_nat ) ).
% bot_nat_0.extremum_strict
thf(fact_53_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_54_gr__implies__not0,axiom,
! [M: nat,N: nat] :
( ( ord_less_nat @ M @ N )
=> ( N != zero_zero_nat ) ) ).
% gr_implies_not0
thf(fact_55_less__zeroE,axiom,
! [N: nat] :
~ ( ord_less_nat @ N @ zero_zero_nat ) ).
% less_zeroE
thf(fact_56_not__less0,axiom,
! [N: nat] :
~ ( ord_less_nat @ N @ zero_zero_nat ) ).
% not_less0
thf(fact_57_not__gr0,axiom,
! [N: nat] :
( ( ~ ( ord_less_nat @ zero_zero_nat @ N ) )
= ( N = zero_zero_nat ) ) ).
% not_gr0
thf(fact_58_gr0I,axiom,
! [N: nat] :
( ( N != zero_zero_nat )
=> ( ord_less_nat @ zero_zero_nat @ N ) ) ).
% gr0I
thf(fact_59_not__less__less__Suc__eq,axiom,
! [N: nat,M: nat] :
( ~ ( ord_less_nat @ N @ M )
=> ( ( ord_less_nat @ N @ ( suc @ M ) )
= ( N = M ) ) ) ).
% not_less_less_Suc_eq
thf(fact_60_strict__inc__induct,axiom,
! [I: nat,J: nat,P: nat > $o] :
( ( ord_less_nat @ I @ J )
=> ( ! [I2: nat] :
( ( J
= ( suc @ I2 ) )
=> ( P @ I2 ) )
=> ( ! [I2: nat] :
( ( ord_less_nat @ I2 @ J )
=> ( ( P @ ( suc @ I2 ) )
=> ( P @ I2 ) ) )
=> ( P @ I ) ) ) ) ).
% strict_inc_induct
thf(fact_61_less__Suc__induct,axiom,
! [I: nat,J: nat,P: nat > nat > $o] :
( ( ord_less_nat @ I @ J )
=> ( ! [I2: nat] : ( P @ I2 @ ( suc @ I2 ) )
=> ( ! [I2: nat,J2: nat,K2: nat] :
( ( ord_less_nat @ I2 @ J2 )
=> ( ( ord_less_nat @ J2 @ K2 )
=> ( ( P @ I2 @ J2 )
=> ( ( P @ J2 @ K2 )
=> ( P @ I2 @ K2 ) ) ) ) )
=> ( P @ I @ J ) ) ) ) ).
% less_Suc_induct
thf(fact_62_less__trans__Suc,axiom,
! [I: nat,J: nat,K: nat] :
( ( ord_less_nat @ I @ J )
=> ( ( ord_less_nat @ J @ K )
=> ( ord_less_nat @ ( suc @ I ) @ K ) ) ) ).
% less_trans_Suc
thf(fact_63_Suc__less__SucD,axiom,
! [M: nat,N: nat] :
( ( ord_less_nat @ ( suc @ M ) @ ( suc @ N ) )
=> ( ord_less_nat @ M @ N ) ) ).
% Suc_less_SucD
thf(fact_64_less__antisym,axiom,
! [N: nat,M: nat] :
( ~ ( ord_less_nat @ N @ M )
=> ( ( ord_less_nat @ N @ ( suc @ M ) )
=> ( M = N ) ) ) ).
% less_antisym
thf(fact_65_Suc__less__eq2,axiom,
! [N: nat,M: nat] :
( ( ord_less_nat @ ( suc @ N ) @ M )
= ( ? [M4: nat] :
( ( M
= ( suc @ M4 ) )
& ( ord_less_nat @ N @ M4 ) ) ) ) ).
% Suc_less_eq2
thf(fact_66_All__less__Suc,axiom,
! [N: nat,P: nat > $o] :
( ( ! [I3: nat] :
( ( ord_less_nat @ I3 @ ( suc @ N ) )
=> ( P @ I3 ) ) )
= ( ( P @ N )
& ! [I3: nat] :
( ( ord_less_nat @ I3 @ N )
=> ( P @ I3 ) ) ) ) ).
% All_less_Suc
thf(fact_67_not__less__eq,axiom,
! [M: nat,N: nat] :
( ( ~ ( ord_less_nat @ M @ N ) )
= ( ord_less_nat @ N @ ( suc @ M ) ) ) ).
% not_less_eq
thf(fact_68_less__Suc__eq,axiom,
! [M: nat,N: nat] :
( ( ord_less_nat @ M @ ( suc @ N ) )
= ( ( ord_less_nat @ M @ N )
| ( M = N ) ) ) ).
% less_Suc_eq
thf(fact_69_Ex__less__Suc,axiom,
! [N: nat,P: nat > $o] :
( ( ? [I3: nat] :
( ( ord_less_nat @ I3 @ ( suc @ N ) )
& ( P @ I3 ) ) )
= ( ( P @ N )
| ? [I3: nat] :
( ( ord_less_nat @ I3 @ N )
& ( P @ I3 ) ) ) ) ).
% Ex_less_Suc
thf(fact_70_less__SucI,axiom,
! [M: nat,N: nat] :
( ( ord_less_nat @ M @ N )
=> ( ord_less_nat @ M @ ( suc @ N ) ) ) ).
% less_SucI
thf(fact_71_less__SucE,axiom,
! [M: nat,N: nat] :
( ( ord_less_nat @ M @ ( suc @ N ) )
=> ( ~ ( ord_less_nat @ M @ N )
=> ( M = N ) ) ) ).
% less_SucE
thf(fact_72_Suc__lessI,axiom,
! [M: nat,N: nat] :
( ( ord_less_nat @ M @ N )
=> ( ( ( suc @ M )
!= N )
=> ( ord_less_nat @ ( suc @ M ) @ N ) ) ) ).
% Suc_lessI
thf(fact_73_Suc__lessE,axiom,
! [I: nat,K: nat] :
( ( ord_less_nat @ ( suc @ I ) @ K )
=> ~ ! [J2: nat] :
( ( ord_less_nat @ I @ J2 )
=> ( K
!= ( suc @ J2 ) ) ) ) ).
% Suc_lessE
thf(fact_74_Suc__lessD,axiom,
! [M: nat,N: nat] :
( ( ord_less_nat @ ( suc @ M ) @ N )
=> ( ord_less_nat @ M @ N ) ) ).
% Suc_lessD
thf(fact_75_Nat_OlessE,axiom,
! [I: nat,K: nat] :
( ( ord_less_nat @ I @ K )
=> ( ( K
!= ( suc @ I ) )
=> ~ ! [J2: nat] :
( ( ord_less_nat @ I @ J2 )
=> ( K
!= ( suc @ J2 ) ) ) ) ) ).
% Nat.lessE
thf(fact_76_nat__mult__eq__cancel__disj,axiom,
! [K: nat,M: nat,N: nat] :
( ( ( times_times_nat @ K @ M )
= ( times_times_nat @ K @ N ) )
= ( ( K = zero_zero_nat )
| ( M = N ) ) ) ).
% nat_mult_eq_cancel_disj
thf(fact_77_mult__0,axiom,
! [N: nat] :
( ( times_times_nat @ zero_zero_nat @ N )
= zero_zero_nat ) ).
% mult_0
thf(fact_78_Suc__mult__cancel1,axiom,
! [K: nat,M: nat,N: nat] :
( ( ( times_times_nat @ ( suc @ K ) @ M )
= ( times_times_nat @ ( suc @ K ) @ N ) )
= ( M = N ) ) ).
% Suc_mult_cancel1
thf(fact_79_div__mult2__eq,axiom,
! [M: nat,N: nat,Q: nat] :
( ( divide_divide_nat @ M @ ( times_times_nat @ N @ Q ) )
= ( divide_divide_nat @ ( divide_divide_nat @ M @ N ) @ Q ) ) ).
% div_mult2_eq
thf(fact_80_lift__Suc__mono__less__iff,axiom,
! [F: nat > nat,N: nat,M: nat] :
( ! [N2: nat] : ( ord_less_nat @ ( F @ N2 ) @ ( F @ ( suc @ N2 ) ) )
=> ( ( ord_less_nat @ ( F @ N ) @ ( F @ M ) )
= ( ord_less_nat @ N @ M ) ) ) ).
% lift_Suc_mono_less_iff
thf(fact_81_lift__Suc__mono__less,axiom,
! [F: nat > nat,N: nat,N3: nat] :
( ! [N2: nat] : ( ord_less_nat @ ( F @ N2 ) @ ( F @ ( suc @ N2 ) ) )
=> ( ( ord_less_nat @ N @ N3 )
=> ( ord_less_nat @ ( F @ N ) @ ( F @ N3 ) ) ) ) ).
% lift_Suc_mono_less
thf(fact_82_less__Suc__eq__0__disj,axiom,
! [M: nat,N: nat] :
( ( ord_less_nat @ M @ ( suc @ N ) )
= ( ( M = zero_zero_nat )
| ? [J3: nat] :
( ( M
= ( suc @ J3 ) )
& ( ord_less_nat @ J3 @ N ) ) ) ) ).
% less_Suc_eq_0_disj
thf(fact_83_gr0__implies__Suc,axiom,
! [N: nat] :
( ( ord_less_nat @ zero_zero_nat @ N )
=> ? [M3: nat] :
( N
= ( suc @ M3 ) ) ) ).
% gr0_implies_Suc
thf(fact_84_All__less__Suc2,axiom,
! [N: nat,P: nat > $o] :
( ( ! [I3: nat] :
( ( ord_less_nat @ I3 @ ( suc @ N ) )
=> ( P @ I3 ) ) )
= ( ( P @ zero_zero_nat )
& ! [I3: nat] :
( ( ord_less_nat @ I3 @ N )
=> ( P @ ( suc @ I3 ) ) ) ) ) ).
% All_less_Suc2
thf(fact_85_gr0__conv__Suc,axiom,
! [N: nat] :
( ( ord_less_nat @ zero_zero_nat @ N )
= ( ? [M5: nat] :
( N
= ( suc @ M5 ) ) ) ) ).
% gr0_conv_Suc
thf(fact_86_Ex__less__Suc2,axiom,
! [N: nat,P: nat > $o] :
( ( ? [I3: nat] :
( ( ord_less_nat @ I3 @ ( suc @ N ) )
& ( P @ I3 ) ) )
= ( ( P @ zero_zero_nat )
| ? [I3: nat] :
( ( ord_less_nat @ I3 @ N )
& ( P @ ( suc @ I3 ) ) ) ) ) ).
% Ex_less_Suc2
thf(fact_87_nat__mult__less__cancel1,axiom,
! [K: nat,M: nat,N: nat] :
( ( ord_less_nat @ zero_zero_nat @ K )
=> ( ( ord_less_nat @ ( times_times_nat @ K @ M ) @ ( times_times_nat @ K @ N ) )
= ( ord_less_nat @ M @ N ) ) ) ).
% nat_mult_less_cancel1
thf(fact_88_nat__mult__eq__cancel1,axiom,
! [K: nat,M: nat,N: nat] :
( ( ord_less_nat @ zero_zero_nat @ K )
=> ( ( ( times_times_nat @ K @ M )
= ( times_times_nat @ K @ N ) )
= ( M = N ) ) ) ).
% nat_mult_eq_cancel1
thf(fact_89_mult__less__mono2,axiom,
! [I: nat,J: nat,K: nat] :
( ( ord_less_nat @ I @ J )
=> ( ( ord_less_nat @ zero_zero_nat @ K )
=> ( ord_less_nat @ ( times_times_nat @ K @ I ) @ ( times_times_nat @ K @ J ) ) ) ) ).
% mult_less_mono2
thf(fact_90_mult__less__mono1,axiom,
! [I: nat,J: nat,K: nat] :
( ( ord_less_nat @ I @ J )
=> ( ( ord_less_nat @ zero_zero_nat @ K )
=> ( ord_less_nat @ ( times_times_nat @ I @ K ) @ ( times_times_nat @ J @ K ) ) ) ) ).
% mult_less_mono1
thf(fact_91_Suc__mult__less__cancel1,axiom,
! [K: nat,M: nat,N: nat] :
( ( ord_less_nat @ ( times_times_nat @ ( suc @ K ) @ M ) @ ( times_times_nat @ ( suc @ K ) @ N ) )
= ( ord_less_nat @ M @ N ) ) ).
% Suc_mult_less_cancel1
thf(fact_92_Euclidean__Division_Odiv__eq__0__iff,axiom,
! [M: nat,N: nat] :
( ( ( divide_divide_nat @ M @ N )
= zero_zero_nat )
= ( ( ord_less_nat @ M @ N )
| ( N = zero_zero_nat ) ) ) ).
% Euclidean_Division.div_eq_0_iff
thf(fact_93_Euclidean__Division_Oless__mult__imp__div__less,axiom,
! [M: nat,I: nat,N: nat] :
( ( ord_less_nat @ M @ ( times_times_nat @ I @ N ) )
=> ( ord_less_nat @ ( divide_divide_nat @ M @ N ) @ I ) ) ).
% Euclidean_Division.less_mult_imp_div_less
thf(fact_94_n__less__n__mult__m,axiom,
! [N: nat,M: nat] :
( ( ord_less_nat @ zero_zero_nat @ N )
=> ( ( ord_less_nat @ ( suc @ zero_zero_nat ) @ M )
=> ( ord_less_nat @ N @ ( times_times_nat @ N @ M ) ) ) ) ).
% n_less_n_mult_m
thf(fact_95_n__less__m__mult__n,axiom,
! [N: nat,M: nat] :
( ( ord_less_nat @ zero_zero_nat @ N )
=> ( ( ord_less_nat @ ( suc @ zero_zero_nat ) @ M )
=> ( ord_less_nat @ N @ ( times_times_nat @ M @ N ) ) ) ) ).
% n_less_m_mult_n
thf(fact_96_one__less__mult,axiom,
! [N: nat,M: nat] :
( ( ord_less_nat @ ( suc @ zero_zero_nat ) @ N )
=> ( ( ord_less_nat @ ( suc @ zero_zero_nat ) @ M )
=> ( ord_less_nat @ ( suc @ zero_zero_nat ) @ ( times_times_nat @ M @ N ) ) ) ) ).
% one_less_mult
thf(fact_97_nat__mult__div__cancel1,axiom,
! [K: nat,M: nat,N: nat] :
( ( ord_less_nat @ zero_zero_nat @ K )
=> ( ( divide_divide_nat @ ( times_times_nat @ K @ M ) @ ( times_times_nat @ K @ N ) )
= ( divide_divide_nat @ M @ N ) ) ) ).
% nat_mult_div_cancel1
thf(fact_98_nonzero__mult__div__cancel__right,axiom,
! [B: nat,A: nat] :
( ( B != zero_zero_nat )
=> ( ( divide_divide_nat @ ( times_times_nat @ A @ B ) @ B )
= A ) ) ).
% nonzero_mult_div_cancel_right
thf(fact_99_nonzero__mult__div__cancel__left,axiom,
! [A: nat,B: nat] :
( ( A != zero_zero_nat )
=> ( ( divide_divide_nat @ ( times_times_nat @ A @ B ) @ A )
= B ) ) ).
% nonzero_mult_div_cancel_left
thf(fact_100_less__div__Suc__mult,axiom,
! [M: nat,N: nat] :
( ( ord_less_nat @ zero_zero_nat @ M )
=> ( ord_less_nat @ N @ ( times_times_nat @ ( suc @ ( divide_divide_nat @ N @ M ) ) @ M ) ) ) ).
% less_div_Suc_mult
thf(fact_101_mult__zero__left,axiom,
! [A: nat] :
( ( times_times_nat @ zero_zero_nat @ A )
= zero_zero_nat ) ).
% mult_zero_left
thf(fact_102_mult__zero__right,axiom,
! [A: nat] :
( ( times_times_nat @ A @ zero_zero_nat )
= zero_zero_nat ) ).
% mult_zero_right
thf(fact_103_mult__eq__0__iff,axiom,
! [A: nat,B: nat] :
( ( ( times_times_nat @ A @ B )
= zero_zero_nat )
= ( ( A = zero_zero_nat )
| ( B = zero_zero_nat ) ) ) ).
% mult_eq_0_iff
thf(fact_104_mult__cancel__left,axiom,
! [C: nat,A: nat,B: nat] :
( ( ( times_times_nat @ C @ A )
= ( times_times_nat @ C @ B ) )
= ( ( C = zero_zero_nat )
| ( A = B ) ) ) ).
% mult_cancel_left
thf(fact_105_mult__cancel__right,axiom,
! [A: nat,C: nat,B: nat] :
( ( ( times_times_nat @ A @ C )
= ( times_times_nat @ B @ C ) )
= ( ( C = zero_zero_nat )
| ( A = B ) ) ) ).
% mult_cancel_right
thf(fact_106_div__0,axiom,
! [A: nat] :
( ( divide_divide_nat @ zero_zero_nat @ A )
= zero_zero_nat ) ).
% div_0
thf(fact_107_div__by__0,axiom,
! [A: nat] :
( ( divide_divide_nat @ A @ zero_zero_nat )
= zero_zero_nat ) ).
% div_by_0
thf(fact_108_mult__not__zero,axiom,
! [A: nat,B: nat] :
( ( ( times_times_nat @ A @ B )
!= zero_zero_nat )
=> ( ( A != zero_zero_nat )
& ( B != zero_zero_nat ) ) ) ).
% mult_not_zero
thf(fact_109_divisors__zero,axiom,
! [A: nat,B: nat] :
( ( ( times_times_nat @ A @ B )
= zero_zero_nat )
=> ( ( A = zero_zero_nat )
| ( B = zero_zero_nat ) ) ) ).
% divisors_zero
thf(fact_110_no__zero__divisors,axiom,
! [A: nat,B: nat] :
( ( A != zero_zero_nat )
=> ( ( B != zero_zero_nat )
=> ( ( times_times_nat @ A @ B )
!= zero_zero_nat ) ) ) ).
% no_zero_divisors
thf(fact_111_mult__left__cancel,axiom,
! [C: nat,A: nat,B: nat] :
( ( C != zero_zero_nat )
=> ( ( ( times_times_nat @ C @ A )
= ( times_times_nat @ C @ B ) )
= ( A = B ) ) ) ).
% mult_left_cancel
thf(fact_112_mult__right__cancel,axiom,
! [C: nat,A: nat,B: nat] :
( ( C != zero_zero_nat )
=> ( ( ( times_times_nat @ A @ C )
= ( times_times_nat @ B @ C ) )
= ( A = B ) ) ) ).
% mult_right_cancel
thf(fact_113_mult__neg__pos,axiom,
! [A: nat,B: nat] :
( ( ord_less_nat @ A @ zero_zero_nat )
=> ( ( ord_less_nat @ zero_zero_nat @ B )
=> ( ord_less_nat @ ( times_times_nat @ A @ B ) @ zero_zero_nat ) ) ) ).
% mult_neg_pos
thf(fact_114_mult__pos__neg,axiom,
! [A: nat,B: nat] :
( ( ord_less_nat @ zero_zero_nat @ A )
=> ( ( ord_less_nat @ B @ zero_zero_nat )
=> ( ord_less_nat @ ( times_times_nat @ A @ B ) @ zero_zero_nat ) ) ) ).
% mult_pos_neg
thf(fact_115_mult__pos__pos,axiom,
! [A: nat,B: nat] :
( ( ord_less_nat @ zero_zero_nat @ A )
=> ( ( ord_less_nat @ zero_zero_nat @ B )
=> ( ord_less_nat @ zero_zero_nat @ ( times_times_nat @ A @ B ) ) ) ) ).
% mult_pos_pos
thf(fact_116_mult__pos__neg2,axiom,
! [A: nat,B: nat] :
( ( ord_less_nat @ zero_zero_nat @ A )
=> ( ( ord_less_nat @ B @ zero_zero_nat )
=> ( ord_less_nat @ ( times_times_nat @ B @ A ) @ zero_zero_nat ) ) ) ).
% mult_pos_neg2
thf(fact_117_zero__less__mult__pos,axiom,
! [A: nat,B: nat] :
( ( ord_less_nat @ zero_zero_nat @ ( times_times_nat @ A @ B ) )
=> ( ( ord_less_nat @ zero_zero_nat @ A )
=> ( ord_less_nat @ zero_zero_nat @ B ) ) ) ).
% zero_less_mult_pos
thf(fact_118_zero__less__mult__pos2,axiom,
! [B: nat,A: nat] :
( ( ord_less_nat @ zero_zero_nat @ ( times_times_nat @ B @ A ) )
=> ( ( ord_less_nat @ zero_zero_nat @ A )
=> ( ord_less_nat @ zero_zero_nat @ B ) ) ) ).
% zero_less_mult_pos2
thf(fact_119_mult__strict__left__mono,axiom,
! [A: nat,B: nat,C: nat] :
( ( ord_less_nat @ A @ B )
=> ( ( ord_less_nat @ zero_zero_nat @ C )
=> ( ord_less_nat @ ( times_times_nat @ C @ A ) @ ( times_times_nat @ C @ B ) ) ) ) ).
% mult_strict_left_mono
thf(fact_120_mult__strict__right__mono,axiom,
! [A: nat,B: nat,C: nat] :
( ( ord_less_nat @ A @ B )
=> ( ( ord_less_nat @ zero_zero_nat @ C )
=> ( ord_less_nat @ ( times_times_nat @ A @ C ) @ ( times_times_nat @ B @ C ) ) ) ) ).
% mult_strict_right_mono
thf(fact_121_linordered__comm__semiring__strict__class_Ocomm__mult__strict__left__mono,axiom,
! [A: nat,B: nat,C: nat] :
( ( ord_less_nat @ A @ B )
=> ( ( ord_less_nat @ zero_zero_nat @ C )
=> ( ord_less_nat @ ( times_times_nat @ C @ A ) @ ( times_times_nat @ C @ B ) ) ) ) ).
% linordered_comm_semiring_strict_class.comm_mult_strict_left_mono
thf(fact_122_div__eq__0__conv,axiom,
! [N: nat,M: nat] :
( ( ( divide_divide_nat @ N @ M )
= zero_zero_nat )
= ( ( M = zero_zero_nat )
| ( ord_less_nat @ N @ M ) ) ) ).
% div_eq_0_conv
thf(fact_123_div__eq__0__conv_H,axiom,
! [M: nat,N: nat] :
( ( ord_less_nat @ zero_zero_nat @ M )
=> ( ( ( divide_divide_nat @ N @ M )
= zero_zero_nat )
= ( ord_less_nat @ N @ M ) ) ) ).
% div_eq_0_conv'
thf(fact_124_Util__Div_Oless__mult__imp__div__less,axiom,
! [N: nat,K: nat,M: nat] :
( ( ord_less_nat @ N @ ( times_times_nat @ K @ M ) )
=> ( ord_less_nat @ ( divide_divide_nat @ N @ M ) @ K ) ) ).
% Util_Div.less_mult_imp_div_less
thf(fact_125_div__less__conv,axiom,
! [M: nat,N: nat,K: nat] :
( ( ord_less_nat @ zero_zero_nat @ M )
=> ( ( ord_less_nat @ ( divide_divide_nat @ N @ M ) @ K )
= ( ord_less_nat @ N @ ( times_times_nat @ K @ M ) ) ) ) ).
% div_less_conv
thf(fact_126_div__less__imp__less__mult,axiom,
! [M: nat,N: nat,K: nat] :
( ( ord_less_nat @ zero_zero_nat @ M )
=> ( ( ord_less_nat @ ( divide_divide_nat @ N @ M ) @ K )
=> ( ord_less_nat @ N @ ( times_times_nat @ K @ M ) ) ) ) ).
% div_less_imp_less_mult
thf(fact_127_bits__div__0,axiom,
! [A: nat] :
( ( divide_divide_nat @ zero_zero_nat @ A )
= zero_zero_nat ) ).
% bits_div_0
thf(fact_128_bits__div__by__0,axiom,
! [A: nat] :
( ( divide_divide_nat @ A @ zero_zero_nat )
= zero_zero_nat ) ).
% bits_div_by_0
thf(fact_129_not__gr__zero,axiom,
! [N: nat] :
( ( ~ ( ord_less_nat @ zero_zero_nat @ N ) )
= ( N = zero_zero_nat ) ) ).
% not_gr_zero
thf(fact_130_mult__cancel2__gr0,axiom,
! [K: nat,M: nat,N: nat] :
( ( ord_less_nat @ zero_zero_nat @ K )
=> ( ( ( times_times_nat @ M @ K )
= ( times_times_nat @ N @ K ) )
= ( M = N ) ) ) ).
% mult_cancel2_gr0
thf(fact_131_zero__reorient,axiom,
! [X: nat] :
( ( zero_zero_nat = X )
= ( X = zero_zero_nat ) ) ).
% zero_reorient
thf(fact_132_mult_Oleft__commute,axiom,
! [B: nat,A: nat,C: nat] :
( ( times_times_nat @ B @ ( times_times_nat @ A @ C ) )
= ( times_times_nat @ A @ ( times_times_nat @ B @ C ) ) ) ).
% mult.left_commute
thf(fact_133_mult_Ocommute,axiom,
( times_times_nat
= ( ^ [A2: nat,B2: nat] : ( times_times_nat @ B2 @ A2 ) ) ) ).
% mult.commute
thf(fact_134_mult_Oassoc,axiom,
! [A: nat,B: nat,C: nat] :
( ( times_times_nat @ ( times_times_nat @ A @ B ) @ C )
= ( times_times_nat @ A @ ( times_times_nat @ B @ C ) ) ) ).
% mult.assoc
thf(fact_135_ab__semigroup__mult__class_Omult__ac_I1_J,axiom,
! [A: nat,B: nat,C: nat] :
( ( times_times_nat @ ( times_times_nat @ A @ B ) @ C )
= ( times_times_nat @ A @ ( times_times_nat @ B @ C ) ) ) ).
% ab_semigroup_mult_class.mult_ac(1)
thf(fact_136_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_137_gr__implies__not__zero,axiom,
! [M: nat,N: nat] :
( ( ord_less_nat @ M @ N )
=> ( N != zero_zero_nat ) ) ).
% gr_implies_not_zero
thf(fact_138_not__less__zero,axiom,
! [N: nat] :
~ ( ord_less_nat @ N @ zero_zero_nat ) ).
% not_less_zero
thf(fact_139_gr__zeroI,axiom,
! [N: nat] :
( ( N != zero_zero_nat )
=> ( ord_less_nat @ zero_zero_nat @ N ) ) ).
% gr_zeroI
thf(fact_140_gr__implies__gr0,axiom,
! [M: nat,N: nat] :
( ( ord_less_nat @ M @ N )
=> ( ord_less_nat @ zero_zero_nat @ N ) ) ).
% gr_implies_gr0
thf(fact_141_nat__lessSucSuc0__conv,axiom,
! [N: nat] :
( ( ord_less_nat @ N @ ( suc @ ( suc @ zero_zero_nat ) ) )
= ( ( N = zero_zero_nat )
| ( N
= ( suc @ zero_zero_nat ) ) ) ) ).
% nat_lessSucSuc0_conv
thf(fact_142_nat__grSuc0__conv,axiom,
! [N: nat] :
( ( ord_less_nat @ ( suc @ zero_zero_nat ) @ N )
= ( ( N != zero_zero_nat )
& ( N
!= ( suc @ zero_zero_nat ) ) ) ) ).
% nat_grSuc0_conv
thf(fact_143_length__induct,axiom,
! [P: list_P1467822637od_a_a > $o,Xs: list_P1467822637od_a_a] :
( ! [Xs2: list_P1467822637od_a_a] :
( ! [Ys: list_P1467822637od_a_a] :
( ( ord_less_nat @ ( size_s642698393od_a_a @ Ys ) @ ( size_s642698393od_a_a @ Xs2 ) )
=> ( P @ Ys ) )
=> ( P @ Xs2 ) )
=> ( P @ Xs ) ) ).
% length_induct
thf(fact_144_length__induct,axiom,
! [P: list_a > $o,Xs: list_a] :
( ! [Xs2: list_a] :
( ! [Ys: list_a] :
( ( ord_less_nat @ ( size_size_list_a @ Ys ) @ ( size_size_list_a @ Xs2 ) )
=> ( P @ Ys ) )
=> ( P @ Xs2 ) )
=> ( P @ Xs ) ) ).
% length_induct
thf(fact_145_Ex__list__of__length,axiom,
! [N: nat] :
? [Xs2: list_P1467822637od_a_a] :
( ( size_s642698393od_a_a @ Xs2 )
= N ) ).
% Ex_list_of_length
thf(fact_146_Ex__list__of__length,axiom,
! [N: nat] :
? [Xs2: list_a] :
( ( size_size_list_a @ Xs2 )
= N ) ).
% Ex_list_of_length
thf(fact_147_neq__if__length__neq,axiom,
! [Xs: list_P1467822637od_a_a,Ys2: list_P1467822637od_a_a] :
( ( ( size_s642698393od_a_a @ Xs )
!= ( size_s642698393od_a_a @ Ys2 ) )
=> ( Xs != Ys2 ) ) ).
% neq_if_length_neq
thf(fact_148_neq__if__length__neq,axiom,
! [Xs: list_a,Ys2: list_a] :
( ( ( size_size_list_a @ Xs )
!= ( size_size_list_a @ Ys2 ) )
=> ( Xs != Ys2 ) ) ).
% neq_if_length_neq
thf(fact_149_list__decode_Ocases,axiom,
! [X: nat] :
( ( X != zero_zero_nat )
=> ~ ! [N2: nat] :
( X
!= ( suc @ N2 ) ) ) ).
% list_decode.cases
thf(fact_150_exists__least__lemma,axiom,
! [P: nat > $o] :
( ~ ( P @ zero_zero_nat )
=> ( ? [X_1: nat] : ( P @ X_1 )
=> ? [N2: nat] :
( ~ ( P @ N2 )
& ( P @ ( suc @ N2 ) ) ) ) ) ).
% exists_least_lemma
thf(fact_151_less__numeral__extra_I3_J,axiom,
~ ( ord_less_nat @ zero_zero_nat @ zero_zero_nat ) ).
% less_numeral_extra(3)
thf(fact_152_length__product,axiom,
! [Xs: list_a,Ys2: list_P1467822637od_a_a] :
( ( size_s1875148994od_a_a @ ( produc16441326od_a_a @ Xs @ Ys2 ) )
= ( times_times_nat @ ( size_size_list_a @ Xs ) @ ( size_s642698393od_a_a @ Ys2 ) ) ) ).
% length_product
thf(fact_153_length__product,axiom,
! [Xs: list_P1467822637od_a_a,Ys2: list_a] :
( ( size_s736232240_a_a_a @ ( produc778776796_a_a_a @ Xs @ Ys2 ) )
= ( times_times_nat @ ( size_s642698393od_a_a @ Xs ) @ ( size_size_list_a @ Ys2 ) ) ) ).
% length_product
thf(fact_154_length__product,axiom,
! [Xs: list_P1467822637od_a_a,Ys2: list_P1467822637od_a_a] :
( ( size_s1052379225od_a_a @ ( produc1055075589od_a_a @ Xs @ Ys2 ) )
= ( times_times_nat @ ( size_s642698393od_a_a @ Xs ) @ ( size_s642698393od_a_a @ Ys2 ) ) ) ).
% length_product
thf(fact_155_length__product,axiom,
! [Xs: list_a,Ys2: list_a] :
( ( size_s642698393od_a_a @ ( product_a_a @ Xs @ Ys2 ) )
= ( times_times_nat @ ( size_size_list_a @ Xs ) @ ( size_size_list_a @ Ys2 ) ) ) ).
% length_product
thf(fact_156_split__div_H,axiom,
! [P: nat > $o,M: nat,N: nat] :
( ( P @ ( divide_divide_nat @ M @ N ) )
= ( ( ( N = zero_zero_nat )
& ( P @ zero_zero_nat ) )
| ? [Q2: nat] :
( ( ord_less_eq_nat @ ( times_times_nat @ N @ Q2 ) @ M )
& ( ord_less_nat @ M @ ( times_times_nat @ N @ ( suc @ Q2 ) ) )
& ( P @ Q2 ) ) ) ) ).
% split_div'
thf(fact_157_le__less__div__conv,axiom,
! [M: nat,K: nat,N: nat] :
( ( ord_less_nat @ zero_zero_nat @ M )
=> ( ( ( ord_less_eq_nat @ ( times_times_nat @ K @ M ) @ N )
& ( ord_less_nat @ N @ ( times_times_nat @ ( suc @ K ) @ M ) ) )
= ( ( divide_divide_nat @ N @ M )
= K ) ) ) ).
% le_less_div_conv
thf(fact_158_le__zero__eq,axiom,
! [N: nat] :
( ( ord_less_eq_nat @ N @ zero_zero_nat )
= ( N = zero_zero_nat ) ) ).
% le_zero_eq
thf(fact_159_bot__nat__0_Oextremum,axiom,
! [A: nat] : ( ord_less_eq_nat @ zero_zero_nat @ A ) ).
% bot_nat_0.extremum
thf(fact_160_le0,axiom,
! [N: nat] : ( ord_less_eq_nat @ zero_zero_nat @ N ) ).
% le0
thf(fact_161_Suc__le__mono,axiom,
! [N: nat,M: nat] :
( ( ord_less_eq_nat @ ( suc @ N ) @ ( suc @ M ) )
= ( ord_less_eq_nat @ N @ M ) ) ).
% Suc_le_mono
thf(fact_162_one__le__mult__iff,axiom,
! [M: nat,N: nat] :
( ( ord_less_eq_nat @ ( suc @ zero_zero_nat ) @ ( times_times_nat @ M @ N ) )
= ( ( ord_less_eq_nat @ ( suc @ zero_zero_nat ) @ M )
& ( ord_less_eq_nat @ ( suc @ zero_zero_nat ) @ N ) ) ) ).
% one_le_mult_iff
thf(fact_163_mult__le__cancel2,axiom,
! [M: nat,K: nat,N: nat] :
( ( ord_less_eq_nat @ ( times_times_nat @ M @ K ) @ ( times_times_nat @ N @ K ) )
= ( ( ord_less_nat @ zero_zero_nat @ K )
=> ( ord_less_eq_nat @ M @ N ) ) ) ).
% mult_le_cancel2
thf(fact_164_nat__mult__le__cancel__disj,axiom,
! [K: nat,M: nat,N: nat] :
( ( ord_less_eq_nat @ ( times_times_nat @ K @ M ) @ ( times_times_nat @ K @ N ) )
= ( ( ord_less_nat @ zero_zero_nat @ K )
=> ( ord_less_eq_nat @ M @ N ) ) ) ).
% nat_mult_le_cancel_disj
thf(fact_165_le__numeral__extra_I3_J,axiom,
ord_less_eq_nat @ zero_zero_nat @ zero_zero_nat ).
% le_numeral_extra(3)
thf(fact_166_zero__le,axiom,
! [X: nat] : ( ord_less_eq_nat @ zero_zero_nat @ X ) ).
% zero_le
thf(fact_167_ge__less__neq__conv,axiom,
( ord_less_eq_nat
= ( ^ [A2: nat,N4: nat] :
! [X4: nat] :
( ( ord_less_nat @ X4 @ A2 )
=> ( N4 != X4 ) ) ) ) ).
% ge_less_neq_conv
thf(fact_168_less__ge__neq__conv,axiom,
( ord_less_nat
= ( ^ [N4: nat,A2: nat] :
! [X4: nat] :
( ( ord_less_eq_nat @ A2 @ X4 )
=> ( N4 != X4 ) ) ) ) ).
% less_ge_neq_conv
thf(fact_169_greater__le__neq__conv,axiom,
( ord_less_nat
= ( ^ [A2: nat,N4: nat] :
! [X4: nat] :
( ( ord_less_eq_nat @ X4 @ A2 )
=> ( N4 != X4 ) ) ) ) ).
% greater_le_neq_conv
thf(fact_170_le__greater__neq__conv,axiom,
( ord_less_eq_nat
= ( ^ [N4: nat,A2: nat] :
! [X4: nat] :
( ( ord_less_nat @ A2 @ X4 )
=> ( N4 != X4 ) ) ) ) ).
% le_greater_neq_conv
thf(fact_171_nat__geSucSuc0__conv,axiom,
! [N: nat] :
( ( ord_less_eq_nat @ ( suc @ ( suc @ zero_zero_nat ) ) @ N )
= ( ( N != zero_zero_nat )
& ( N
!= ( suc @ zero_zero_nat ) ) ) ) ).
% nat_geSucSuc0_conv
thf(fact_172_nat__leSuc0__conv,axiom,
! [N: nat] :
( ( ord_less_eq_nat @ N @ ( suc @ zero_zero_nat ) )
= ( ( N = zero_zero_nat )
| ( N
= ( suc @ zero_zero_nat ) ) ) ) ).
% nat_leSuc0_conv
thf(fact_173_ordered__comm__semiring__class_Ocomm__mult__left__mono,axiom,
! [A: nat,B: nat,C: nat] :
( ( ord_less_eq_nat @ A @ B )
=> ( ( ord_less_eq_nat @ zero_zero_nat @ C )
=> ( ord_less_eq_nat @ ( times_times_nat @ C @ A ) @ ( times_times_nat @ C @ B ) ) ) ) ).
% ordered_comm_semiring_class.comm_mult_left_mono
thf(fact_174_mult__nonneg__nonpos2,axiom,
! [A: nat,B: nat] :
( ( ord_less_eq_nat @ zero_zero_nat @ A )
=> ( ( ord_less_eq_nat @ B @ zero_zero_nat )
=> ( ord_less_eq_nat @ ( times_times_nat @ B @ A ) @ zero_zero_nat ) ) ) ).
% mult_nonneg_nonpos2
thf(fact_175_mult__nonpos__nonneg,axiom,
! [A: nat,B: nat] :
( ( ord_less_eq_nat @ A @ zero_zero_nat )
=> ( ( ord_less_eq_nat @ zero_zero_nat @ B )
=> ( ord_less_eq_nat @ ( times_times_nat @ A @ B ) @ zero_zero_nat ) ) ) ).
% mult_nonpos_nonneg
thf(fact_176_mult__nonneg__nonpos,axiom,
! [A: nat,B: nat] :
( ( ord_less_eq_nat @ zero_zero_nat @ A )
=> ( ( ord_less_eq_nat @ B @ zero_zero_nat )
=> ( ord_less_eq_nat @ ( times_times_nat @ A @ B ) @ zero_zero_nat ) ) ) ).
% mult_nonneg_nonpos
thf(fact_177_mult__nonneg__nonneg,axiom,
! [A: nat,B: nat] :
( ( ord_less_eq_nat @ zero_zero_nat @ A )
=> ( ( ord_less_eq_nat @ zero_zero_nat @ B )
=> ( ord_less_eq_nat @ zero_zero_nat @ ( times_times_nat @ A @ B ) ) ) ) ).
% mult_nonneg_nonneg
thf(fact_178_split__mult__neg__le,axiom,
! [A: nat,B: nat] :
( ( ( ( ord_less_eq_nat @ zero_zero_nat @ A )
& ( ord_less_eq_nat @ B @ zero_zero_nat ) )
| ( ( ord_less_eq_nat @ A @ zero_zero_nat )
& ( ord_less_eq_nat @ zero_zero_nat @ B ) ) )
=> ( ord_less_eq_nat @ ( times_times_nat @ A @ B ) @ zero_zero_nat ) ) ).
% split_mult_neg_le
thf(fact_179_mult__right__mono,axiom,
! [A: nat,B: nat,C: nat] :
( ( ord_less_eq_nat @ A @ B )
=> ( ( ord_less_eq_nat @ zero_zero_nat @ C )
=> ( ord_less_eq_nat @ ( times_times_nat @ A @ C ) @ ( times_times_nat @ B @ C ) ) ) ) ).
% mult_right_mono
thf(fact_180_mult__left__mono,axiom,
! [A: nat,B: nat,C: nat] :
( ( ord_less_eq_nat @ A @ B )
=> ( ( ord_less_eq_nat @ zero_zero_nat @ C )
=> ( ord_less_eq_nat @ ( times_times_nat @ C @ A ) @ ( times_times_nat @ C @ B ) ) ) ) ).
% mult_left_mono
thf(fact_181_mult__mono_H,axiom,
! [A: nat,B: nat,C: nat,D: nat] :
( ( ord_less_eq_nat @ A @ B )
=> ( ( ord_less_eq_nat @ C @ D )
=> ( ( ord_less_eq_nat @ zero_zero_nat @ A )
=> ( ( ord_less_eq_nat @ zero_zero_nat @ C )
=> ( ord_less_eq_nat @ ( times_times_nat @ A @ C ) @ ( times_times_nat @ B @ D ) ) ) ) ) ) ).
% mult_mono'
thf(fact_182_mult__mono,axiom,
! [A: nat,B: nat,C: nat,D: nat] :
( ( ord_less_eq_nat @ A @ B )
=> ( ( ord_less_eq_nat @ C @ D )
=> ( ( ord_less_eq_nat @ zero_zero_nat @ B )
=> ( ( ord_less_eq_nat @ zero_zero_nat @ C )
=> ( ord_less_eq_nat @ ( times_times_nat @ A @ C ) @ ( times_times_nat @ B @ D ) ) ) ) ) ) ).
% mult_mono
% Conjectures (3)
thf(conj_0,hypothesis,
( ( divide_divide_nat @ ( size_size_list_a @ xs ) @ k )
= ( suc @ n ) ) ).
thf(conj_1,hypothesis,
k != zero_zero_nat ).
thf(conj_2,conjecture,
ord_less_nat @ ( times_times_nat @ n @ k ) @ ( size_size_list_a @ xs ) ).
%------------------------------------------------------------------------------