• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Debugging
  • Projects
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
    • Gl
    • Esim
    • Vl2014
    • Sv
    • Vwsim
    • Fgl
    • Vl
      • Syntax
      • Loader
      • Warnings
      • Getting-started
      • Utilities
      • Printer
      • Kit
      • Mlib
      • Transforms
        • Unparameterization
        • Elaborate
        • Addnames
        • Annotate
          • Increment-elim
          • Make-implicit-wires
          • Basic-bind-elim
          • Argresolve
          • Basicsanity
          • Portdecl-sign
          • Enum-names
            • Vl-enumname-range-declarations
            • Vl-interfacelist-add-enumname-declarations
            • Vl-packagelist-add-enumname-declarations
            • Vl-modulelist-add-enumname-declarations
            • Vl-classlist-add-enumname-declarations
            • Vl-enumitemlist-enumname-declarations
            • Vl-enumname-declarations
            • Vl-paramdecl-enumname-declarations
            • Vl-paramdecllist-enumname-declarations
            • Vl-vardecllist-enumname-declarations
            • Vl-typedeflist-enumname-declarations
            • Vl-vardecl-enumname-declarations
            • Vl-typedef-enumname-declarations
            • Vl-package-add-enumname-declarations
            • Vl-design-add-enumname-declarations
            • Vl-interface-add-enumname-declarations
            • Vl-class-add-enumname-declarations
            • Vl-module-add-enumname-declarations
            • Vl-datatype-map
              • Vl-datatype-map-p
              • Vl-datatype-map-fix
              • Vl-datatype-map-equiv
          • Port-resolve
          • Udp-elim
          • Vl-annotate-design
          • Vl-annotate-module
        • Clean-warnings
        • Eliminitial
        • Custom-transform-hooks
        • Problem-modules
    • Svl
    • X86isa
    • Rtl
  • Software-verification
  • Math
  • Testing-utilities

• Vl-datatype-map

Vl-datatype-map-p

Recognizer for vl-datatype-map.

Signature

(vl-datatype-map-p x) → *

Definitions and Theorems

Function: vl-datatype-map-p

(defun vl-datatype-map-p (x)
  (declare (xargs :guard t))
  (let ((__function__ 'vl-datatype-map-p))
    (declare (ignorable __function__))
    (if (atom x)
        (eq x nil)
      (and (consp (car x))
           (vl-datatype-p (caar x))
           (vl-datatype-p (cdar x))
           (vl-datatype-map-p (cdr x))))))

Theorem: vl-datatype-map-p-of-revappend

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

Theorem: vl-datatype-map-p-of-remove

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

Theorem: vl-datatype-map-p-of-last

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

Theorem: vl-datatype-map-p-of-nthcdr

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

Theorem: vl-datatype-map-p-of-butlast

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

Theorem: vl-datatype-map-p-of-update-nth

(defthm vl-datatype-map-p-of-update-nth
  (implies
       (vl-datatype-map-p (double-rewrite acl2::x))
       (iff (vl-datatype-map-p (update-nth acl2::n acl2::y acl2::x))
            (and (and (consp acl2::y)
                      (vl-datatype-p (car acl2::y))
                      (vl-datatype-p (cdr acl2::y)))
                 (or (<= (nfix acl2::n) (len acl2::x))
                     (and (consp nil)
                          (vl-datatype-p (car nil))
                          (vl-datatype-p (cdr nil)))))))
  :rule-classes ((:rewrite)))

Theorem: vl-datatype-map-p-of-repeat

(defthm vl-datatype-map-p-of-repeat
  (iff (vl-datatype-map-p (repeat acl2::n acl2::x))
       (or (and (consp acl2::x)
                (vl-datatype-p (car acl2::x))
                (vl-datatype-p (cdr acl2::x)))
           (zp acl2::n)))
  :rule-classes ((:rewrite)))

Theorem: vl-datatype-map-p-of-take

(defthm vl-datatype-map-p-of-take
  (implies (vl-datatype-map-p (double-rewrite acl2::x))
           (iff (vl-datatype-map-p (take acl2::n acl2::x))
                (or (and (consp nil)
                         (vl-datatype-p (car nil))
                         (vl-datatype-p (cdr nil)))
                    (<= (nfix acl2::n) (len acl2::x)))))
  :rule-classes ((:rewrite)))

Theorem: vl-datatype-map-p-of-union-equal

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

Theorem: vl-datatype-map-p-of-intersection-equal-2

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

Theorem: vl-datatype-map-p-of-intersection-equal-1

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

Theorem: vl-datatype-map-p-of-set-difference-equal

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

Theorem: vl-datatype-map-p-when-subsetp-equal

(defthm vl-datatype-map-p-when-subsetp-equal
  (and (implies (and (subsetp-equal acl2::x acl2::y)
                     (vl-datatype-map-p acl2::y))
                (equal (vl-datatype-map-p acl2::x)
                       (true-listp acl2::x)))
       (implies (and (vl-datatype-map-p acl2::y)
                     (subsetp-equal acl2::x acl2::y))
                (equal (vl-datatype-map-p acl2::x)
                       (true-listp acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: vl-datatype-map-p-of-rcons

(defthm vl-datatype-map-p-of-rcons
  (iff (vl-datatype-map-p (acl2::rcons acl2::a acl2::x))
       (and (and (consp acl2::a)
                 (vl-datatype-p (car acl2::a))
                 (vl-datatype-p (cdr acl2::a)))
            (vl-datatype-map-p (list-fix acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: vl-datatype-map-p-of-append

(defthm vl-datatype-map-p-of-append
  (equal (vl-datatype-map-p (append acl2::a acl2::b))
         (and (vl-datatype-map-p (list-fix acl2::a))
              (vl-datatype-map-p acl2::b)))
  :rule-classes ((:rewrite)))

Theorem: vl-datatype-map-p-of-rev

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

Theorem: vl-datatype-map-p-of-duplicated-members

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

Theorem: vl-datatype-map-p-of-difference

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

Theorem: vl-datatype-map-p-of-intersect-2

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

Theorem: vl-datatype-map-p-of-intersect-1

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

Theorem: vl-datatype-map-p-of-union

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

Theorem: vl-datatype-map-p-of-mergesort

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

Theorem: vl-datatype-map-p-of-delete

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

Theorem: vl-datatype-map-p-of-insert

(defthm vl-datatype-map-p-of-insert
  (iff (vl-datatype-map-p (insert acl2::a acl2::x))
       (and (vl-datatype-map-p (sfix acl2::x))
            (and (consp acl2::a)
                 (vl-datatype-p (car acl2::a))
                 (vl-datatype-p (cdr acl2::a)))))
  :rule-classes ((:rewrite)))

Theorem: vl-datatype-map-p-of-sfix

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

Theorem: vl-datatype-map-p-of-list-fix

(defthm vl-datatype-map-p-of-list-fix
  (implies (vl-datatype-map-p acl2::x)
           (vl-datatype-map-p (list-fix acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: true-listp-when-vl-datatype-map-p-compound-recognizer

(defthm true-listp-when-vl-datatype-map-p-compound-recognizer
  (implies (vl-datatype-map-p acl2::x)
           (true-listp acl2::x))
  :rule-classes :compound-recognizer)

Theorem: vl-datatype-map-p-when-not-consp

(defthm vl-datatype-map-p-when-not-consp
  (implies (not (consp acl2::x))
           (equal (vl-datatype-map-p acl2::x)
                  (not acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-datatype-map-p-of-cdr-when-vl-datatype-map-p

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

Theorem: vl-datatype-map-p-of-cons

(defthm vl-datatype-map-p-of-cons
  (equal (vl-datatype-map-p (cons acl2::a acl2::x))
         (and (and (consp acl2::a)
                   (vl-datatype-p (car acl2::a))
                   (vl-datatype-p (cdr acl2::a)))
              (vl-datatype-map-p acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-datatype-map-p-of-make-fal

(defthm vl-datatype-map-p-of-make-fal
  (implies (and (vl-datatype-map-p acl2::x)
                (vl-datatype-map-p acl2::y))
           (vl-datatype-map-p (make-fal acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: vl-datatype-p-of-cdr-when-member-equal-of-vl-datatype-map-p

(defthm vl-datatype-p-of-cdr-when-member-equal-of-vl-datatype-map-p
  (and (implies (and (vl-datatype-map-p acl2::x)
                     (member-equal acl2::a acl2::x))
                (vl-datatype-p (cdr acl2::a)))
       (implies (and (member-equal acl2::a acl2::x)
                     (vl-datatype-map-p acl2::x))
                (vl-datatype-p (cdr acl2::a))))
  :rule-classes ((:rewrite)))

Theorem: vl-datatype-p-of-car-when-member-equal-of-vl-datatype-map-p

(defthm vl-datatype-p-of-car-when-member-equal-of-vl-datatype-map-p
  (and (implies (and (vl-datatype-map-p acl2::x)
                     (member-equal acl2::a acl2::x))
                (vl-datatype-p (car acl2::a)))
       (implies (and (member-equal acl2::a acl2::x)
                     (vl-datatype-map-p acl2::x))
                (vl-datatype-p (car acl2::a))))
  :rule-classes ((:rewrite)))

Theorem: consp-when-member-equal-of-vl-datatype-map-p

(defthm consp-when-member-equal-of-vl-datatype-map-p
  (implies (and (vl-datatype-map-p acl2::x)
                (member-equal acl2::a acl2::x))
           (consp acl2::a))
  :rule-classes
  ((:rewrite :backchain-limit-lst (0 0))
   (:rewrite :backchain-limit-lst (0 0)
             :corollary (implies (if (member-equal acl2::a acl2::x)
                                     (vl-datatype-map-p acl2::x)
                                   'nil)
                                 (consp acl2::a)))))

Theorem: vl-datatype-map-p-of-remove-assoc

(defthm vl-datatype-map-p-of-remove-assoc
  (implies
       (vl-datatype-map-p acl2::x)
       (vl-datatype-map-p (remove-assoc-equal acl2::name acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-datatype-map-p-of-put-assoc

(defthm vl-datatype-map-p-of-put-assoc
  (implies (and (vl-datatype-map-p acl2::x))
           (iff (vl-datatype-map-p
                     (put-assoc-equal acl2::name acl2::val acl2::x))
                (and (vl-datatype-p acl2::name)
                     (vl-datatype-p acl2::val))))
  :rule-classes ((:rewrite)))

Theorem: vl-datatype-map-p-of-fast-alist-clean

(defthm vl-datatype-map-p-of-fast-alist-clean
  (implies (vl-datatype-map-p acl2::x)
           (vl-datatype-map-p (fast-alist-clean acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-datatype-map-p-of-hons-shrink-alist

(defthm vl-datatype-map-p-of-hons-shrink-alist
  (implies (and (vl-datatype-map-p acl2::x)
                (vl-datatype-map-p acl2::y))
           (vl-datatype-map-p (hons-shrink-alist acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: vl-datatype-map-p-of-hons-acons

(defthm vl-datatype-map-p-of-hons-acons
  (equal (vl-datatype-map-p (hons-acons acl2::a acl2::n acl2::x))
         (and (vl-datatype-p acl2::a)
              (vl-datatype-p acl2::n)
              (vl-datatype-map-p acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-datatype-p-of-cdr-of-hons-assoc-equal-when-vl-datatype-map-p

(defthm
    vl-datatype-p-of-cdr-of-hons-assoc-equal-when-vl-datatype-map-p
  (implies
       (vl-datatype-map-p acl2::x)
       (iff (vl-datatype-p (cdr (hons-assoc-equal acl2::k acl2::x)))
            (or (hons-assoc-equal acl2::k acl2::x)
                (vl-datatype-p nil))))
  :rule-classes ((:rewrite)))

Theorem: alistp-when-vl-datatype-map-p-rewrite

(defthm alistp-when-vl-datatype-map-p-rewrite
  (implies (vl-datatype-map-p acl2::x)
           (alistp acl2::x))
  :rule-classes ((:rewrite)))

Theorem: alistp-when-vl-datatype-map-p

(defthm alistp-when-vl-datatype-map-p
  (implies (vl-datatype-map-p acl2::x)
           (alistp acl2::x))
  :rule-classes :tau-system)

Theorem: vl-datatype-p-of-cdar-when-vl-datatype-map-p

(defthm vl-datatype-p-of-cdar-when-vl-datatype-map-p
  (implies (vl-datatype-map-p acl2::x)
           (iff (vl-datatype-p (cdar acl2::x))
                (or (consp acl2::x)
                    (vl-datatype-p nil))))
  :rule-classes ((:rewrite)))

Theorem: vl-datatype-p-of-caar-when-vl-datatype-map-p

(defthm vl-datatype-p-of-caar-when-vl-datatype-map-p
  (implies (vl-datatype-map-p acl2::x)
           (iff (vl-datatype-p (caar acl2::x))
                (or (consp acl2::x)
                    (vl-datatype-p nil))))
  :rule-classes ((:rewrite)))