Theory "rich_list"

Signature

Definitions

ELL

|- (∀l. ELL 0 l = LAST l) ∧ ∀n l. ELL (SUC n) l = ELL n (FRONT l)

REPLICATE

|- (∀x. REPLICATE 0 x = []) ∧ ∀n x. REPLICATE (SUC n) x = x::REPLICATE n x

SCANL

|- (∀f e. SCANL f e [] = [e]) ∧
   ∀f e x l. SCANL f e (x::l) = e::SCANL f (f e x) l

SCANR

|- (∀f e. SCANR f e [] = [e]) ∧
   ∀f e x l. SCANR f e (x::l) = f x (HD (SCANR f e l))::SCANR f e l

SPLITP

|- (∀P. SPLITP P [] = ([],[])) ∧
   ∀P x l.
     SPLITP P (x::l) =
     if P x then ([],x::l) else (x::FST (SPLITP P l),SND (SPLITP P l))

SPLITP_AUX_def

|- (∀acc P. SPLITP_AUX acc P [] = (acc,[])) ∧
   ∀acc P h t.
     SPLITP_AUX acc P (h::t) =
     if P h then (acc,h::t) else SPLITP_AUX (acc ++ [h]) P t

SPLITL_def

|- ∀P. SPLITL P = SPLITP ($~ o P)

SPLITR_def

|- ∀P l.
     SPLITR P l =
     (let (a,b) = SPLITP ($~ o P) (REVERSE l) in (REVERSE b,REVERSE a))

PREFIX_DEF

|- ∀P l. PREFIX P l = FST (SPLITP ($~ o P) l)

SUFFIX_DEF

|- ∀P l. SUFFIX P l = FOLDL (λl' x. if P x then SNOC x l' else []) [] l

AND_EL_DEF

|- AND_EL = EVERY I

OR_EL_DEF

|- OR_EL = EXISTS I

UNZIP_FST_DEF

|- ∀l. UNZIP_FST l = FST (UNZIP l)

UNZIP_SND_DEF

|- ∀l. UNZIP_SND l = SND (UNZIP l)

LIST_ELEM_COUNT_DEF

|- ∀e l. LIST_ELEM_COUNT e l = LENGTH (FILTER (λx. x = e) l)

COUNT_LIST_def

|- (COUNT_LIST 0 = []) ∧ ∀n. COUNT_LIST (SUC n) = 0::MAP SUC (COUNT_LIST n)

COUNT_LIST_AUX_def

|- (∀l. COUNT_LIST_AUX 0 l = l) ∧
   ∀n l. COUNT_LIST_AUX (SUC n) l = COUNT_LIST_AUX n (n::l)

TL_T_def

|- (TL_T [] = []) ∧ ∀h t. TL_T (h::t) = t

LASTN

|- (∀l. LASTN 0 l = []) ∧
   ∀n x l. LASTN (SUC n) (SNOC x l) = SNOC x (LASTN n l)

BUTLASTN

|- (∀l. BUTLASTN 0 l = l) ∧ ∀n x l. BUTLASTN (SUC n) (SNOC x l) = BUTLASTN n l

IS_SUBLIST

|- (∀l. IS_SUBLIST l [] ⇔ T) ∧ (∀x l. IS_SUBLIST [] (x::l) ⇔ F) ∧
   ∀x1 l1 x2 l2.
     IS_SUBLIST (x1::l1) (x2::l2) ⇔
     (x1 = x2) ∧ l2 ≼ l1 ∨ IS_SUBLIST l1 (x2::l2)

SEG

|- (∀k l. SEG 0 k l = []) ∧ (∀m x l. SEG (SUC m) 0 (x::l) = x::SEG m 0 l) ∧
   ∀m k x l. SEG (SUC m) (SUC k) (x::l) = SEG (SUC m) k l

IS_SUFFIX

|- (∀l. IS_SUFFIX l [] ⇔ T) ∧ (∀x l. IS_SUFFIX [] (SNOC x l) ⇔ F) ∧
   ∀x1 l1 x2 l2.
     IS_SUFFIX (SNOC x1 l1) (SNOC x2 l2) ⇔ (x1 = x2) ∧ IS_SUFFIX l1 l2

Theorems

EL_REPLICATE

|- ∀n1 n2 x. n1 < n2 ⇒ (EL n1 (REPLICATE n2 x) = x)

REPLICATE_GENLIST

|- ∀n x. REPLICATE n x = GENLIST (K x) n

LIST_TO_SET_EQ_SING

|- ∀x ls. (LIST_TO_SET ls = {x}) ⇔ ls ≠ [] ∧ EVERY ($= x) ls

LIST_ELEM_COUNT_MEM

|- ∀e l. LIST_ELEM_COUNT e l > 0 ⇔ MEM e l

LIST_ELEM_COUNT_THM

|- (∀e. LIST_ELEM_COUNT e [] = 0) ∧
   (∀e l1 l2.
      LIST_ELEM_COUNT e (l1 ++ l2) =
      LIST_ELEM_COUNT e l1 + LIST_ELEM_COUNT e l2) ∧
   (∀e h l.
      (h = e) ⇒ (LIST_ELEM_COUNT e (h::l) = SUC (LIST_ELEM_COUNT e l))) ∧
   ∀e h l. h ≠ e ⇒ (LIST_ELEM_COUNT e (h::l) = LIST_ELEM_COUNT e l)

MEM_LAST_FRONT

|- ∀e l h. MEM e l ∧ e ≠ LAST (h::l) ⇒ MEM e (FRONT (h::l))

DROP_CONS_EL

|- ∀n l. n < LENGTH l ⇒ (DROP n l = EL n l::DROP (SUC n) l)

MEM_LAST

|- ∀e l. MEM (LAST (e::l)) (e::l)

EL_FRONT

|- ∀l n. n < LENGTH (FRONT l) ∧ ¬NULL l ⇒ (EL n (FRONT l) = EL n l)

FRONT_APPEND

|- ∀l1 l2 e. FRONT (l1 ++ e::l2) = l1 ++ FRONT (e::l2)

MEM_FRONT

|- ∀l e y. MEM y (FRONT (e::l)) ⇒ MEM y (e::l)

SPLITP_EVERY

|- ∀P l. EVERY (λx. ¬P x) l ⇒ (SPLITP P l = (l,[]))

FOLDL_MAP2

|- ∀f e g l. FOLDL f e (MAP g l) = FOLDL (λx y. f x (g y)) e l

APPEND_SNOC1

|- ∀l1 x l2. SNOC x l1 ++ l2 = l1 ++ x::l2

APPEND_ASSOC_CONS

|- ∀l1 h l2 l3. l1 ++ h::l2 ++ l3 = l1 ++ h::(l2 ++ l3)

ZIP_APPEND

|- ∀a b c d.
     (LENGTH a = LENGTH b) ∧ (LENGTH c = LENGTH d) ⇒
     (ZIP (a,b) ++ ZIP (c,d) = ZIP (a ++ c,b ++ d))

EL_TAKE

|- ∀n x l. x < n ⇒ (EL x (TAKE n l) = EL x l)

ZIP_TAKE

|- ∀n a b.
     n ≤ LENGTH a ∧ (LENGTH a = LENGTH b) ⇒
     (ZIP (TAKE n a,TAKE n b) = TAKE n (ZIP (a,b)))

ZIP_TAKE_LEQ

|- ∀n a b.
     n ≤ LENGTH a ∧ LENGTH a ≤ LENGTH b ⇒
     (ZIP (TAKE n a,TAKE n b) = TAKE n (ZIP (a,TAKE (LENGTH a) b)))

SNOC_EL_TAKE

|- ∀n l. n < LENGTH l ⇒ (SNOC (EL n l) (TAKE n l) = TAKE (SUC n) l)

EL_DROP

|- ∀m n l. m + n < LENGTH l ⇒ (EL m (DROP n l) = EL (m + n) l)

COUNT_LIST_ADD

|- ∀n m. COUNT_LIST (n + m) = COUNT_LIST n ++ MAP (λn'. n' + n) (COUNT_LIST m)

COUNT_LIST_COUNT

|- ∀n. LIST_TO_SET (COUNT_LIST n) = count n

COUNT_LIST_SNOC

|- (COUNT_LIST 0 = []) ∧ ∀n. COUNT_LIST (SUC n) = SNOC n (COUNT_LIST n)

MEM_COUNT_LIST

|- ∀m n. MEM m (COUNT_LIST n) ⇔ m < n

EL_COUNT_LIST

|- ∀m n. m < n ⇒ (EL m (COUNT_LIST n) = m)

LENGTH_COUNT_LIST

|- ∀n. LENGTH (COUNT_LIST n) = n

COUNT_LIST_GENLIST

|- ∀n. COUNT_LIST n = GENLIST I n

prefixes_is_prefix_total

|- ∀l l1 l2. l1 ≼ l ∧ l2 ≼ l ⇒ l1 ≼ l2 ∨ l2 ≼ l1

IS_PREFIX_APPEND3

|- ∀a c. a ≼ a ++ c

IS_PREFIX_APPENDS

|- ∀a b c. a ++ b ≼ a ++ c ⇔ b ≼ c

IS_PREFIX_APPEND2

|- ∀a b c. a ≼ b ++ c ⇒ a ≼ b ∨ b ≼ a

IS_PREFIX_APPEND1

|- ∀a b c. a ++ b ≼ c ⇒ a ≼ c

IS_PREFIX_SNOC

|- ∀x y z. z ≼ SNOC x y ⇔ z ≼ y ∨ (z = SNOC x y)

IS_PREFIX_LENGTH_ANTI

|- ∀x y. x ≼ y ∧ (LENGTH x = LENGTH y) ⇔ (x = y)

IS_PREFIX_LENGTH

|- ∀x y. x ≼ y ⇒ LENGTH x ≤ LENGTH y

IS_PREFIX_BUTLAST

|- ∀x y. FRONT (x::y) ≼ x::y

IS_PREFIX_TRANS

|- ∀x y z. y ≼ x ∧ z ≼ y ⇒ z ≼ x

IS_PREFIX_ANTISYM

|- ∀x y. x ≼ y ∧ y ≼ x ⇒ (x = y)

IS_PREFIX_REFL

|- ∀x. x ≼ x

IS_PREFIX_NIL

|- ∀x. [] ≼ x ∧ (x ≼ [] ⇔ (x = []))

OR_EL_FOLDR

|- ∀l. OR_EL l ⇔ FOLDR $\/ F l

OR_EL_FOLDL

|- ∀l. OR_EL l ⇔ FOLDL $\/ F l

AND_EL_FOLDR

|- ∀l. AND_EL l ⇔ FOLDR $/\ T l

AND_EL_FOLDL

|- ∀l. AND_EL l ⇔ FOLDL $/\ T l

DROP_LENGTH_NIL

|- ∀l. DROP (LENGTH l) l = []

TAKE_TAKE

|- ∀m l. m ≤ LENGTH l ⇒ ∀n. n ≤ m ⇒ (TAKE n (TAKE m l) = TAKE n l)

EVERY_BUTLASTN

|- ∀P l. EVERY P l ⇒ ∀m. m ≤ LENGTH l ⇒ EVERY P (BUTLASTN m l)

EVERY_LASTN

|- ∀P l. EVERY P l ⇒ ∀m. m ≤ LENGTH l ⇒ EVERY P (LASTN m l)

BUTLASTN_MAP

|- ∀n l. n ≤ LENGTH l ⇒ ∀f. BUTLASTN n (MAP f l) = MAP f (BUTLASTN n l)

LASTN_MAP

|- ∀n l. n ≤ LENGTH l ⇒ ∀f. LASTN n (MAP f l) = MAP f (LASTN n l)

LASTN_APPEND1

|- ∀l2 n.
     LENGTH l2 ≤ n ⇒ ∀l1. LASTN n (l1 ++ l2) = LASTN (n − LENGTH l2) l1 ++ l2

LASTN_APPEND2

|- ∀n l2. n ≤ LENGTH l2 ⇒ ∀l1. LASTN n (l1 ++ l2) = LASTN n l2

BUTLASTN_APPEND1

|- ∀l2 n.
     LENGTH l2 ≤ n ⇒ ∀l1. BUTLASTN n (l1 ++ l2) = BUTLASTN (n − LENGTH l2) l1

BUTLASTN_1

|- ∀l. l ≠ [] ⇒ (BUTLASTN 1 l = FRONT l)

LASTN_1

|- ∀l. l ≠ [] ⇒ (LASTN 1 l = [LAST l])

BUTLASTN_LASTN

|- ∀m n l.
     m ≤ n ∧ n ≤ LENGTH l ⇒
     (BUTLASTN m (LASTN n l) = LASTN (n − m) (BUTLASTN m l))

LASTN_BUTLASTN

|- ∀n m l.
     n + m ≤ LENGTH l ⇒
     (LASTN n (BUTLASTN m l) = BUTLASTN m (LASTN (n + m) l))

BUTLASTN_LASTN_NIL

|- ∀n l. n ≤ LENGTH l ⇒ (BUTLASTN n (LASTN n l) = [])

LAST_LASTN_LAST

|- ∀n l. n ≤ LENGTH l ⇒ 0 < n ⇒ (LAST (LASTN n l) = LAST l)

BUTLASTN_LENGTH_CONS

|- ∀l x. BUTLASTN (LENGTH l) (x::l) = [x]

BUTLASTN_CONS

|- ∀n l. n ≤ LENGTH l ⇒ ∀x. BUTLASTN n (x::l) = x::BUTLASTN n l

LASTN_LENGTH_APPEND

|- ∀l2 l1. LASTN (LENGTH l2) (l1 ++ l2) = l2

BUTLASTN_LENGTH_APPEND

|- ∀l2 l1. BUTLASTN (LENGTH l2) (l1 ++ l2) = l1

BUTLASTN_APPEND2

|- ∀n l1 l2. n ≤ LENGTH l2 ⇒ (BUTLASTN n (l1 ++ l2) = l1 ++ BUTLASTN n l2)

APPEND_TAKE_LASTN

|- ∀m n l. (m + n = LENGTH l) ⇒ (TAKE n l ++ LASTN m l = l)

APPEND_BUTLASTN_LASTN

|- ∀n l. n ≤ LENGTH l ⇒ (BUTLASTN n l ++ LASTN n l = l)

BUTLASTN_BUTLASTN

|- ∀m n l. n + m ≤ LENGTH l ⇒ (BUTLASTN n (BUTLASTN m l) = BUTLASTN (n + m) l)

LENGTH_BUTLASTN

|- ∀n l. n ≤ LENGTH l ⇒ (LENGTH (BUTLASTN n l) = LENGTH l − n)

BUTLASTN_FRONT

|- ∀n l. n < LENGTH l ⇒ (BUTLASTN n (FRONT l) = FRONT (BUTLASTN n l))

BUTLASTN_SUC_FRONT

|- ∀n l. n < LENGTH l ⇒ (BUTLASTN (SUC n) l = BUTLASTN n (FRONT l))

ELL_compute

|- (∀l. ELL 0 l = LAST l) ∧
   (∀n l. ELL (NUMERAL (BIT1 n)) l = ELL (NUMERAL (BIT1 n) − 1) (FRONT l)) ∧
   ∀n l. ELL (NUMERAL (BIT2 n)) l = ELL (NUMERAL (BIT1 n)) (FRONT l)

REPLICATE_compute

|- (∀x. REPLICATE 0 x = []) ∧
   (∀n x.
      REPLICATE (NUMERAL (BIT1 n)) x =
      x::REPLICATE (NUMERAL (BIT1 n) − 1) x) ∧
   ∀n x. REPLICATE (NUMERAL (BIT2 n)) x = x::REPLICATE (NUMERAL (BIT1 n)) x

COUNT_LIST_AUX_def_compute

|- (∀l. COUNT_LIST_AUX 0 l = l) ∧
   (∀n l.
      COUNT_LIST_AUX (NUMERAL (BIT1 n)) l =
      COUNT_LIST_AUX (NUMERAL (BIT1 n) − 1) (NUMERAL (BIT1 n) − 1::l)) ∧
   ∀n l.
     COUNT_LIST_AUX (NUMERAL (BIT2 n)) l =
     COUNT_LIST_AUX (NUMERAL (BIT1 n)) (NUMERAL (BIT1 n)::l)

TAKE

|- (∀l. TAKE 0 l = []) ∧ ∀n x l. TAKE (SUC n) (x::l) = x::TAKE n l

DROP

|- (∀l. DROP 0 l = l) ∧ ∀n x l. DROP (SUC n) (x::l) = DROP n l

DROP_FUNPOW_TL

|- ∀n l. DROP n l = FUNPOW TL_T n l

NOT_NULL_SNOC

|- ∀x l. ¬NULL (SNOC x l)

LENGTH_MAP2

|- ∀l1 l2.
     (LENGTH l1 = LENGTH l2) ⇒
     ∀f.
       (LENGTH (MAP2 f l1 l2) = LENGTH l1) ∧
       (LENGTH (MAP2 f l1 l2) = LENGTH l2)

LENGTH_EQ

|- ∀x y. (x = y) ⇒ (LENGTH x = LENGTH y)

LENGTH_NOT_NULL

|- ∀l. 0 < LENGTH l ⇔ ¬NULL l

NOT_NIL_SNOC

|- ∀x l. [] ≠ SNOC x l

NOT_SNOC_NIL

|- ∀x l. SNOC x l ≠ []

SNOC_EQ_LENGTH_EQ

|- ∀x1 l1 x2 l2. (SNOC x1 l1 = SNOC x2 l2) ⇒ (LENGTH l1 = LENGTH l2)

SNOC_REVERSE_CONS

|- ∀x l. SNOC x l = REVERSE (x::REVERSE l)

FOLDR_SNOC

|- ∀f e x l. FOLDR f e (SNOC x l) = FOLDR f (f x e) l

FOLDR_FOLDL

|- ∀f e. MONOID f e ⇒ ∀l. FOLDR f e l = FOLDL f e l

LENGTH_FOLDR

|- ∀l. LENGTH l = FOLDR (λx l'. SUC l') 0 l

LENGTH_FOLDL

|- ∀l. LENGTH l = FOLDL (λl' x. SUC l') 0 l

MAP_FOLDR

|- ∀f l. MAP f l = FOLDR (λx l'. f x::l') [] l

MAP_FOLDL

|- ∀f l. MAP f l = FOLDL (λl' x. SNOC (f x) l') [] l

FILTER_FOLDR

|- ∀P l. FILTER P l = FOLDR (λx l'. if P x then x::l' else l') [] l

FILTER_SNOC

|- ∀P x l.
     FILTER P (SNOC x l) = if P x then SNOC x (FILTER P l) else FILTER P l

FILTER_FOLDL

|- ∀P l. FILTER P l = FOLDL (λl' x. if P x then SNOC x l' else l') [] l

FILTER_COMM

|- ∀f1 f2 l. FILTER f1 (FILTER f2 l) = FILTER f2 (FILTER f1 l)

FILTER_IDEM

|- ∀f l. FILTER f (FILTER f l) = FILTER f l

FILTER_MAP

|- ∀f1 f2 l. FILTER f1 (MAP f2 l) = MAP f2 (FILTER (f1 o f2) l)

LENGTH_FILTER_LEQ

|- ∀P l. LENGTH (FILTER P l) ≤ LENGTH l

FILTER_EQ

|- ∀P1 P2 l. (FILTER P1 l = FILTER P2 l) ⇔ ∀x. MEM x l ⇒ (P1 x ⇔ P2 x)

LENGTH_SEG

|- ∀n k l. n + k ≤ LENGTH l ⇒ (LENGTH (SEG n k l) = n)

APPEND_NIL

|- (∀l. l ++ [] = l) ∧ ∀l. [] ++ l = l

APPEND_FOLDR

|- ∀l1 l2. l1 ++ l2 = FOLDR CONS l2 l1

APPEND_FOLDL

|- ∀l1 l2. l1 ++ l2 = FOLDL (λl' x. SNOC x l') l1 l2

FOLDR_APPEND

|- ∀f e l1 l2. FOLDR f e (l1 ++ l2) = FOLDR f (FOLDR f e l2) l1

FOLDL_APPEND

|- ∀f e l1 l2. FOLDL f e (l1 ++ l2) = FOLDL f (FOLDL f e l1) l2

CONS_APPEND

|- ∀x l. x::l = [x] ++ l

ASSOC_APPEND

|- ASSOC $++

MONOID_APPEND_NIL

|- MONOID $++ []

FLAT_SNOC

|- ∀x l. FLAT (SNOC x l) = FLAT l ++ x

FLAT_FOLDR

|- ∀l. FLAT l = FOLDR $++ [] l

FLAT_FOLDL

|- ∀l. FLAT l = FOLDL $++ [] l

LENGTH_FLAT

|- ∀l. LENGTH (FLAT l) = SUM (MAP LENGTH l)

REVERSE_FOLDR

|- ∀l. REVERSE l = FOLDR SNOC [] l

REVERSE_FOLDL

|- ∀l. REVERSE l = FOLDL (λl' x. x::l') [] l

ALL_EL_MAP

|- ∀P f l. EVERY P (MAP f l) ⇔ EVERY (P o f) l

MEM_EXISTS

|- ∀x l. MEM x l ⇔ EXISTS ($= x) l

SUM_FOLDR

|- ∀l. SUM l = FOLDR $+ 0 l

SUM_FOLDL

|- ∀l. SUM l = FOLDL $+ 0 l

IS_PREFIX

|- (∀l. [] ≼ l ⇔ T) ∧ (∀x l. x::l ≼ [] ⇔ F) ∧
   ∀x1 l1 x2 l2. x2::l2 ≼ x1::l1 ⇔ (x1 = x2) ∧ l2 ≼ l1

IS_PREFIX_APPEND

|- ∀l1 l2. l2 ≼ l1 ⇔ ∃l. l1 = l2 ++ l

IS_SUFFIX_APPEND

|- ∀l1 l2. IS_SUFFIX l1 l2 ⇔ ∃l. l1 = l ++ l2

IS_SUBLIST_APPEND

|- ∀l1 l2. IS_SUBLIST l1 l2 ⇔ ∃l l'. l1 = l ++ (l2 ++ l')

IS_PREFIX_IS_SUBLIST

|- ∀l1 l2. l2 ≼ l1 ⇒ IS_SUBLIST l1 l2

IS_SUFFIX_IS_SUBLIST

|- ∀l1 l2. IS_SUFFIX l1 l2 ⇒ IS_SUBLIST l1 l2

IS_PREFIX_REVERSE

|- ∀l1 l2. REVERSE l2 ≼ REVERSE l1 ⇔ IS_SUFFIX l1 l2

IS_SUFFIX_REVERSE

|- ∀l2 l1. IS_SUFFIX (REVERSE l1) (REVERSE l2) ⇔ l2 ≼ l1

IS_SUFFIX_CONS2_E

|- ∀s h t. IS_SUFFIX s (h::t) ⇒ IS_SUFFIX s t

IS_SUFFIX_REFL

|- ∀l. IS_SUFFIX l l

IS_SUBLIST_REVERSE

|- ∀l1 l2. IS_SUBLIST (REVERSE l1) (REVERSE l2) ⇔ IS_SUBLIST l1 l2

PREFIX_FOLDR

|- ∀P l. PREFIX P l = FOLDR (λx l'. if P x then x::l' else []) [] l

PREFIX

|- (∀P. PREFIX P [] = []) ∧
   ∀P x l. PREFIX P (x::l) = if P x then x::PREFIX P l else []

IS_PREFIX_PREFIX

|- ∀P l. PREFIX P l ≼ l

LENGTH_SCANL

|- ∀f e l. LENGTH (SCANL f e l) = SUC (LENGTH l)

LENGTH_SCANR

|- ∀f e l. LENGTH (SCANR f e l) = SUC (LENGTH l)

COMM_MONOID_FOLDL

|- ∀f. COMM f ⇒ ∀e'. MONOID f e' ⇒ ∀e l. FOLDL f e l = f e (FOLDL f e' l)

COMM_MONOID_FOLDR

|- ∀f. COMM f ⇒ ∀e'. MONOID f e' ⇒ ∀e l. FOLDR f e l = f e (FOLDR f e' l)

FCOMM_FOLDR_APPEND

|- ∀g f.
     FCOMM g f ⇒
     ∀e.
       LEFT_ID g e ⇒
       ∀l1 l2. FOLDR f e (l1 ++ l2) = g (FOLDR f e l1) (FOLDR f e l2)

FCOMM_FOLDL_APPEND

|- ∀f g.
     FCOMM f g ⇒
     ∀e.
       RIGHT_ID g e ⇒
       ∀l1 l2. FOLDL f e (l1 ++ l2) = g (FOLDL f e l1) (FOLDL f e l2)

FOLDL_SINGLE

|- ∀f e x. FOLDL f e [x] = f e x

FOLDR_SINGLE

|- ∀f e x. FOLDR f e [x] = f x e

FOLDR_CONS_NIL

|- ∀l. FOLDR CONS [] l = l

FOLDL_SNOC_NIL

|- ∀l. FOLDL (λxs x. SNOC x xs) [] l = l

FOLDR_FOLDL_REVERSE

|- ∀f e l. FOLDR f e l = FOLDL (λx y. f y x) e (REVERSE l)

FOLDL_FOLDR_REVERSE

|- ∀f e l. FOLDL f e l = FOLDR (λx y. f y x) e (REVERSE l)

FOLDR_REVERSE

|- ∀f e l. FOLDR f e (REVERSE l) = FOLDL (λx y. f y x) e l

FOLDL_REVERSE

|- ∀f e l. FOLDL f e (REVERSE l) = FOLDR (λx y. f y x) e l

FOLDR_MAP

|- ∀f e g l. FOLDR f e (MAP g l) = FOLDR (λx y. f (g x) y) e l

FOLDL_MAP

|- ∀f e g l. FOLDL f e (MAP g l) = FOLDL (λx y. f x (g y)) e l

EVERY_FOLDR

|- ∀P l. EVERY P l ⇔ FOLDR (λx l'. P x ∧ l') T l

EVERY_FOLDL

|- ∀P l. EVERY P l ⇔ FOLDL (λl' x. l' ∧ P x) T l

EXISTS_FOLDR

|- ∀P l. EXISTS P l ⇔ FOLDR (λx l'. P x ∨ l') F l

EXISTS_FOLDL

|- ∀P l. EXISTS P l ⇔ FOLDL (λl' x. l' ∨ P x) F l

EVERY_FOLDR_MAP

|- ∀P l. EVERY P l ⇔ FOLDR $/\ T (MAP P l)

EVERY_FOLDL_MAP

|- ∀P l. EVERY P l ⇔ FOLDL $/\ T (MAP P l)

EXISTS_FOLDR_MAP

|- ∀P l. EXISTS P l ⇔ FOLDR $\/ F (MAP P l)

EXISTS_FOLDL_MAP

|- ∀P l. EXISTS P l ⇔ FOLDL $\/ F (MAP P l)

FOLDR_FILTER

|- ∀f e P l.
     FOLDR f e (FILTER P l) = FOLDR (λx y. if P x then f x y else y) e l

FOLDL_FILTER

|- ∀f e P l.
     FOLDL f e (FILTER P l) = FOLDL (λx y. if P y then f x y else x) e l

ASSOC_FOLDR_FLAT

|- ∀f.
     ASSOC f ⇒
     ∀e. LEFT_ID f e ⇒ ∀l. FOLDR f e (FLAT l) = FOLDR f e (MAP (FOLDR f e) l)

ASSOC_FOLDL_FLAT

|- ∀f.
     ASSOC f ⇒
     ∀e. RIGHT_ID f e ⇒ ∀l. FOLDL f e (FLAT l) = FOLDL f e (MAP (FOLDL f e) l)

MAP_FLAT

|- ∀f l. MAP f (FLAT l) = FLAT (MAP (MAP f) l)

FILTER_FLAT

|- ∀P l. FILTER P (FLAT l) = FLAT (MAP (FILTER P) l)

EXISTS_DISJ

|- ∀P Q l. EXISTS (λx. P x ∨ Q x) l ⇔ EXISTS P l ∨ EXISTS Q l

MEM_FOLDR

|- ∀y l. MEM y l ⇔ FOLDR (λx l'. (y = x) ∨ l') F l

MEM_FOLDL

|- ∀y l. MEM y l ⇔ FOLDL (λl' x. l' ∨ (y = x)) F l

NULL_FOLDR

|- ∀l. NULL l ⇔ FOLDR (λx l'. F) T l

NULL_FOLDL

|- ∀l. NULL l ⇔ FOLDL (λx l'. F) T l

MAP_REVERSE

|- ∀f l. MAP f (REVERSE l) = REVERSE (MAP f l)

SEG_LENGTH_ID

|- ∀l. SEG (LENGTH l) 0 l = l

SEG_SUC_CONS

|- ∀m n l x. SEG m (SUC n) (x::l) = SEG m n l

SEG_0_SNOC

|- ∀m l x. m ≤ LENGTH l ⇒ (SEG m 0 (SNOC x l) = SEG m 0 l)

BUTLASTN_SEG

|- ∀n l. n ≤ LENGTH l ⇒ (BUTLASTN n l = SEG (LENGTH l − n) 0 l)

LASTN_CONS

|- ∀n l. n ≤ LENGTH l ⇒ ∀x. LASTN n (x::l) = LASTN n l

LENGTH_LASTN

|- ∀n l. n ≤ LENGTH l ⇒ (LENGTH (LASTN n l) = n)

LASTN_LENGTH_ID

|- ∀l. LASTN (LENGTH l) l = l

LASTN_LASTN

|- ∀l n m. m ≤ LENGTH l ⇒ n ≤ m ⇒ (LASTN n (LASTN m l) = LASTN n l)

TAKE_SNOC

|- ∀n l. n ≤ LENGTH l ⇒ ∀x. TAKE n (SNOC x l) = TAKE n l

BUTLASTN_LENGTH_NIL

|- ∀l. BUTLASTN (LENGTH l) l = []

DROP_APPEND

|- ∀n l1 l2. DROP n (l1 ++ l2) = DROP n l1 ++ DROP (n − LENGTH l1) l2

DROP_APPEND1

|- ∀n l1. n ≤ LENGTH l1 ⇒ ∀l2. DROP n (l1 ++ l2) = DROP n l1 ++ l2

DROP_APPEND2

|- ∀l1 n. LENGTH l1 ≤ n ⇒ ∀l2. DROP n (l1 ++ l2) = DROP (n − LENGTH l1) l2

DROP_DROP_T

|- ∀n m l. DROP n (DROP m l) = DROP (n + m) l

DROP_DROP

|- ∀n m l. n + m ≤ LENGTH l ⇒ (DROP n (DROP m l) = DROP (n + m) l)

LASTN_SEG

|- ∀n l. n ≤ LENGTH l ⇒ (LASTN n l = SEG n (LENGTH l − n) l)

TAKE_SEG

|- ∀n l. n ≤ LENGTH l ⇒ (TAKE n l = SEG n 0 l)

DROP_SEG

|- ∀n l. n ≤ LENGTH l ⇒ (DROP n l = SEG (LENGTH l − n) n l)

DROP_SNOC

|- ∀n l. n ≤ LENGTH l ⇒ ∀x. DROP n (SNOC x l) = SNOC x (DROP n l)

APPEND_BUTLASTN_DROP

|- ∀m n l. (m + n = LENGTH l) ⇒ (BUTLASTN m l ++ DROP n l = l)

SEG_SEG

|- ∀n1 m1 n2 m2 l.
     n1 + m1 ≤ LENGTH l ∧ n2 + m2 ≤ n1 ⇒
     (SEG n2 m2 (SEG n1 m1 l) = SEG n2 (m1 + m2) l)

SEG_APPEND1

|- ∀n m l1. n + m ≤ LENGTH l1 ⇒ ∀l2. SEG n m (l1 ++ l2) = SEG n m l1

SEG_APPEND2

|- ∀l1 m n l2.
     LENGTH l1 ≤ m ∧ n ≤ LENGTH l2 ⇒
     (SEG n m (l1 ++ l2) = SEG n (m − LENGTH l1) l2)

SEG_TAKE_BUTFISTN

|- ∀n m l. n + m ≤ LENGTH l ⇒ (SEG n m l = TAKE n (DROP m l))

SEG_APPEND

|- ∀m l1 n l2.
     m < LENGTH l1 ∧ LENGTH l1 ≤ n + m ∧ n + m ≤ LENGTH l1 + LENGTH l2 ⇒
     (SEG n m (l1 ++ l2) =
      SEG (LENGTH l1 − m) m l1 ++ SEG (n + m − LENGTH l1) 0 l2)

SEG_LENGTH_SNOC

|- ∀l x. SEG 1 (LENGTH l) (SNOC x l) = [x]

SEG_SNOC

|- ∀n m l. n + m ≤ LENGTH l ⇒ ∀x. SEG n m (SNOC x l) = SEG n m l

ELL_SEG

|- ∀n l. n < LENGTH l ⇒ (ELL n l = HD (SEG 1 (PRE (LENGTH l − n)) l))

SNOC_FOLDR

|- ∀x l. SNOC x l = FOLDR CONS [x] l

MEM_FOLDR_MAP

|- ∀x l. MEM x l ⇔ FOLDR $\/ F (MAP ($= x) l)

MEM_FOLDL_MAP

|- ∀x l. MEM x l ⇔ FOLDL $\/ F (MAP ($= x) l)

FILTER_FILTER

|- ∀P Q l. FILTER P (FILTER Q l) = FILTER (λx. P x ∧ Q x) l

FCOMM_FOLDR_FLAT

|- ∀g f.
     FCOMM g f ⇒
     ∀e. LEFT_ID g e ⇒ ∀l. FOLDR f e (FLAT l) = FOLDR g e (MAP (FOLDR f e) l)

FCOMM_FOLDL_FLAT

|- ∀f g.
     FCOMM f g ⇒
     ∀e. RIGHT_ID g e ⇒ ∀l. FOLDL f e (FLAT l) = FOLDL g e (MAP (FOLDL f e) l)

FOLDR_MAP_REVERSE

|- ∀f.
     (∀a b c. f a (f b c) = f b (f a c)) ⇒
     ∀e g l. FOLDR f e (MAP g (REVERSE l)) = FOLDR f e (MAP g l)

FOLDR_FILTER_REVERSE

|- ∀f.
     (∀a b c. f a (f b c) = f b (f a c)) ⇒
     ∀e P l. FOLDR f e (FILTER P (REVERSE l)) = FOLDR f e (FILTER P l)

COMM_ASSOC_FOLDR_REVERSE

|- ∀f. COMM f ⇒ ASSOC f ⇒ ∀e l. FOLDR f e (REVERSE l) = FOLDR f e l

COMM_ASSOC_FOLDL_REVERSE

|- ∀f. COMM f ⇒ ASSOC f ⇒ ∀e l. FOLDL f e (REVERSE l) = FOLDL f e l

ELL_LAST

|- ∀l. ¬NULL l ⇒ (ELL 0 l = LAST l)

ELL_0_SNOC

|- ∀l x. ELL 0 (SNOC x l) = x

ELL_SNOC

|- ∀n. 0 < n ⇒ ∀x l. ELL n (SNOC x l) = ELL (PRE n) l

ELL_SUC_SNOC

|- ∀n x l. ELL (SUC n) (SNOC x l) = ELL n l

ELL_CONS

|- ∀n l. n < LENGTH l ⇒ ∀x. ELL n (x::l) = ELL n l

ELL_LENGTH_CONS

|- ∀l x. ELL (LENGTH l) (x::l) = x

ELL_LENGTH_SNOC

|- ∀l x. ELL (LENGTH l) (SNOC x l) = if NULL l then x else HD l

ELL_APPEND2

|- ∀n l2. n < LENGTH l2 ⇒ ∀l1. ELL n (l1 ++ l2) = ELL n l2

ELL_APPEND1

|- ∀l2 n. LENGTH l2 ≤ n ⇒ ∀l1. ELL n (l1 ++ l2) = ELL (n − LENGTH l2) l1

ELL_PRE_LENGTH

|- ∀l. l ≠ [] ⇒ (ELL (PRE (LENGTH l)) l = HD l)

EL_PRE_LENGTH

|- ∀l. l ≠ [] ⇒ (EL (PRE (LENGTH l)) l = LAST l)

EL_ELL

|- ∀n l. n < LENGTH l ⇒ (EL n l = ELL (PRE (LENGTH l − n)) l)

EL_LENGTH_APPEND

|- ∀l2 l1. ¬NULL l2 ⇒ (EL (LENGTH l1) (l1 ++ l2) = HD l2)

ELL_EL

|- ∀n l. n < LENGTH l ⇒ (ELL n l = EL (PRE (LENGTH l − n)) l)

ELL_MAP

|- ∀n l f. n < LENGTH l ⇒ (ELL n (MAP f l) = f (ELL n l))

LENGTH_FRONT

|- ∀l. l ≠ [] ⇒ (LENGTH (FRONT l) = PRE (LENGTH l))

DROP_LENGTH_APPEND

|- ∀l1 l2. DROP (LENGTH l1) (l1 ++ l2) = l2

TAKE_APPEND

|- ∀n l1 l2. TAKE n (l1 ++ l2) = TAKE n l1 ++ TAKE (n − LENGTH l1) l2

TAKE_APPEND1

|- ∀n l1. n ≤ LENGTH l1 ⇒ ∀l2. TAKE n (l1 ++ l2) = TAKE n l1

TAKE_APPEND2

|- ∀l1 n.
     LENGTH l1 ≤ n ⇒ ∀l2. TAKE n (l1 ++ l2) = l1 ++ TAKE (n − LENGTH l1) l2

TAKE_LENGTH_APPEND

|- ∀l1 l2. TAKE (LENGTH l1) (l1 ++ l2) = l1

REVERSE_FLAT

|- ∀l. REVERSE (FLAT l) = FLAT (REVERSE (MAP REVERSE l))

MAP_FILTER

|- ∀f P l. (∀x. P (f x) ⇔ P x) ⇒ (MAP f (FILTER P l) = FILTER P (MAP f l))

FLAT_REVERSE

|- ∀l. FLAT (REVERSE l) = REVERSE (FLAT (MAP REVERSE l))

FLAT_FLAT

|- ∀l. FLAT (FLAT l) = FLAT (MAP FLAT l)

EVERY_REVERSE

|- ∀P l. EVERY P (REVERSE l) ⇔ EVERY P l

EXISTS_REVERSE

|- ∀P l. EXISTS P (REVERSE l) ⇔ EXISTS P l

EVERY_SEG

|- ∀P l. EVERY P l ⇒ ∀m k. m + k ≤ LENGTH l ⇒ EVERY P (SEG m k l)

EVERY_TAKE

|- ∀P l. EVERY P l ⇒ ∀m. m ≤ LENGTH l ⇒ EVERY P (TAKE m l)

EVERY_DROP

|- ∀P l. EVERY P l ⇒ ∀m. m ≤ LENGTH l ⇒ EVERY P (DROP m l)

EXISTS_SEG

|- ∀m k l. m + k ≤ LENGTH l ⇒ ∀P. EXISTS P (SEG m k l) ⇒ EXISTS P l

EXISTS_TAKE_IMP

|- ∀l m P. EXISTS P (TAKE m l) ⇒ EXISTS P l

EXISTS_DROP_IMP

|- ∀l m P. EXISTS P (DROP m l) ⇒ EXISTS P l

EXISTS_TAKE

|- ∀m l. m ≤ LENGTH l ⇒ ∀P. EXISTS P (TAKE m l) ⇒ EXISTS P l

EXISTS_DROP

|- ∀m l. m ≤ LENGTH l ⇒ ∀P. EXISTS P (DROP m l) ⇒ EXISTS P l

EXISTS_LASTN

|- ∀m l. m ≤ LENGTH l ⇒ ∀P. EXISTS P (LASTN m l) ⇒ EXISTS P l

EXISTS_BUTLASTN

|- ∀m l. m ≤ LENGTH l ⇒ ∀P. EXISTS P (BUTLASTN m l) ⇒ EXISTS P l

MEM_SEG

|- ∀n m l. n + m ≤ LENGTH l ⇒ ∀x. MEM x (SEG n m l) ⇒ MEM x l

MEM_TAKE_IMP

|- ∀l m x. MEM x (TAKE m l) ⇒ MEM x l

MEM_DROP_IMP

|- ∀l m x. MEM x (DROP m l) ⇒ MEM x l

MEM_TAKE

|- ∀m l. m ≤ LENGTH l ⇒ ∀x. MEM x (TAKE m l) ⇒ MEM x l

MEM_DROP

|- ∀m l. m ≤ LENGTH l ⇒ ∀x. MEM x (DROP m l) ⇒ MEM x l

MEM_BUTLASTN

|- ∀m l. m ≤ LENGTH l ⇒ ∀x. MEM x (BUTLASTN m l) ⇒ MEM x l

MEM_LASTN

|- ∀m l. m ≤ LENGTH l ⇒ ∀x. MEM x (LASTN m l) ⇒ MEM x l

ZIP_SNOC

|- ∀l1 l2.
     (LENGTH l1 = LENGTH l2) ⇒
     ∀x1 x2. ZIP (SNOC x1 l1,SNOC x2 l2) = SNOC (x1,x2) (ZIP (l1,l2))

UNZIP_SNOC

|- ∀x l.
     UNZIP (SNOC x l) =
     (SNOC (FST x) (FST (UNZIP l)),SNOC (SND x) (SND (UNZIP l)))

LENGTH_UNZIP_FST

|- ∀l. LENGTH (UNZIP_FST l) = LENGTH l

LENGTH_UNZIP_SND

|- ∀l. LENGTH (UNZIP_SND l) = LENGTH l

SUM_REVERSE

|- ∀l. SUM (REVERSE l) = SUM l

SUM_FLAT

|- ∀l. SUM (FLAT l) = SUM (MAP SUM l)

EL_APPEND1

|- ∀n l1 l2. n < LENGTH l1 ⇒ (EL n (l1 ++ l2) = EL n l1)

EL_APPEND2

|- ∀l1 n. LENGTH l1 ≤ n ⇒ ∀l2. EL n (l1 ++ l2) = EL (n − LENGTH l1) l2

LUPDATE_APPEND2

|- ∀l1 l2 n x.
     LENGTH l1 ≤ n ⇒
     (LUPDATE x n (l1 ++ l2) = l1 ++ LUPDATE x (n − LENGTH l1) l2)

LUPDATE_APPEND1

|- ∀l1 l2 n x. n < LENGTH l1 ⇒ (LUPDATE x n (l1 ++ l2) = LUPDATE x n l1 ++ l2)

EL_CONS

|- ∀n. 0 < n ⇒ ∀x l. EL n (x::l) = EL (PRE n) l

EL_SEG

|- ∀n l. n < LENGTH l ⇒ (EL n l = HD (SEG 1 n l))

EL_MEM

|- ∀n l. n < LENGTH l ⇒ MEM (EL n l) l

TL_SNOC

|- ∀x l. TL (SNOC x l) = if NULL l then [] else SNOC x (TL l)

EL_REVERSE_ELL

|- ∀n l. n < LENGTH l ⇒ (EL n (REVERSE l) = ELL n l)

ELL_LENGTH_APPEND

|- ∀l1 l2. ¬NULL l1 ⇒ (ELL (LENGTH l2) (l1 ++ l2) = LAST l1)

ELL_MEM

|- ∀n l. n < LENGTH l ⇒ MEM (ELL n l) l

ELL_REVERSE

|- ∀n l. n < LENGTH l ⇒ (ELL n (REVERSE l) = ELL (PRE (LENGTH l − n)) l)

ELL_REVERSE_EL

|- ∀n l. n < LENGTH l ⇒ (ELL n (REVERSE l) = EL n l)

TAKE_BUTLASTN

|- ∀n l. n ≤ LENGTH l ⇒ (TAKE n l = BUTLASTN (LENGTH l − n) l)

BUTLASTN_TAKE

|- ∀n l. n ≤ LENGTH l ⇒ (BUTLASTN n l = TAKE (LENGTH l − n) l)

LASTN_DROP

|- ∀n l. n ≤ LENGTH l ⇒ (LASTN n l = DROP (LENGTH l − n) l)

DROP_LASTN

|- ∀n l. n ≤ LENGTH l ⇒ (DROP n l = LASTN (LENGTH l − n) l)

SEG_LASTN_BUTLASTN

|- ∀n m l.
     n + m ≤ LENGTH l ⇒
     (SEG n m l = LASTN n (BUTLASTN (LENGTH l − (n + m)) l))

DROP_REVERSE

|- ∀n l. n ≤ LENGTH l ⇒ (DROP n (REVERSE l) = REVERSE (BUTLASTN n l))

BUTLASTN_REVERSE

|- ∀n l. n ≤ LENGTH l ⇒ (BUTLASTN n (REVERSE l) = REVERSE (DROP n l))

LASTN_REVERSE

|- ∀n l. n ≤ LENGTH l ⇒ (LASTN n (REVERSE l) = REVERSE (TAKE n l))

TAKE_REVERSE

|- ∀n l. n ≤ LENGTH l ⇒ (TAKE n (REVERSE l) = REVERSE (LASTN n l))

SEG_REVERSE

|- ∀n m l.
     n + m ≤ LENGTH l ⇒
     (SEG n m (REVERSE l) = REVERSE (SEG n (LENGTH l − (n + m)) l))

LENGTH_REPLICATE

|- ∀n x. LENGTH (REPLICATE n x) = n

MEM_REPLICATE

|- ∀n. 0 < n ⇒ ∀x. MEM x (REPLICATE n x)

EVERY_REPLICATE

|- ∀f n x. EVERY f (REPLICATE n x) ⇔ (n = 0) ∨ f x

ALL_DISTINCT_DROP

|- ∀ls n. ALL_DISTINCT ls ⇒ ALL_DISTINCT (DROP n ls)

MAP_SND_FILTER_NEQ

|- MAP SND (FILTER (λ(x,y). y ≠ z) ls) = FILTER (λy. z ≠ y) (MAP SND ls)

MEM_SING_APPEND

|- (∀a c. d ≠ a ++ [b] ++ c) ⇔ ¬MEM b d

EL_LENGTH_APPEND_rwt

|- ¬NULL l2 ∧ (n = LENGTH l1) ⇒ (EL n (l1 ++ l2) = HD l2)

MAP_FST_funs

|- MAP (λ(x,y,z). x) funs = MAP FST funs

TAKE_PRE_LENGTH

|- ∀ls. ls ≠ [] ⇒ (TAKE (PRE (LENGTH ls)) ls = FRONT ls)

DROP_LENGTH_NIL_rwt

|- ∀l m. (m = LENGTH l) ⇒ (DROP m l = [])

DROP_EL_CONS

|- ∀ls n. n < LENGTH ls ⇒ (DROP n ls = EL n ls::DROP (n + 1) ls)

TAKE_EL_SNOC

|- ∀ls n. n < LENGTH ls ⇒ (TAKE (n + 1) ls = SNOC (EL n ls) (TAKE n ls))

REVERSE_DROP

|- ∀ls n.
     n ≤ LENGTH ls ⇒
     (REVERSE (DROP n ls) = REVERSE (LASTN (LENGTH ls − n) ls))

LENGTH_FILTER_LESS

|- ∀P ls. EXISTS ($~ o P) ls ⇒ LENGTH (FILTER P ls) < LENGTH ls

EVERY2_APPEND

|- LIST_REL R l1 l2 ∧ LIST_REL R l3 l4 ⇔
   LIST_REL R (l1 ++ l3) (l2 ++ l4) ∧ (LENGTH l1 = LENGTH l2) ∧
   (LENGTH l3 = LENGTH l4)

LIST_REL_APPEND_IMP

|- ∀xs ys xs1 ys1.
     LIST_REL P (xs ++ xs1) (ys ++ ys1) ∧ (LENGTH xs = LENGTH ys) ⇒
     LIST_REL P xs ys ∧ LIST_REL P xs1 ys1

EVERY2_APPEND_suff

|- LIST_REL R l1 l2 ∧ LIST_REL R l3 l4 ⇒ LIST_REL R (l1 ++ l3) (l2 ++ l4)

EVERY2_DROP

|- ∀R l1 l2 n. LIST_REL R l1 l2 ⇒ LIST_REL R (DROP n l1) (DROP n l2)

EVERY2_TAKE

|- ∀P xs ys n. LIST_REL P xs ys ⇒ LIST_REL P (TAKE n xs) (TAKE n ys)

LIST_REL_APPEND_SING

|- LIST_REL R (l1 ++ [x1]) (l2 ++ [x2]) ⇔ LIST_REL R l1 l2 ∧ R x1 x2

LIST_REL_GENLIST

|- LIST_REL P (GENLIST f l) (GENLIST g l) ⇔ ∀i. i < l ⇒ P (f i) (g i)

ALL_DISTINCT_MEM_ZIP_MAP

|- ∀f x ls.
     ALL_DISTINCT ls ⇒
     (MEM x (ZIP (ls,MAP f ls)) ⇔ MEM (FST x) ls ∧ (SND x = f (FST x)))

REVERSE_ZIP

|- ∀l1 l2.
     (LENGTH l1 = LENGTH l2) ⇒
     (REVERSE (ZIP (l1,l2)) = ZIP (REVERSE l1,REVERSE l2))

EVERY2_REVERSE1

|- ∀l1 l2. LIST_REL R l1 (REVERSE l2) ⇔ LIST_REL R (REVERSE l1) l2

every_count_list

|- ∀P n. EVERY P (COUNT_LIST n) ⇔ ∀m. m < n ⇒ P m

count_list_sub1

|- ∀n. n ≠ 0 ⇒ (COUNT_LIST n = 0::MAP SUC (COUNT_LIST (n − 1)))

el_map_count

|- ∀n f m. n < m ⇒ (EL n (MAP f (COUNT_LIST m)) = f n)

ZIP_COUNT_LIST

|- (n = LENGTH l1) ⇒
   (ZIP (l1,COUNT_LIST n) = GENLIST (λn. (EL n l1,n)) (LENGTH l1))

map_replicate

|- ∀f n x. MAP f (REPLICATE n x) = REPLICATE n (f x)

REPLICATE_NIL

|- (REPLICATE x y = []) ⇔ (x = 0)

REPLICATE_APPEND

|- REPLICATE n a ++ REPLICATE m a = REPLICATE (n + m) a

DROP_REPLICATE

|- DROP n (REPLICATE m a) = REPLICATE (m − n) a

LIST_REL_REPLICATE_same

|- LIST_REL P (REPLICATE n x) (REPLICATE n y) ⇔ n > 0 ⇒ P x y

take_drop_partition

|- ∀n m l. m ≤ n ⇒ (TAKE m l ++ TAKE (n − m) (DROP m l) = TAKE n l)

all_distinct_count_list

|- ∀n. ALL_DISTINCT (COUNT_LIST n)

list_rel_lastn

|- ∀f l1 l2 n.
     n ≤ LENGTH l1 ∧ LIST_REL f l1 l2 ⇒ LIST_REL f (LASTN n l1) (LASTN n l2)

list_rel_butlastn

|- ∀f l1 l2 n.
     n ≤ LENGTH l1 ∧ LIST_REL f l1 l2 ⇒
     LIST_REL f (BUTLASTN n l1) (BUTLASTN n l2)

COUNT_LIST_compute

|- ∀n. COUNT_LIST n = COUNT_LIST_AUX n []

SPLITP_compute

|- SPLITP = SPLITP_AUX []

IS_SUFFIX_compute

|- ∀l1 l2. IS_SUFFIX l1 l2 ⇔ REVERSE l2 ≼ REVERSE l1

SEG_compute

|- (∀k l. SEG 0 k l = []) ∧
   (∀m x l.
      SEG (NUMERAL (BIT1 m)) 0 (x::l) = x::SEG (NUMERAL (BIT1 m) − 1) 0 l) ∧
   (∀m x l. SEG (NUMERAL (BIT2 m)) 0 (x::l) = x::SEG (NUMERAL (BIT1 m)) 0 l) ∧
   (∀m k x l.
      SEG (NUMERAL (BIT1 m)) (NUMERAL (BIT1 k)) (x::l) =
      SEG (NUMERAL (BIT1 m)) (NUMERAL (BIT1 k) − 1) l) ∧
   (∀m k x l.
      SEG (NUMERAL (BIT2 m)) (NUMERAL (BIT1 k)) (x::l) =
      SEG (NUMERAL (BIT2 m)) (NUMERAL (BIT1 k) − 1) l) ∧
   (∀m k x l.
      SEG (NUMERAL (BIT1 m)) (NUMERAL (BIT2 k)) (x::l) =
      SEG (NUMERAL (BIT1 m)) (NUMERAL (BIT1 k)) l) ∧
   ∀m k x l.
     SEG (NUMERAL (BIT2 m)) (NUMERAL (BIT2 k)) (x::l) =
     SEG (NUMERAL (BIT2 m)) (NUMERAL (BIT1 k)) l

BUTLASTN_compute

|- ∀n l.
     BUTLASTN n l =
     (let m = LENGTH l
      in
        if n ≤ m then TAKE (m − n) l else FAIL BUTLASTN longer than list n l)

LASTN_compute

|- ∀n l.
     LASTN n l =
     (let m = LENGTH l
      in
        if n ≤ m then DROP (m − n) l else FAIL LASTN longer than list n l)