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