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