Lift field->name to lists.
(field-list->name-list x) → *
This is an ordinary std::defprojection.
Function:
(defun field-list->name-list-exec (x acc) (declare (xargs :guard (field-listp x))) (declare (xargs :guard t)) (let ((__function__ 'field-list->name-list-exec)) (declare (ignorable __function__)) (if (consp x) (field-list->name-list-exec (cdr x) (cons (field->name (car x)) acc)) acc)))
Function:
(defun field-list->name-list-nrev (x acl2::nrev) (declare (xargs :stobjs (acl2::nrev))) (declare (xargs :guard (field-listp x))) (declare (xargs :guard t)) (let ((__function__ 'field-list->name-list-nrev)) (declare (ignorable __function__)) (if (atom x) (acl2::nrev-fix acl2::nrev) (let ((acl2::nrev (acl2::nrev-push (field->name (car x)) acl2::nrev))) (field-list->name-list-nrev (cdr x) acl2::nrev)))))
Function:
(defun field-list->name-list (x) (declare (xargs :guard (field-listp x))) (declare (xargs :guard t)) (let ((__function__ 'field-list->name-list)) (declare (ignorable __function__)) (mbe :logic (if (consp x) (cons (field->name (car x)) (field-list->name-list (cdr x))) nil) :exec (if (atom x) nil (acl2::with-local-nrev (field-list->name-list-nrev x acl2::nrev))))))
Theorem:
(defthm nth-of-field-list->name-list (equal (nth acl2::n (field-list->name-list acl2::x)) (and (< (nfix acl2::n) (len acl2::x)) (field->name (nth acl2::n acl2::x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm field-list->name-list-nrev-removal (equal (field-list->name-list-nrev acl2::x acl2::nrev) (append acl2::nrev (field-list->name-list acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm field-list->name-list-exec-removal (equal (field-list->name-list-exec acl2::x acl2::acc) (revappend (field-list->name-list acl2::x) acl2::acc)) :rule-classes ((:rewrite)))
Theorem:
(defthm field-list->name-list-of-rev (equal (field-list->name-list (rev acl2::x)) (rev (field-list->name-list acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm field-list->name-list-of-list-fix (equal (field-list->name-list (list-fix acl2::x)) (field-list->name-list acl2::x)) :rule-classes ((:rewrite)))
Theorem:
(defthm field-list->name-list-of-append (equal (field-list->name-list (append acl2::a acl2::b)) (append (field-list->name-list acl2::a) (field-list->name-list acl2::b))) :rule-classes ((:rewrite)))
Theorem:
(defthm cdr-of-field-list->name-list (equal (cdr (field-list->name-list acl2::x)) (field-list->name-list (cdr acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm car-of-field-list->name-list (equal (car (field-list->name-list acl2::x)) (and (consp acl2::x) (field->name (car acl2::x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm field-list->name-list-under-iff (iff (field-list->name-list acl2::x) (consp acl2::x)) :rule-classes ((:rewrite)))
Theorem:
(defthm consp-of-field-list->name-list (equal (consp (field-list->name-list acl2::x)) (consp acl2::x)) :rule-classes ((:rewrite)))
Theorem:
(defthm len-of-field-list->name-list (equal (len (field-list->name-list acl2::x)) (len acl2::x)) :rule-classes ((:rewrite)))
Theorem:
(defthm true-listp-of-field-list->name-list (true-listp (field-list->name-list acl2::x)) :rule-classes :type-prescription)
Theorem:
(defthm field-list->name-list-when-not-consp (implies (not (consp acl2::x)) (equal (field-list->name-list acl2::x) nil)) :rule-classes ((:rewrite)))
Theorem:
(defthm field-list->name-list-of-cons (equal (field-list->name-list (cons acl2::a acl2::b)) (cons (field->name acl2::a) (field-list->name-list acl2::b))) :rule-classes ((:rewrite)))
Theorem:
(defthm identifier-listp-of-field-list->name-list (identifier-listp (field-list->name-list x)))
Theorem:
(defthm field-list->name-list-of-field-list-fix-x (equal (field-list->name-list (field-list-fix x)) (field-list->name-list x)))
Theorem:
(defthm field-list->name-list-field-list-equiv-congruence-on-x (implies (field-list-equiv x x-equiv) (equal (field-list->name-list x) (field-list->name-list x-equiv))) :rule-classes :congruence)