		Search-engine friendly clone of the ACL2 documentation.

Inst-list-p

Inst-list-p-basics

Basic theorems about inst-list-p, generated by deflist.

Definitions and Theorems

Theorem: inst-list-p-of-cons

(defthm inst-list-p-of-cons
  (equal (inst-list-p (cons a x))
         (and (inst-p a) (inst-list-p x)))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-cdr-when-inst-list-p

(defthm inst-list-p-of-cdr-when-inst-list-p
  (implies (inst-list-p (double-rewrite x))
           (inst-list-p (cdr x)))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-when-not-consp

(defthm inst-list-p-when-not-consp
  (implies (not (consp x))
           (equal (inst-list-p x) (not x)))
  :rule-classes ((:rewrite)))

Theorem: inst-p-of-car-when-inst-list-p

(defthm inst-p-of-car-when-inst-list-p
  (implies (inst-list-p x)
           (iff (inst-p (car x))
                (or (consp x) (inst-p nil))))
  :rule-classes ((:rewrite)))

Theorem: true-listp-when-inst-list-p-compound-recognizer

(defthm true-listp-when-inst-list-p-compound-recognizer
  (implies (inst-list-p x) (true-listp x))
  :rule-classes :compound-recognizer)

Theorem: inst-list-p-of-list-fix

(defthm inst-list-p-of-list-fix
  (implies (inst-list-p x)
           (inst-list-p (acl2::list-fix x)))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-sfix

(defthm inst-list-p-of-sfix
  (iff (inst-list-p (set::sfix x))
       (or (inst-list-p x)
           (not (set::setp x))))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-insert

(defthm inst-list-p-of-insert
  (iff (inst-list-p (set::insert a x))
       (and (inst-list-p (set::sfix x))
            (inst-p a)))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-delete

(defthm inst-list-p-of-delete
  (implies (inst-list-p x)
           (inst-list-p (set::delete k x)))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-mergesort

(defthm inst-list-p-of-mergesort
  (iff (inst-list-p (set::mergesort x))
       (inst-list-p (acl2::list-fix x)))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-union

(defthm inst-list-p-of-union
  (iff (inst-list-p (set::union x y))
       (and (inst-list-p (set::sfix x))
            (inst-list-p (set::sfix y))))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-intersect-1

(defthm inst-list-p-of-intersect-1
  (implies (inst-list-p x)
           (inst-list-p (set::intersect x y)))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-intersect-2

(defthm inst-list-p-of-intersect-2
  (implies (inst-list-p y)
           (inst-list-p (set::intersect x y)))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-difference

(defthm inst-list-p-of-difference
  (implies (inst-list-p x)
           (inst-list-p (set::difference x y)))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-duplicated-members

(defthm inst-list-p-of-duplicated-members
  (implies (inst-list-p x)
           (inst-list-p (acl2::duplicated-members x)))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-rev

(defthm inst-list-p-of-rev
  (equal (inst-list-p (acl2::rev x))
         (inst-list-p (acl2::list-fix x)))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-append

(defthm inst-list-p-of-append
  (equal (inst-list-p (append a b))
         (and (inst-list-p (acl2::list-fix a))
              (inst-list-p b)))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-rcons

(defthm inst-list-p-of-rcons
  (iff (inst-list-p (acl2::rcons a x))
       (and (inst-p a)
            (inst-list-p (acl2::list-fix x))))
  :rule-classes ((:rewrite)))

Theorem: inst-p-when-member-equal-of-inst-list-p

(defthm inst-p-when-member-equal-of-inst-list-p
  (and (implies (and (member-equal a x) (inst-list-p x))
                (inst-p a))
       (implies (and (inst-list-p x) (member-equal a x))
                (inst-p a)))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-when-subsetp-equal

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

Theorem: inst-list-p-of-set-difference-equal

(defthm inst-list-p-of-set-difference-equal
  (implies (inst-list-p x)
           (inst-list-p (set-difference-equal x y)))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-intersection-equal-1

(defthm inst-list-p-of-intersection-equal-1
  (implies (inst-list-p (double-rewrite x))
           (inst-list-p (intersection-equal x y)))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-intersection-equal-2

(defthm inst-list-p-of-intersection-equal-2
  (implies (inst-list-p (double-rewrite y))
           (inst-list-p (intersection-equal x y)))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-union-equal

(defthm inst-list-p-of-union-equal
  (equal (inst-list-p (union-equal x y))
         (and (inst-list-p (acl2::list-fix x))
              (inst-list-p (double-rewrite y))))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-take

(defthm inst-list-p-of-take
  (implies (inst-list-p (double-rewrite x))
           (iff (inst-list-p (take n x))
                (or (inst-p nil)
                    (<= (nfix n) (len x)))))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-repeat

(defthm inst-list-p-of-repeat
  (iff (inst-list-p (acl2::repeat n x))
       (or (inst-p x) (zp n)))
  :rule-classes ((:rewrite)))

Theorem: inst-p-of-nth-when-inst-list-p

(defthm inst-p-of-nth-when-inst-list-p
  (implies (and (inst-list-p x)
                (< (nfix n) (len x)))
           (inst-p (nth n x)))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-update-nth

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

Theorem: inst-list-p-of-butlast

(defthm inst-list-p-of-butlast
  (implies (inst-list-p (double-rewrite x))
           (inst-list-p (butlast x n)))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-nthcdr

(defthm inst-list-p-of-nthcdr
  (implies (inst-list-p (double-rewrite x))
           (inst-list-p (nthcdr n x)))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-last

(defthm inst-list-p-of-last
  (implies (inst-list-p (double-rewrite x))
           (inst-list-p (last x)))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-remove

(defthm inst-list-p-of-remove
  (implies (inst-list-p x)
           (inst-list-p (remove a x)))
  :rule-classes ((:rewrite)))

Theorem: inst-list-p-of-revappend

(defthm inst-list-p-of-revappend
  (equal (inst-list-p (revappend x y))
         (and (inst-list-p (acl2::list-fix x))
              (inst-list-p y)))
  :rule-classes ((:rewrite)))