Basic theorems about integer-listp, generated by std::deflist.
Theorem:
(defthm integer-listp-of-cons (equal (integer-listp (cons a x)) (and (integerp a) (integer-listp x))) :rule-classes ((:rewrite)))
Theorem:
(defthm integer-listp-of-cdr-when-integer-listp (implies (integer-listp (double-rewrite x)) (integer-listp (cdr x))) :rule-classes ((:rewrite)))
Theorem:
(defthm integer-listp-when-not-consp (implies (not (consp x)) (equal (integer-listp x) (not x))) :rule-classes ((:rewrite)))
Theorem:
(defthm integerp-of-car-when-integer-listp (implies (integer-listp x) (iff (integerp (car x)) (consp x))) :rule-classes ((:rewrite)))
Theorem:
(defthm true-listp-when-integer-listp-compound-recognizer (implies (integer-listp x) (true-listp x)) :rule-classes :compound-recognizer)
Theorem:
(defthm integer-listp-of-list-fix (implies (integer-listp x) (integer-listp (list-fix x))) :rule-classes ((:rewrite)))
Theorem:
(defthm integer-listp-of-rev (equal (integer-listp (rev x)) (integer-listp (list-fix x))) :rule-classes ((:rewrite)))