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