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