• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
    • Gl
    • Esim
    • Vl2014
      • Warnings
      • Primitives
      • Use-set
      • Syntax
      • Getting-started
      • Utilities
      • Loader
      • Transforms
        • Expression-sizing
        • Occform
        • Oprewrite
        • Expand-functions
        • Delayredux
        • Unparameterization
        • Caseelim
        • Split
        • Selresolve
        • Weirdint-elim
        • Vl-delta
        • Replicate-insts
        • Rangeresolve
        • Propagate
        • Clean-selects
        • Clean-params
        • Blankargs
        • Inline-mods
        • Expr-simp
          • Vl-plainarglist-simp
          • Vl-modinstlist-simp
          • Vl-modulelist-simp
          • Vl-assignlist-simp
          • Vl-expr-simp-unary-bitnot
          • Vl-expr-simp-binary-bitor
          • Vl-expr-simp-binary-bitand
          • Vl-expr-simp-qmark
          • Vl-modinst-simp
          • Vl-plainarg-simp
          • Vl-module-simp
          • Vl-design-simp
          • Vl-assign-simp
          • Vl-expr-simp
        • Trunc
        • Always-top
        • Gatesplit
        • Gate-elim
        • Expression-optimization
        • Elim-supplies
        • Wildelim
        • Drop-blankports
        • Clean-warnings
        • Addinstnames
        • Custom-transform-hooks
        • Annotate
        • Latchcode
        • Elim-unused-vars
        • Problem-modules
      • Lint
      • Mlib
      • Server
      • Kit
      • Printer
      • Esim-vl
      • Well-formedness
    • Sv
    • Vwsim
    • Fgl
    • Vl
    • X86isa
    • Svl
    • Rtl
  • Software-verification
  • Math
  • Testing-utilities

• Expr-simp

Vl-modinstlist-simp

(vl-modinstlist-simp x) maps vl-modinst-simp across a list.

Signature

(vl-modinstlist-simp x) → new-x

Arguments

x — Guard (vl-modinstlist-p x).

Returns

new-x — Type (vl-modinstlist-p new-x).

This is an ordinary defprojection.

Definitions and Theorems

Function: vl-modinstlist-simp-exec

(defun vl-modinstlist-simp-exec (x acc)
 (declare (xargs :guard (vl-modinstlist-p x)))
 (declare (xargs :guard t))
 (let ((__function__ 'vl-modinstlist-simp-exec))
   (declare (ignorable __function__))
   (if
     (consp x)
     (vl-modinstlist-simp-exec (cdr x)
                               (cons (vl-modinst-simp (car x)) acc))
     acc)))

Function: vl-modinstlist-simp-nrev

(defun vl-modinstlist-simp-nrev (x nrev)
  (declare (xargs :stobjs (nrev)))
  (declare (xargs :guard (vl-modinstlist-p x)))
  (declare (xargs :guard t))
  (let ((__function__ 'vl-modinstlist-simp-nrev))
    (declare (ignorable __function__))
    (if (atom x)
        (nrev-fix nrev)
      (let ((nrev (nrev-push (vl-modinst-simp (car x))
                             nrev)))
        (vl-modinstlist-simp-nrev (cdr x)
                                  nrev)))))

Function: vl-modinstlist-simp

(defun vl-modinstlist-simp (x)
  (declare (xargs :guard (vl-modinstlist-p x)))
  (declare (xargs :guard t))
  (let ((__function__ 'vl-modinstlist-simp))
    (declare (ignorable __function__))
    (mbe :logic
         (if (consp x)
             (cons (vl-modinst-simp (car x))
                   (vl-modinstlist-simp (cdr x)))
           nil)
         :exec
         (if (atom x)
             nil
           (with-local-nrev (vl-modinstlist-simp-nrev x nrev))))))

Theorem: vl-modinstlist-p-of-vl-modinstlist-simp

(defthm vl-modinstlist-p-of-vl-modinstlist-simp
  (b* ((new-x (vl-modinstlist-simp x)))
    (vl-modinstlist-p new-x))
  :rule-classes :rewrite)

Theorem: vl-modinstlist-simp-of-vl-modinstlist-fix-x

(defthm vl-modinstlist-simp-of-vl-modinstlist-fix-x
  (equal (vl-modinstlist-simp (vl-modinstlist-fix x))
         (vl-modinstlist-simp x)))

Theorem: vl-modinstlist-simp-vl-modinstlist-equiv-congruence-on-x

(defthm vl-modinstlist-simp-vl-modinstlist-equiv-congruence-on-x
  (implies (vl-modinstlist-equiv x x-equiv)
           (equal (vl-modinstlist-simp x)
                  (vl-modinstlist-simp x-equiv)))
  :rule-classes :congruence)

Theorem: vl-modinstlist-simp-of-update-nth

(defthm vl-modinstlist-simp-of-update-nth
 (implies
   (<= (nfix acl2::n) (len acl2::x))
   (equal (vl-modinstlist-simp (update-nth acl2::n acl2::v acl2::x))
          (update-nth acl2::n (vl-modinst-simp acl2::v)
                      (vl-modinstlist-simp acl2::x))))
 :rule-classes ((:rewrite)))

Theorem: vl-modinstlist-simp-of-revappend

(defthm vl-modinstlist-simp-of-revappend
  (equal (vl-modinstlist-simp (revappend acl2::x acl2::y))
         (revappend (vl-modinstlist-simp acl2::x)
                    (vl-modinstlist-simp acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: nthcdr-of-vl-modinstlist-simp

(defthm nthcdr-of-vl-modinstlist-simp
  (equal (nthcdr acl2::n (vl-modinstlist-simp acl2::x))
         (vl-modinstlist-simp (nthcdr acl2::n acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: nth-of-vl-modinstlist-simp

(defthm nth-of-vl-modinstlist-simp
  (equal (nth acl2::n (vl-modinstlist-simp acl2::x))
         (and (< (nfix acl2::n) (len acl2::x))
              (vl-modinst-simp (nth acl2::n acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: vl-modinstlist-simp-nrev-removal

(defthm vl-modinstlist-simp-nrev-removal
  (equal (vl-modinstlist-simp-nrev acl2::x nrev)
         (append nrev (vl-modinstlist-simp acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-modinstlist-simp-exec-removal

(defthm vl-modinstlist-simp-exec-removal
  (equal (vl-modinstlist-simp-exec acl2::x acl2::acc)
         (revappend (vl-modinstlist-simp acl2::x)
                    acl2::acc))
  :rule-classes ((:rewrite)))

Theorem: vl-modinstlist-simp-of-take

(defthm vl-modinstlist-simp-of-take
  (implies (<= (nfix acl2::n) (len acl2::x))
           (equal (vl-modinstlist-simp (take acl2::n acl2::x))
                  (take acl2::n (vl-modinstlist-simp acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: set-equiv-congruence-over-vl-modinstlist-simp

(defthm set-equiv-congruence-over-vl-modinstlist-simp
  (implies (set-equiv acl2::x acl2::y)
           (set-equiv (vl-modinstlist-simp acl2::x)
                      (vl-modinstlist-simp acl2::y)))
  :rule-classes ((:congruence)))

Theorem: subsetp-of-vl-modinstlist-simp-when-subsetp

(defthm subsetp-of-vl-modinstlist-simp-when-subsetp
  (implies (subsetp acl2::x acl2::y)
           (subsetp (vl-modinstlist-simp acl2::x)
                    (vl-modinstlist-simp acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: member-of-vl-modinst-simp-in-vl-modinstlist-simp

(defthm member-of-vl-modinst-simp-in-vl-modinstlist-simp
  (implies (member acl2::k acl2::x)
           (member (vl-modinst-simp acl2::k)
                   (vl-modinstlist-simp acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-modinstlist-simp-of-rev

(defthm vl-modinstlist-simp-of-rev
  (equal (vl-modinstlist-simp (rev acl2::x))
         (rev (vl-modinstlist-simp acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-modinstlist-simp-of-list-fix

(defthm vl-modinstlist-simp-of-list-fix
  (equal (vl-modinstlist-simp (list-fix acl2::x))
         (vl-modinstlist-simp acl2::x))
  :rule-classes ((:rewrite)))

Theorem: vl-modinstlist-simp-of-append

(defthm vl-modinstlist-simp-of-append
  (equal (vl-modinstlist-simp (append acl2::a acl2::b))
         (append (vl-modinstlist-simp acl2::a)
                 (vl-modinstlist-simp acl2::b)))
  :rule-classes ((:rewrite)))

Theorem: cdr-of-vl-modinstlist-simp

(defthm cdr-of-vl-modinstlist-simp
  (equal (cdr (vl-modinstlist-simp acl2::x))
         (vl-modinstlist-simp (cdr acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: car-of-vl-modinstlist-simp

(defthm car-of-vl-modinstlist-simp
  (equal (car (vl-modinstlist-simp acl2::x))
         (and (consp acl2::x)
              (vl-modinst-simp (car acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: vl-modinstlist-simp-under-iff

(defthm vl-modinstlist-simp-under-iff
  (iff (vl-modinstlist-simp acl2::x)
       (consp acl2::x))
  :rule-classes ((:rewrite)))

Theorem: consp-of-vl-modinstlist-simp

(defthm consp-of-vl-modinstlist-simp
  (equal (consp (vl-modinstlist-simp acl2::x))
         (consp acl2::x))
  :rule-classes ((:rewrite)))

Theorem: len-of-vl-modinstlist-simp

(defthm len-of-vl-modinstlist-simp
  (equal (len (vl-modinstlist-simp acl2::x))
         (len acl2::x))
  :rule-classes ((:rewrite)))

Theorem: true-listp-of-vl-modinstlist-simp

(defthm true-listp-of-vl-modinstlist-simp
  (true-listp (vl-modinstlist-simp acl2::x))
  :rule-classes :type-prescription)

Theorem: vl-modinstlist-simp-when-not-consp

(defthm vl-modinstlist-simp-when-not-consp
  (implies (not (consp acl2::x))
           (equal (vl-modinstlist-simp acl2::x)
                  nil))
  :rule-classes ((:rewrite)))

Theorem: vl-modinstlist-simp-of-cons

(defthm vl-modinstlist-simp-of-cons
  (equal (vl-modinstlist-simp (cons acl2::a acl2::b))
         (cons (vl-modinst-simp acl2::a)
               (vl-modinstlist-simp acl2::b)))
  :rule-classes ((:rewrite)))