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