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