• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Community
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
    • Gl
    • Esim
    • Vl2014
      • Warnings
      • Primitives
      • Use-set
      • Syntax
      • Getting-started
      • Utilities
      • Loader
      • Transforms
      • Lint
      • Mlib
        • Scopestack
        • Filtering-by-name
        • Vl-namefactory
        • Substitution
        • Allexprs
        • Hid-tools
        • Vl-consteval
        • Range-tools
        • Lvalexprs
        • Hierarchy
        • Finding-by-name
        • Expr-tools
          • Vl-expr-widthsfixed-p
          • Vl-make-idexpr-list
          • Vl-exprlist-resolved->vals
          • Vl-idexprlist->names
          • Vl-expr-names
          • Vl-expr-count
          • Vl-idexpr
          • Vl-exprlist-to-plainarglist
          • Vl-expr-atoms
          • Vl-expr-ops
          • Vl-expr-count-noatts
          • Vl-make-index
          • Vl-expr-selects
          • Vl-bitlist-from-nat
          • Vl-pps-expr
          • Vl-expr-add-atts
          • Vl-idexprlist-p
          • Vl-expr-resolved-p
          • Vl-pps-origexpr
          • Vl-expr-funnames
          • Vl-idexpr->name
          • Vl-idexpr-p
          • Vl-exprlist-funnames
          • Vl-resolved->val
          • Vl-exprlist-resolved-p
            • Vl-exprlist-resolved-p-basics
          • Vl-expr->atts
          • Vl-obviously-true-expr-p
          • Vl-obviously-false-expr-p
          • Vl-exprlist-has-funcalls
          • Vl-expr-has-funcalls
          • Vl-zbitlist-p
          • Vl-zatom-p
          • Vl-exprlist-has-ops
          • Vl-expr-has-ops
          • Vl-expr-varnames
          • Vl-one-bit-constants
        • Expr-slicing
        • Stripping-functions
        • Stmt-tools
        • Modnamespace
        • Vl-parse-expr-from-str
        • Welltyped
        • Reordering-by-name
        • Flat-warnings
        • Genblob
        • Expr-building
        • Datatype-tools
        • Syscalls
        • Relocate
        • Expr-cleaning
        • Namemangle
        • Caremask
        • Port-tools
        • Lvalues
      • Server
      • Kit
      • Printer
      • Esim-vl
      • Well-formedness
    • Sv
    • Fgl
    • Vwsim
    • Vl
    • X86isa
    • Svl
    • Rtl
  • Software-verification
  • Math
  • Testing-utilities

• Vl-exprlist-resolved-p

Vl-exprlist-resolved-p-basics

Basic theorems about vl-exprlist-resolved-p, generated by deflist.

Definitions and Theorems

Theorem: vl-exprlist-resolved-p-of-cons

(defthm vl-exprlist-resolved-p-of-cons
  (equal (vl-exprlist-resolved-p (cons acl2::a acl2::x))
         (and (vl-expr-resolved-p acl2::a)
              (vl-exprlist-resolved-p acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-cdr-when-vl-exprlist-resolved-p

(defthm vl-exprlist-resolved-p-of-cdr-when-vl-exprlist-resolved-p
  (implies (vl-exprlist-resolved-p (double-rewrite acl2::x))
           (vl-exprlist-resolved-p (cdr acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-when-not-consp

(defthm vl-exprlist-resolved-p-when-not-consp
  (implies (not (consp acl2::x))
           (vl-exprlist-resolved-p acl2::x))
  :rule-classes ((:rewrite)))

Theorem: vl-expr-resolved-p-of-car-when-vl-exprlist-resolved-p

(defthm vl-expr-resolved-p-of-car-when-vl-exprlist-resolved-p
  (implies (vl-exprlist-resolved-p acl2::x)
           (iff (vl-expr-resolved-p (car acl2::x))
                (or (consp acl2::x)
                    (vl-expr-resolved-p nil))))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-append

(defthm vl-exprlist-resolved-p-of-append
  (equal (vl-exprlist-resolved-p (append acl2::a acl2::b))
         (and (vl-exprlist-resolved-p acl2::a)
              (vl-exprlist-resolved-p acl2::b)))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-list-fix

(defthm vl-exprlist-resolved-p-of-list-fix
  (equal (vl-exprlist-resolved-p (list-fix acl2::x))
         (vl-exprlist-resolved-p acl2::x))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-sfix

(defthm vl-exprlist-resolved-p-of-sfix
  (iff (vl-exprlist-resolved-p (sfix acl2::x))
       (or (vl-exprlist-resolved-p acl2::x)
           (not (setp acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-insert

(defthm vl-exprlist-resolved-p-of-insert
  (iff (vl-exprlist-resolved-p (insert acl2::a acl2::x))
       (and (vl-exprlist-resolved-p (sfix acl2::x))
            (vl-expr-resolved-p acl2::a)))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-delete

(defthm vl-exprlist-resolved-p-of-delete
  (implies (vl-exprlist-resolved-p acl2::x)
           (vl-exprlist-resolved-p (delete acl2::k acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-mergesort

(defthm vl-exprlist-resolved-p-of-mergesort
  (iff (vl-exprlist-resolved-p (mergesort acl2::x))
       (vl-exprlist-resolved-p (list-fix acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-union

(defthm vl-exprlist-resolved-p-of-union
  (iff (vl-exprlist-resolved-p (union acl2::x acl2::y))
       (and (vl-exprlist-resolved-p (sfix acl2::x))
            (vl-exprlist-resolved-p (sfix acl2::y))))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-intersect-1

(defthm vl-exprlist-resolved-p-of-intersect-1
  (implies (vl-exprlist-resolved-p acl2::x)
           (vl-exprlist-resolved-p (intersect acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-intersect-2

(defthm vl-exprlist-resolved-p-of-intersect-2
  (implies (vl-exprlist-resolved-p acl2::y)
           (vl-exprlist-resolved-p (intersect acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-difference

(defthm vl-exprlist-resolved-p-of-difference
  (implies (vl-exprlist-resolved-p acl2::x)
           (vl-exprlist-resolved-p (difference acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-duplicated-members

(defthm vl-exprlist-resolved-p-of-duplicated-members
  (implies (vl-exprlist-resolved-p acl2::x)
           (vl-exprlist-resolved-p (duplicated-members acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-rev

(defthm vl-exprlist-resolved-p-of-rev
  (equal (vl-exprlist-resolved-p (rev acl2::x))
         (vl-exprlist-resolved-p (list-fix acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-rcons

(defthm vl-exprlist-resolved-p-of-rcons
  (iff (vl-exprlist-resolved-p (acl2::rcons acl2::a acl2::x))
       (and (vl-expr-resolved-p acl2::a)
            (vl-exprlist-resolved-p (list-fix acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: vl-expr-resolved-p-when-member-equal-of-vl-exprlist-resolved-p

(defthm
     vl-expr-resolved-p-when-member-equal-of-vl-exprlist-resolved-p
  (and (implies (and (member-equal acl2::a acl2::x)
                     (vl-exprlist-resolved-p acl2::x))
                (vl-expr-resolved-p acl2::a))
       (implies (and (vl-exprlist-resolved-p acl2::x)
                     (member-equal acl2::a acl2::x))
                (vl-expr-resolved-p acl2::a)))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-when-subsetp-equal

(defthm vl-exprlist-resolved-p-when-subsetp-equal
  (and (implies (and (subsetp-equal acl2::x acl2::y)
                     (vl-exprlist-resolved-p acl2::y))
                (vl-exprlist-resolved-p acl2::x))
       (implies (and (vl-exprlist-resolved-p acl2::y)
                     (subsetp-equal acl2::x acl2::y))
                (vl-exprlist-resolved-p acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-set-equiv-congruence

(defthm vl-exprlist-resolved-p-set-equiv-congruence
  (implies (set-equiv acl2::x acl2::y)
           (equal (vl-exprlist-resolved-p acl2::x)
                  (vl-exprlist-resolved-p acl2::y)))
  :rule-classes :congruence)

Theorem: vl-exprlist-resolved-p-of-set-difference-equal

(defthm vl-exprlist-resolved-p-of-set-difference-equal
 (implies
    (vl-exprlist-resolved-p acl2::x)
    (vl-exprlist-resolved-p (set-difference-equal acl2::x acl2::y)))
 :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-intersection-equal-1

(defthm vl-exprlist-resolved-p-of-intersection-equal-1
 (implies
      (vl-exprlist-resolved-p (double-rewrite acl2::x))
      (vl-exprlist-resolved-p (intersection-equal acl2::x acl2::y)))
 :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-intersection-equal-2

(defthm vl-exprlist-resolved-p-of-intersection-equal-2
 (implies
      (vl-exprlist-resolved-p (double-rewrite acl2::y))
      (vl-exprlist-resolved-p (intersection-equal acl2::x acl2::y)))
 :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-union-equal

(defthm vl-exprlist-resolved-p-of-union-equal
  (equal (vl-exprlist-resolved-p (union-equal acl2::x acl2::y))
         (and (vl-exprlist-resolved-p (list-fix acl2::x))
              (vl-exprlist-resolved-p (double-rewrite acl2::y))))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-take

(defthm vl-exprlist-resolved-p-of-take
  (implies (vl-exprlist-resolved-p (double-rewrite acl2::x))
           (iff (vl-exprlist-resolved-p (take acl2::n acl2::x))
                (or (vl-expr-resolved-p nil)
                    (<= (nfix acl2::n) (len acl2::x)))))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-repeat

(defthm vl-exprlist-resolved-p-of-repeat
  (iff (vl-exprlist-resolved-p (repeat acl2::n acl2::x))
       (or (vl-expr-resolved-p acl2::x)
           (zp acl2::n)))
  :rule-classes ((:rewrite)))

Theorem: vl-expr-resolved-p-of-nth-when-vl-exprlist-resolved-p

(defthm vl-expr-resolved-p-of-nth-when-vl-exprlist-resolved-p
  (implies (and (vl-exprlist-resolved-p acl2::x)
                (< (nfix acl2::n) (len acl2::x)))
           (vl-expr-resolved-p (nth acl2::n acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-update-nth

(defthm vl-exprlist-resolved-p-of-update-nth
 (implies
  (vl-exprlist-resolved-p (double-rewrite acl2::x))
  (iff (vl-exprlist-resolved-p (update-nth acl2::n acl2::y acl2::x))
       (and (vl-expr-resolved-p acl2::y)
            (or (<= (nfix acl2::n) (len acl2::x))
                (vl-expr-resolved-p nil)))))
 :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-butlast

(defthm vl-exprlist-resolved-p-of-butlast
  (implies (vl-exprlist-resolved-p (double-rewrite acl2::x))
           (vl-exprlist-resolved-p (butlast acl2::x acl2::n)))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-nthcdr

(defthm vl-exprlist-resolved-p-of-nthcdr
  (implies (vl-exprlist-resolved-p (double-rewrite acl2::x))
           (vl-exprlist-resolved-p (nthcdr acl2::n acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-last

(defthm vl-exprlist-resolved-p-of-last
  (implies (vl-exprlist-resolved-p (double-rewrite acl2::x))
           (vl-exprlist-resolved-p (last acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-remove

(defthm vl-exprlist-resolved-p-of-remove
  (implies (vl-exprlist-resolved-p acl2::x)
           (vl-exprlist-resolved-p (remove acl2::a acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-exprlist-resolved-p-of-revappend

(defthm vl-exprlist-resolved-p-of-revappend
  (equal (vl-exprlist-resolved-p (revappend acl2::x acl2::y))
         (and (vl-exprlist-resolved-p (list-fix acl2::x))
              (vl-exprlist-resolved-p acl2::y)))
  :rule-classes ((:rewrite)))