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