		Search-engine friendly clone of the ACL2 documentation.

Integer-listp

Std/typed-lists/integer-listp

Lemmas about integer-listp available in the std/typed-lists library.

Most of these are generated automatically with std::deflist.

Definitions and Theorems

Theorem: integer-listp-of-cons

(defthm integer-listp-of-cons
        (equal (integer-listp (cons a x))
               (and (integerp a) (integer-listp x)))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-cdr-when-integer-listp

(defthm integer-listp-of-cdr-when-integer-listp
        (implies (integer-listp (double-rewrite x))
                 (integer-listp (cdr x)))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-when-not-consp

(defthm integer-listp-when-not-consp
        (implies (not (consp x))
                 (equal (integer-listp x) (not x)))
        :rule-classes ((:rewrite)))

Theorem: integerp-of-car-when-integer-listp

(defthm integerp-of-car-when-integer-listp
        (implies (integer-listp x)
                 (iff (integerp (car x)) (consp x)))
        :rule-classes ((:rewrite)))

Theorem: true-listp-when-integer-listp-compound-recognizer

(defthm true-listp-when-integer-listp-compound-recognizer
        (implies (integer-listp x)
                 (true-listp x))
        :rule-classes :compound-recognizer)

Theorem: integer-listp-of-list-fix

(defthm integer-listp-of-list-fix
        (implies (integer-listp x)
                 (integer-listp (list-fix x)))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-sfix

(defthm integer-listp-of-sfix
        (iff (integer-listp (set::sfix x))
             (or (integer-listp x)
                 (not (set::setp x))))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-insert

(defthm integer-listp-of-insert
        (iff (integer-listp (set::insert a x))
             (and (integer-listp (set::sfix x))
                  (integerp a)))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-delete

(defthm integer-listp-of-delete
        (implies (integer-listp x)
                 (integer-listp (set::delete k x)))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-mergesort

(defthm integer-listp-of-mergesort
        (iff (integer-listp (set::mergesort x))
             (integer-listp (list-fix x)))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-union

(defthm integer-listp-of-union
        (iff (integer-listp (set::union x y))
             (and (integer-listp (set::sfix x))
                  (integer-listp (set::sfix y))))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-intersect-1

(defthm integer-listp-of-intersect-1
        (implies (integer-listp x)
                 (integer-listp (set::intersect x y)))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-intersect-2

(defthm integer-listp-of-intersect-2
        (implies (integer-listp y)
                 (integer-listp (set::intersect x y)))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-difference

(defthm integer-listp-of-difference
        (implies (integer-listp x)
                 (integer-listp (set::difference x y)))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-duplicated-members

(defthm integer-listp-of-duplicated-members
        (implies (integer-listp x)
                 (integer-listp (duplicated-members x)))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-rev

(defthm integer-listp-of-rev
        (equal (integer-listp (rev x))
               (integer-listp (list-fix x)))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-append

(defthm integer-listp-of-append
        (equal (integer-listp (append a b))
               (and (integer-listp (list-fix a))
                    (integer-listp b)))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-rcons

(defthm integer-listp-of-rcons
        (iff (integer-listp (rcons a x))
             (and (integerp a)
                  (integer-listp (list-fix x))))
        :rule-classes ((:rewrite)))

Theorem: integerp-when-member-equal-of-integer-listp

(defthm integerp-when-member-equal-of-integer-listp
        (and (implies (and (member-equal a x)
                           (integer-listp x))
                      (integerp a))
             (implies (and (integer-listp x)
                           (member-equal a x))
                      (integerp a)))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-when-subsetp-equal

(defthm integer-listp-when-subsetp-equal
        (and (implies (and (subsetp-equal x y)
                           (integer-listp y))
                      (equal (integer-listp x)
                             (true-listp x)))
             (implies (and (integer-listp y)
                           (subsetp-equal x y))
                      (equal (integer-listp x)
                             (true-listp x))))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-set-difference-equal

(defthm integer-listp-of-set-difference-equal
        (implies (integer-listp x)
                 (integer-listp (set-difference-equal x y)))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-intersection-equal-1

(defthm integer-listp-of-intersection-equal-1
        (implies (integer-listp (double-rewrite x))
                 (integer-listp (intersection-equal x y)))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-intersection-equal-2

(defthm integer-listp-of-intersection-equal-2
        (implies (integer-listp (double-rewrite y))
                 (integer-listp (intersection-equal x y)))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-union-equal

(defthm integer-listp-of-union-equal
        (equal (integer-listp (union-equal x y))
               (and (integer-listp (list-fix x))
                    (integer-listp (double-rewrite y))))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-take

(defthm integer-listp-of-take
        (implies (integer-listp (double-rewrite x))
                 (iff (integer-listp (take n x))
                      (or (integerp nil)
                          (<= (nfix n) (len x)))))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-repeat

(defthm integer-listp-of-repeat
        (iff (integer-listp (repeat n x))
             (or (integerp x) (zp n)))
        :rule-classes ((:rewrite)))

Theorem: integerp-of-nth-when-integer-listp

(defthm integerp-of-nth-when-integer-listp
        (implies (integer-listp x)
                 (iff (integerp (nth n x))
                      (< (nfix n) (len x))))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-update-nth

(defthm integer-listp-of-update-nth
        (implies (integer-listp (double-rewrite x))
                 (iff (integer-listp (update-nth n y x))
                      (and (integerp y)
                           (or (<= (nfix n) (len x))
                               (integerp nil)))))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-butlast

(defthm integer-listp-of-butlast
        (implies (integer-listp (double-rewrite x))
                 (integer-listp (butlast x n)))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-nthcdr

(defthm integer-listp-of-nthcdr
        (implies (integer-listp (double-rewrite x))
                 (integer-listp (nthcdr n x)))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-last

(defthm integer-listp-of-last
        (implies (integer-listp (double-rewrite x))
                 (integer-listp (last x)))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-remove

(defthm integer-listp-of-remove
        (implies (integer-listp x)
                 (integer-listp (remove a x)))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-revappend

(defthm integer-listp-of-revappend
        (equal (integer-listp (revappend x y))
               (and (integer-listp (list-fix x))
                    (integer-listp y)))
        :rule-classes ((:rewrite)))

Theorem: integer-listp-of-remove-equal

(defthm integer-listp-of-remove-equal
        (implies (integer-listp x)
                 (integer-listp (remove-equal a x))))

Theorem: integer-listp-of-make-list-ac

(defthm integer-listp-of-make-list-ac
        (equal (integer-listp (make-list-ac n x ac))
               (and (integer-listp ac)
                    (or (integerp x) (zp n)))))

Theorem: eqlable-listp-when-integer-listp

(defthm eqlable-listp-when-integer-listp
        (implies (integer-listp x)
                 (eqlable-listp x)))