Basic theorems about prof-entrylist-p, generated by deflist.
Theorem:
(defthm prof-entrylist-p-of-cons (equal (prof-entrylist-p (cons a x)) (and (prof-entry-p a) (prof-entrylist-p x))) :rule-classes ((:rewrite)))
Theorem:
(defthm prof-entrylist-p-of-cdr-when-prof-entrylist-p (implies (prof-entrylist-p (double-rewrite x)) (prof-entrylist-p (cdr x))) :rule-classes ((:rewrite)))
Theorem:
(defthm prof-entrylist-p-when-not-consp (implies (not (consp x)) (equal (prof-entrylist-p x) (not x))) :rule-classes ((:rewrite)))
Theorem:
(defthm prof-entry-p-of-car-when-prof-entrylist-p (implies (prof-entrylist-p x) (iff (prof-entry-p (car x)) (or (consp x) (prof-entry-p nil)))) :rule-classes ((:rewrite)))
Theorem:
(defthm true-listp-when-prof-entrylist-p-compound-recognizer (implies (prof-entrylist-p x) (true-listp x)) :rule-classes :compound-recognizer)