Basic theorems about ubyte16-listp, generated by std::deflist.
Theorem:
(defthm ubyte16-listp-of-cons (equal (ubyte16-listp (cons a x)) (and (ubyte16p a) (ubyte16-listp x))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-cdr-when-ubyte16-listp (implies (ubyte16-listp (double-rewrite x)) (ubyte16-listp (cdr x))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-when-not-consp (implies (not (consp x)) (equal (ubyte16-listp x) (not x))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16p-of-car-when-ubyte16-listp (implies (ubyte16-listp x) (iff (ubyte16p (car x)) (consp x))) :rule-classes ((:rewrite)))
Theorem:
(defthm true-listp-when-ubyte16-listp-compound-recognizer (implies (ubyte16-listp x) (true-listp x)) :rule-classes :compound-recognizer)
Theorem:
(defthm ubyte16-listp-of-list-fix (implies (ubyte16-listp x) (ubyte16-listp (list-fix x))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-sfix (iff (ubyte16-listp (set::sfix x)) (or (ubyte16-listp x) (not (set::setp x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-insert (iff (ubyte16-listp (set::insert a x)) (and (ubyte16-listp (set::sfix x)) (ubyte16p a))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-delete (implies (ubyte16-listp x) (ubyte16-listp (set::delete k x))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-mergesort (iff (ubyte16-listp (set::mergesort x)) (ubyte16-listp (list-fix x))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-union (iff (ubyte16-listp (set::union x y)) (and (ubyte16-listp (set::sfix x)) (ubyte16-listp (set::sfix y)))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-intersect-1 (implies (ubyte16-listp x) (ubyte16-listp (set::intersect x y))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-intersect-2 (implies (ubyte16-listp y) (ubyte16-listp (set::intersect x y))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-difference (implies (ubyte16-listp x) (ubyte16-listp (set::difference x y))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-duplicated-members (implies (ubyte16-listp x) (ubyte16-listp (duplicated-members x))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-rev (equal (ubyte16-listp (rev x)) (ubyte16-listp (list-fix x))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-append (equal (ubyte16-listp (append a b)) (and (ubyte16-listp (list-fix a)) (ubyte16-listp b))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-rcons (iff (ubyte16-listp (rcons a x)) (and (ubyte16p a) (ubyte16-listp (list-fix x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16p-when-member-equal-of-ubyte16-listp (and (implies (and (member-equal a x) (ubyte16-listp x)) (ubyte16p a)) (implies (and (ubyte16-listp x) (member-equal a x)) (ubyte16p a))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-when-subsetp-equal (and (implies (and (subsetp-equal x y) (ubyte16-listp y)) (equal (ubyte16-listp x) (true-listp x))) (implies (and (ubyte16-listp y) (subsetp-equal x y)) (equal (ubyte16-listp x) (true-listp x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-set-difference-equal (implies (ubyte16-listp x) (ubyte16-listp (set-difference-equal x y))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-intersection-equal-1 (implies (ubyte16-listp (double-rewrite x)) (ubyte16-listp (intersection-equal x y))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-intersection-equal-2 (implies (ubyte16-listp (double-rewrite y)) (ubyte16-listp (intersection-equal x y))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-union-equal (equal (ubyte16-listp (union-equal x y)) (and (ubyte16-listp (list-fix x)) (ubyte16-listp (double-rewrite y)))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-take (implies (ubyte16-listp (double-rewrite x)) (iff (ubyte16-listp (take n x)) (or (ubyte16p nil) (<= (nfix n) (len x))))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-repeat (iff (ubyte16-listp (repeat n x)) (or (ubyte16p x) (zp n))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16p-of-nth-when-ubyte16-listp (implies (ubyte16-listp x) (iff (ubyte16p (nth n x)) (< (nfix n) (len x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-update-nth (implies (ubyte16-listp (double-rewrite x)) (iff (ubyte16-listp (update-nth n y x)) (and (ubyte16p y) (or (<= (nfix n) (len x)) (ubyte16p nil))))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-butlast (implies (ubyte16-listp (double-rewrite x)) (ubyte16-listp (butlast x n))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-nthcdr (implies (ubyte16-listp (double-rewrite x)) (ubyte16-listp (nthcdr n x))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-last (implies (ubyte16-listp (double-rewrite x)) (ubyte16-listp (last x))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-remove (implies (ubyte16-listp x) (ubyte16-listp (remove a x))) :rule-classes ((:rewrite)))
Theorem:
(defthm ubyte16-listp-of-revappend (equal (ubyte16-listp (revappend x y)) (and (ubyte16-listp (list-fix x)) (ubyte16-listp y))) :rule-classes ((:rewrite)))