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