• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Community
  • Std
    • Std/lists
    • Omaps
    • Std/alists
    • Obags
    • Std/util
    • Std/strings
      • Pretty-printing
        • Pretty-printing-implementation
          • Missing-functionality
          • Printconfig
          • Cons-ppr1
          • Print-escaped-charlist
          • Atom-size
          • Print-escaped-str
          • Obj-size
          • Maybe-merge-flat
          • Ppr
          • Printer-instructions
            • Pinst
            • Pflat
            • Pinstlist
              • Pinstlist-equiv
              • Pinstlist-p
                • Pinstlist-p-basics
              • Pinstlist-fix
          • Keyword-param-valuep
          • Print-flat-objs
          • Radix-print-int
          • Print-escaped-atom
          • Print-atom
          • Print-escaped-symbol
          • Radix-print-complex
          • Basic-print-complex
          • Radix-print-rat
          • Spaces1
          • Basic-print-rat
          • Basic-print-nat
          • Basic-print-int
          • Spaces
          • My-needs-slashes
          • Pinstlist->max-width
          • Nat-size
          • Special-term-num
          • Print-column
          • Print-base-fix
          • Int-size
          • Keyword-fix
          • Print-instruction
          • Pinst->width
          • In-home-package-p
          • Eviscerated->guts
          • Evisceratedp
          • Pprdot
        • Eviscerate
        • Pretty
        • Revappend-pretty
        • Pretty-list
      • Printtree
      • Base64
      • Charset-p
      • Strtok!
      • Cases
      • Concatenation
      • Character-kinds
      • Html-encoding
      • Substrings
      • Strtok
      • Equivalences
      • Url-encoding
      • Lines
      • Explode-implode-equalities
      • Ordering
      • Numbers
      • Pad-trim
      • Coercion
      • Std/strings/digit-to-char
      • Substitution
      • Symbols
    • Std/osets
    • Std/io
    • Std/basic
    • Std/system
    • Std/typed-lists
    • Std/bitsets
    • Std/testing
    • Std/typed-alists
    • Std/stobjs
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
  • Math
  • Testing-utilities

• Pinstlist-p

Pinstlist-p-basics

Basic theorems about pinstlist-p, generated by std::deflist.

Definitions and Theorems

Theorem: pinstlist-p-of-cons

(defthm pinstlist-p-of-cons
  (equal (pinstlist-p (cons a x))
         (and (pinst-p a) (pinstlist-p x)))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-cdr-when-pinstlist-p

(defthm pinstlist-p-of-cdr-when-pinstlist-p
  (implies (pinstlist-p (double-rewrite x))
           (pinstlist-p (cdr x)))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-when-not-consp

(defthm pinstlist-p-when-not-consp
  (implies (not (consp x))
           (pinstlist-p x))
  :rule-classes ((:rewrite)))

Theorem: pinst-p-of-car-when-pinstlist-p

(defthm pinst-p-of-car-when-pinstlist-p
  (implies (pinstlist-p x)
           (iff (pinst-p (car x))
                (or (consp x) (pinst-p nil))))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-append

(defthm pinstlist-p-of-append
  (equal (pinstlist-p (append a b))
         (and (pinstlist-p a) (pinstlist-p b)))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-list-fix

(defthm pinstlist-p-of-list-fix
  (equal (pinstlist-p (list-fix x))
         (pinstlist-p x))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-sfix

(defthm pinstlist-p-of-sfix
  (iff (pinstlist-p (set::sfix x))
       (or (pinstlist-p x)
           (not (set::setp x))))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-insert

(defthm pinstlist-p-of-insert
  (iff (pinstlist-p (set::insert a x))
       (and (pinstlist-p (set::sfix x))
            (pinst-p a)))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-delete

(defthm pinstlist-p-of-delete
  (implies (pinstlist-p x)
           (pinstlist-p (set::delete k x)))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-mergesort

(defthm pinstlist-p-of-mergesort
  (iff (pinstlist-p (set::mergesort x))
       (pinstlist-p (list-fix x)))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-union

(defthm pinstlist-p-of-union
  (iff (pinstlist-p (set::union x y))
       (and (pinstlist-p (set::sfix x))
            (pinstlist-p (set::sfix y))))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-intersect-1

(defthm pinstlist-p-of-intersect-1
  (implies (pinstlist-p x)
           (pinstlist-p (set::intersect x y)))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-intersect-2

(defthm pinstlist-p-of-intersect-2
  (implies (pinstlist-p y)
           (pinstlist-p (set::intersect x y)))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-difference

(defthm pinstlist-p-of-difference
  (implies (pinstlist-p x)
           (pinstlist-p (set::difference x y)))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-duplicated-members

(defthm pinstlist-p-of-duplicated-members
  (implies (pinstlist-p x)
           (pinstlist-p (acl2::duplicated-members x)))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-rev

(defthm pinstlist-p-of-rev
  (equal (pinstlist-p (rev x))
         (pinstlist-p (list-fix x)))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-rcons

(defthm pinstlist-p-of-rcons
  (iff (pinstlist-p (acl2::rcons a x))
       (and (pinst-p a)
            (pinstlist-p (list-fix x))))
  :rule-classes ((:rewrite)))

Theorem: pinst-p-when-member-equal-of-pinstlist-p

(defthm pinst-p-when-member-equal-of-pinstlist-p
  (and (implies (and (member-equal a x) (pinstlist-p x))
                (pinst-p a))
       (implies (and (pinstlist-p x) (member-equal a x))
                (pinst-p a)))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-when-subsetp-equal

(defthm pinstlist-p-when-subsetp-equal
  (and (implies (and (subsetp-equal x y)
                     (pinstlist-p y))
                (pinstlist-p x))
       (implies (and (pinstlist-p y)
                     (subsetp-equal x y))
                (pinstlist-p x)))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-set-equiv-congruence

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

Theorem: pinstlist-p-of-set-difference-equal

(defthm pinstlist-p-of-set-difference-equal
  (implies (pinstlist-p x)
           (pinstlist-p (set-difference-equal x y)))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-intersection-equal-1

(defthm pinstlist-p-of-intersection-equal-1
  (implies (pinstlist-p (double-rewrite x))
           (pinstlist-p (intersection-equal x y)))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-intersection-equal-2

(defthm pinstlist-p-of-intersection-equal-2
  (implies (pinstlist-p (double-rewrite y))
           (pinstlist-p (intersection-equal x y)))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-union-equal

(defthm pinstlist-p-of-union-equal
  (equal (pinstlist-p (union-equal x y))
         (and (pinstlist-p (list-fix x))
              (pinstlist-p (double-rewrite y))))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-take

(defthm pinstlist-p-of-take
  (implies (pinstlist-p (double-rewrite x))
           (iff (pinstlist-p (take n x))
                (or (pinst-p nil)
                    (<= (nfix n) (len x)))))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-repeat

(defthm pinstlist-p-of-repeat
  (iff (pinstlist-p (repeat n x))
       (or (pinst-p x) (zp n)))
  :rule-classes ((:rewrite)))

Theorem: pinst-p-of-nth-when-pinstlist-p

(defthm pinst-p-of-nth-when-pinstlist-p
  (implies (and (pinstlist-p x)
                (< (nfix n) (len x)))
           (pinst-p (nth n x)))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-update-nth

(defthm pinstlist-p-of-update-nth
  (implies (pinstlist-p (double-rewrite x))
           (iff (pinstlist-p (update-nth n y x))
                (and (pinst-p y)
                     (or (<= (nfix n) (len x))
                         (pinst-p nil)))))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-butlast

(defthm pinstlist-p-of-butlast
  (implies (pinstlist-p (double-rewrite x))
           (pinstlist-p (butlast x n)))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-nthcdr

(defthm pinstlist-p-of-nthcdr
  (implies (pinstlist-p (double-rewrite x))
           (pinstlist-p (nthcdr n x)))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-last

(defthm pinstlist-p-of-last
  (implies (pinstlist-p (double-rewrite x))
           (pinstlist-p (last x)))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-remove

(defthm pinstlist-p-of-remove
  (implies (pinstlist-p x)
           (pinstlist-p (remove a x)))
  :rule-classes ((:rewrite)))

Theorem: pinstlist-p-of-revappend

(defthm pinstlist-p-of-revappend
  (equal (pinstlist-p (revappend x y))
         (and (pinstlist-p (list-fix x))
              (pinstlist-p y)))
  :rule-classes ((:rewrite)))