Basic theorems about field-listp, generated by std::deflist.
Theorem:
(defthm field-listp-of-cons (equal (field-listp (cons acl2::a acl2::x)) (and (fieldp acl2::a) (field-listp acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm field-listp-of-cdr-when-field-listp (implies (field-listp (double-rewrite acl2::x)) (field-listp (cdr acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm field-listp-when-not-consp (implies (not (consp acl2::x)) (equal (field-listp acl2::x) (not acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm fieldp-of-car-when-field-listp (implies (field-listp acl2::x) (iff (fieldp (car acl2::x)) (consp acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm true-listp-when-field-listp-compound-recognizer (implies (field-listp acl2::x) (true-listp acl2::x)) :rule-classes :compound-recognizer)
Theorem:
(defthm field-listp-of-list-fix (implies (field-listp acl2::x) (field-listp (list-fix acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm field-listp-of-rev (equal (field-listp (rev acl2::x)) (field-listp (list-fix acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm field-listp-of-append (equal (field-listp (append acl2::a acl2::b)) (and (field-listp (list-fix acl2::a)) (field-listp acl2::b))) :rule-classes ((:rewrite)))
Theorem:
(defthm fieldp-of-nth-when-field-listp (implies (field-listp acl2::x) (iff (fieldp (nth acl2::n acl2::x)) (< (nfix acl2::n) (len acl2::x)))) :rule-classes ((:rewrite)))