• Top
  • Documentation
  • Books
  • Recursion-and-induction
  • Boolean-reasoning
  • Debugging
  • Projects
  • Std
    • Std/lists
    • Std/alists
    • Obags
    • Std/util
    • Std/strings
    • Std/io
    • Std/osets
    • Std/system
      • Fresh-logical-name-with-$s-suffix
      • Irrelevant-formals-info
      • Std/system/function-queries
      • Std/system/term-queries
      • Std/system/term-transformations
      • Std/system/enhanced-utilities
      • Install-not-normalized-event
      • Install-not-normalized-event-lst
      • Std/system/term-function-recognizers
      • Genvar$
      • Std/system/event-name-queries
      • Pseudo-tests-and-call-listp
        • Pseudo-tests-and-call-listp-basics
      • Maybe-pseudo-event-formp
      • Add-suffix-to-fn-or-const
      • Chk-irrelevant-formals-ok
      • Std/system/good-atom-listp
      • Table-alist+
      • Pseudo-tests-and-callp
      • Add-suffix-to-fn-or-const-lst
      • Known-packages+
      • Add-suffix-to-fn-lst
      • Unquote-term
      • Event-landmark-names
      • Add-suffix-lst
      • Std/system/theorem-queries
      • Unquote-term-list
      • Std/system/macro-queries
      • Pseudo-command-landmark-listp
      • Install-not-normalized$
      • Pseudo-event-landmark-listp
      • Known-packages
      • Std/system/partition-rest-and-keyword-args
      • Rune-enabledp
      • Rune-disabledp
      • Included-books
      • Std/system/pseudo-event-formp
      • Std/system/plist-worldp-with-formals
      • Std/system/w
      • Std/system/geprops
      • Std/system/arglistp
      • Std/system-extensions
      • Std/system/constant-queries
    • Std/basic
    • Std/typed-lists
    • Std/bitsets
    • Std/testing
    • Std/typed-alists
    • Std/stobjs
    • Std-extensions
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
  • Testing-utilities
  • Math

• Pseudo-tests-and-call-listp

Pseudo-tests-and-call-listp-basics

Basic theorems about pseudo-tests-and-call-listp, generated by std::deflist.

Definitions and Theorems

Theorem: pseudo-tests-and-call-listp-of-cons

(defthm pseudo-tests-and-call-listp-of-cons
  (equal (pseudo-tests-and-call-listp (cons a x))
         (and (pseudo-tests-and-callp a)
              (pseudo-tests-and-call-listp x)))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-cdr-when-pseudo-tests-and-call-listp

(defthm
 pseudo-tests-and-call-listp-of-cdr-when-pseudo-tests-and-call-listp
 (implies (pseudo-tests-and-call-listp (double-rewrite x))
          (pseudo-tests-and-call-listp (cdr x)))
 :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-when-not-consp

(defthm pseudo-tests-and-call-listp-when-not-consp
  (implies (not (consp x))
           (equal (pseudo-tests-and-call-listp x)
                  (not x)))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-callp-of-car-when-pseudo-tests-and-call-listp

(defthm
     pseudo-tests-and-callp-of-car-when-pseudo-tests-and-call-listp
  (implies (pseudo-tests-and-call-listp x)
           (iff (pseudo-tests-and-callp (car x))
                (consp x)))
  :rule-classes ((:rewrite)))

Theorem: true-listp-when-pseudo-tests-and-call-listp-compound-recognizer

(defthm
    true-listp-when-pseudo-tests-and-call-listp-compound-recognizer
  (implies (pseudo-tests-and-call-listp x)
           (true-listp x))
  :rule-classes :compound-recognizer)

Theorem: pseudo-tests-and-call-listp-of-list-fix

(defthm pseudo-tests-and-call-listp-of-list-fix
  (implies (pseudo-tests-and-call-listp x)
           (pseudo-tests-and-call-listp (list-fix x)))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-sfix

(defthm pseudo-tests-and-call-listp-of-sfix
  (iff (pseudo-tests-and-call-listp (set::sfix x))
       (or (pseudo-tests-and-call-listp x)
           (not (set::setp x))))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-insert

(defthm pseudo-tests-and-call-listp-of-insert
  (iff (pseudo-tests-and-call-listp (set::insert a x))
       (and (pseudo-tests-and-call-listp (set::sfix x))
            (pseudo-tests-and-callp a)))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-delete

(defthm pseudo-tests-and-call-listp-of-delete
  (implies (pseudo-tests-and-call-listp x)
           (pseudo-tests-and-call-listp (set::delete k x)))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-mergesort

(defthm pseudo-tests-and-call-listp-of-mergesort
  (iff (pseudo-tests-and-call-listp (set::mergesort x))
       (pseudo-tests-and-call-listp (list-fix x)))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-union

(defthm pseudo-tests-and-call-listp-of-union
  (iff (pseudo-tests-and-call-listp (set::union x y))
       (and (pseudo-tests-and-call-listp (set::sfix x))
            (pseudo-tests-and-call-listp (set::sfix y))))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-intersect-1

(defthm pseudo-tests-and-call-listp-of-intersect-1
  (implies (pseudo-tests-and-call-listp x)
           (pseudo-tests-and-call-listp (set::intersect x y)))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-intersect-2

(defthm pseudo-tests-and-call-listp-of-intersect-2
  (implies (pseudo-tests-and-call-listp y)
           (pseudo-tests-and-call-listp (set::intersect x y)))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-difference

(defthm pseudo-tests-and-call-listp-of-difference
  (implies (pseudo-tests-and-call-listp x)
           (pseudo-tests-and-call-listp (set::difference x y)))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-duplicated-members

(defthm pseudo-tests-and-call-listp-of-duplicated-members
  (implies (pseudo-tests-and-call-listp x)
           (pseudo-tests-and-call-listp (duplicated-members x)))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-rev

(defthm pseudo-tests-and-call-listp-of-rev
  (equal (pseudo-tests-and-call-listp (rev x))
         (pseudo-tests-and-call-listp (list-fix x)))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-append

(defthm pseudo-tests-and-call-listp-of-append
  (equal (pseudo-tests-and-call-listp (append a b))
         (and (pseudo-tests-and-call-listp (list-fix a))
              (pseudo-tests-and-call-listp b)))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-rcons

(defthm pseudo-tests-and-call-listp-of-rcons
  (iff (pseudo-tests-and-call-listp (rcons a x))
       (and (pseudo-tests-and-callp a)
            (pseudo-tests-and-call-listp (list-fix x))))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-callp-when-member-equal-of-pseudo-tests-and-call-listp

(defthm
 pseudo-tests-and-callp-when-member-equal-of-pseudo-tests-and-call-listp
 (and (implies (and (member-equal a x)
                    (pseudo-tests-and-call-listp x))
               (pseudo-tests-and-callp a))
      (implies (and (pseudo-tests-and-call-listp x)
                    (member-equal a x))
               (pseudo-tests-and-callp a)))
 :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-when-subsetp-equal

(defthm pseudo-tests-and-call-listp-when-subsetp-equal
  (and (implies (and (subsetp-equal x y)
                     (pseudo-tests-and-call-listp y))
                (equal (pseudo-tests-and-call-listp x)
                       (true-listp x)))
       (implies (and (pseudo-tests-and-call-listp y)
                     (subsetp-equal x y))
                (equal (pseudo-tests-and-call-listp x)
                       (true-listp x))))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-set-difference-equal

(defthm pseudo-tests-and-call-listp-of-set-difference-equal
  (implies (pseudo-tests-and-call-listp x)
           (pseudo-tests-and-call-listp (set-difference-equal x y)))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-intersection-equal-1

(defthm pseudo-tests-and-call-listp-of-intersection-equal-1
  (implies (pseudo-tests-and-call-listp (double-rewrite x))
           (pseudo-tests-and-call-listp (intersection-equal x y)))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-intersection-equal-2

(defthm pseudo-tests-and-call-listp-of-intersection-equal-2
  (implies (pseudo-tests-and-call-listp (double-rewrite y))
           (pseudo-tests-and-call-listp (intersection-equal x y)))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-union-equal

(defthm pseudo-tests-and-call-listp-of-union-equal
  (equal (pseudo-tests-and-call-listp (union-equal x y))
         (and (pseudo-tests-and-call-listp (list-fix x))
              (pseudo-tests-and-call-listp (double-rewrite y))))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-take

(defthm pseudo-tests-and-call-listp-of-take
  (implies (pseudo-tests-and-call-listp (double-rewrite x))
           (iff (pseudo-tests-and-call-listp (take n x))
                (or (pseudo-tests-and-callp nil)
                    (<= (nfix n) (len x)))))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-repeat

(defthm pseudo-tests-and-call-listp-of-repeat
  (iff (pseudo-tests-and-call-listp (repeat n x))
       (or (pseudo-tests-and-callp x) (zp n)))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-callp-of-nth-when-pseudo-tests-and-call-listp

(defthm
     pseudo-tests-and-callp-of-nth-when-pseudo-tests-and-call-listp
  (implies (pseudo-tests-and-call-listp x)
           (iff (pseudo-tests-and-callp (nth n x))
                (< (nfix n) (len x))))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-update-nth

(defthm pseudo-tests-and-call-listp-of-update-nth
  (implies (pseudo-tests-and-call-listp (double-rewrite x))
           (iff (pseudo-tests-and-call-listp (update-nth n y x))
                (and (pseudo-tests-and-callp y)
                     (or (<= (nfix n) (len x))
                         (pseudo-tests-and-callp nil)))))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-butlast

(defthm pseudo-tests-and-call-listp-of-butlast
  (implies (pseudo-tests-and-call-listp (double-rewrite x))
           (pseudo-tests-and-call-listp (butlast x n)))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-nthcdr

(defthm pseudo-tests-and-call-listp-of-nthcdr
  (implies (pseudo-tests-and-call-listp (double-rewrite x))
           (pseudo-tests-and-call-listp (nthcdr n x)))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-last

(defthm pseudo-tests-and-call-listp-of-last
  (implies (pseudo-tests-and-call-listp (double-rewrite x))
           (pseudo-tests-and-call-listp (last x)))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-remove

(defthm pseudo-tests-and-call-listp-of-remove
  (implies (pseudo-tests-and-call-listp x)
           (pseudo-tests-and-call-listp (remove a x)))
  :rule-classes ((:rewrite)))

Theorem: pseudo-tests-and-call-listp-of-revappend

(defthm pseudo-tests-and-call-listp-of-revappend
  (equal (pseudo-tests-and-call-listp (revappend x y))
         (and (pseudo-tests-and-call-listp (list-fix x))
              (pseudo-tests-and-call-listp y)))
  :rule-classes ((:rewrite)))