		Search-engine friendly clone of the ACL2 documentation.

My-byte-listp

My-byte-listp-basics

Basic theorems about my-byte-listp, generated by deflist.

Definitions and Theorems

Theorem: my-byte-listp-of-cons

(defthm my-byte-listp-of-cons
  (equal (my-byte-listp (cons a x))
         (and (n08p a) (my-byte-listp x)))
  :rule-classes ((:rewrite)))

Theorem: my-byte-listp-of-cdr-when-my-byte-listp

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

Theorem: my-byte-listp-when-not-consp

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

Theorem: n08p-of-car-when-my-byte-listp

(defthm n08p-of-car-when-my-byte-listp
  (implies (my-byte-listp x)
           (iff (n08p (car x))
                (or (consp x) (n08p nil))))
  :rule-classes ((:rewrite)))

Theorem: true-listp-when-my-byte-listp-compound-recognizer

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

Theorem: my-byte-listp-of-list-fix

(defthm my-byte-listp-of-list-fix
  (implies (my-byte-listp x)
           (my-byte-listp (acl2::list-fix x)))
  :rule-classes ((:rewrite)))

Theorem: my-byte-listp-of-sfix

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

Theorem: my-byte-listp-of-insert

(defthm my-byte-listp-of-insert
  (iff (my-byte-listp (set::insert a x))
       (and (my-byte-listp (set::sfix x))
            (n08p a)))
  :rule-classes ((:rewrite)))

Theorem: my-byte-listp-of-delete

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

Theorem: my-byte-listp-of-mergesort

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

Theorem: my-byte-listp-of-union

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

Theorem: my-byte-listp-of-intersect-1

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

Theorem: my-byte-listp-of-intersect-2

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

Theorem: my-byte-listp-of-difference

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

Theorem: my-byte-listp-of-duplicated-members

(defthm my-byte-listp-of-duplicated-members
  (implies (my-byte-listp x)
           (my-byte-listp (acl2::duplicated-members x)))
  :rule-classes ((:rewrite)))

Theorem: my-byte-listp-of-rev

(defthm my-byte-listp-of-rev
  (equal (my-byte-listp (acl2::rev x))
         (my-byte-listp (acl2::list-fix x)))
  :rule-classes ((:rewrite)))

Theorem: my-byte-listp-of-append

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

Theorem: my-byte-listp-of-rcons

(defthm my-byte-listp-of-rcons
  (iff (my-byte-listp (acl2::rcons a x))
       (and (n08p a)
            (my-byte-listp (acl2::list-fix x))))
  :rule-classes ((:rewrite)))

Theorem: n08p-when-member-equal-of-my-byte-listp

(defthm n08p-when-member-equal-of-my-byte-listp
  (and (implies (and (member-equal a x)
                     (my-byte-listp x))
                (n08p a))
       (implies (and (my-byte-listp x)
                     (member-equal a x))
                (n08p a)))
  :rule-classes ((:rewrite)))

Theorem: my-byte-listp-when-subsetp-equal

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

Theorem: my-byte-listp-of-set-difference-equal

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

Theorem: my-byte-listp-of-intersection-equal-1

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

Theorem: my-byte-listp-of-intersection-equal-2

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

Theorem: my-byte-listp-of-union-equal

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

Theorem: my-byte-listp-of-take

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

Theorem: my-byte-listp-of-repeat

(defthm my-byte-listp-of-repeat
  (iff (my-byte-listp (acl2::repeat n x))
       (or (n08p x) (zp n)))
  :rule-classes ((:rewrite)))

Theorem: n08p-of-nth-when-my-byte-listp

(defthm n08p-of-nth-when-my-byte-listp
  (implies (and (my-byte-listp x)
                (< (nfix n) (len x)))
           (n08p (nth n x)))
  :rule-classes ((:rewrite)))

Theorem: my-byte-listp-of-update-nth

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

Theorem: my-byte-listp-of-butlast

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

Theorem: my-byte-listp-of-nthcdr

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

Theorem: my-byte-listp-of-last

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

Theorem: my-byte-listp-of-remove

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

Theorem: my-byte-listp-of-revappend

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