• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Community
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
      • Kestrel-books
        • Crypto-hdwallet
        • Apt
        • Error-checking
        • Fty-extensions
        • Isar
        • Kestrel-utilities
          • Directed-untranslate
          • Include-book-paths
          • Ubi
          • Numbered-names
          • Digits-any-base
          • Context-message-pair
          • With-auto-termination
          • Make-termination-theorem
          • Theorems-about-true-list-lists
          • Checkpoint-list
          • Sublis-expr+
          • Integers-from-to
          • Prove$
          • Defthm<w
          • System-utilities-non-built-in
            • Pseudo-event-formp
            • Pseudo-event-form-listp
              • Pseudo-event-form-listp-basics
                • Pseudo-event-form-list
              • Directed-untranslate
              • Irrelevant-formals-info
              • Numbered-names
              • Context-message-pair
              • Prove$
              • Minimize-ruler-extenders
              • Paired-names
              • Orelse
              • Fresh-name-in-world-with-$s
              • Encapsulate-report-errors
              • On-failure
              • Chk-irrelevant-formals-ok
              • Named-formulas
              • Pseudo-event-landmarkp
              • All-program-fns
              • All-logic-fns
              • Trans-eval-error-triple
              • Trans-eval-state
              • Pseudo-tests-and-callsp
              • User-interface
              • Pseudo-command-landmarkp
              • Pseudo-tests-and-calls-listp
              • Pseudo-command-formp
              • Orelse*
              • Identity-macro
            • Integer-range-fix
            • Minimize-ruler-extenders
            • Add-const-to-untranslate-preprocess
            • Unsigned-byte-fix
            • Signed-byte-fix
            • Defthmr
            • Paired-names
            • Unsigned-byte-list-fix
            • Signed-byte-list-fix
            • Show-books
            • Skip-in-book
            • Typed-tuplep
            • List-utilities
            • Checkpoint-list-pretty
            • Defunt
            • Keyword-value-list-to-alist
            • Magic-macroexpand
            • Top-command-number-fn
            • Bits-as-digits-in-base-2
            • Show-checkpoint-list
            • Ubyte11s-as-digits-in-base-2048
            • Named-formulas
            • Bytes-as-digits-in-base-256
            • String-utilities
            • Make-keyword-value-list-from-keys-and-value
            • Defmacroq
            • Integer-range-listp
            • Apply-fn-if-known
            • Trans-eval-error-triple
            • Checkpoint-info-list
            • Previous-subsumer-hints
            • Fms!-lst
            • Zp-listp
            • Trans-eval-state
            • Injections
            • Doublets-to-alist
            • Theorems-about-osets
            • Typed-list-utilities
            • Message-utilities
            • Book-runes-alist
            • User-interface
            • Bits/ubyte11s-digit-grouping
            • Bits/bytes-digit-grouping
            • Subsetp-eq-linear
            • Oset-utilities
            • Strict-merge-sort-<
            • Miscellaneous-enumerations
            • Maybe-unquote
            • Thm<w
            • Defthmd<w
            • Io-utilities
          • Set
          • C
          • Soft
          • Bv
          • Imp-language
          • Ethereum
          • Event-macros
          • Java
          • Riscv
          • Bitcoin
          • Zcash
          • Yul
          • ACL2-programming-language
          • Prime-fields
          • Json
          • Syntheto
          • File-io-light
          • Cryptography
          • Number-theory
          • Axe
          • Lists-light
          • Builtins
          • Solidity
          • Helpers
          • Htclient
          • Typed-lists-light
          • Arithmetic-light
        • X86isa
        • Axe
        • Execloader
      • Math
      • Testing-utilities
    • Pseudo-event-form-listp

    Pseudo-event-form-listp-basics

    Basic theorems about pseudo-event-form-listp, generated by std::deflist.

    Definitions and Theorems

    Theorem: pseudo-event-form-listp-of-cons

    (defthm pseudo-event-form-listp-of-cons
      (equal (pseudo-event-form-listp (cons a x))
             (and (pseudo-event-formp a)
                  (pseudo-event-form-listp x)))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-form-listp-of-cdr-when-pseudo-event-form-listp

    (defthm pseudo-event-form-listp-of-cdr-when-pseudo-event-form-listp
      (implies (pseudo-event-form-listp (double-rewrite x))
               (pseudo-event-form-listp (cdr x)))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-form-listp-when-not-consp

    (defthm pseudo-event-form-listp-when-not-consp
      (implies (not (consp x))
               (equal (pseudo-event-form-listp x)
                      (not x)))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-formp-of-car-when-pseudo-event-form-listp

    (defthm pseudo-event-formp-of-car-when-pseudo-event-form-listp
      (implies (pseudo-event-form-listp x)
               (iff (pseudo-event-formp (car x))
                    (consp x)))
      :rule-classes ((:rewrite)))

    Theorem: true-listp-when-pseudo-event-form-listp-compound-recognizer

    (defthm true-listp-when-pseudo-event-form-listp-compound-recognizer
      (implies (pseudo-event-form-listp x)
               (true-listp x))
      :rule-classes :compound-recognizer)

    Theorem: pseudo-event-form-listp-of-list-fix

    (defthm pseudo-event-form-listp-of-list-fix
      (implies (pseudo-event-form-listp x)
               (pseudo-event-form-listp (list-fix x)))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-form-listp-of-sfix

    (defthm pseudo-event-form-listp-of-sfix
      (iff (pseudo-event-form-listp (set::sfix x))
           (or (pseudo-event-form-listp x)
               (not (set::setp x))))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-form-listp-of-insert

    (defthm pseudo-event-form-listp-of-insert
      (iff (pseudo-event-form-listp (set::insert a x))
           (and (pseudo-event-form-listp (set::sfix x))
                (pseudo-event-formp a)))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-form-listp-of-delete

    (defthm pseudo-event-form-listp-of-delete
      (implies (pseudo-event-form-listp x)
               (pseudo-event-form-listp (set::delete k x)))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-form-listp-of-mergesort

    (defthm pseudo-event-form-listp-of-mergesort
      (iff (pseudo-event-form-listp (set::mergesort x))
           (pseudo-event-form-listp (list-fix x)))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-form-listp-of-union

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

    Theorem: pseudo-event-form-listp-of-intersect-1

    (defthm pseudo-event-form-listp-of-intersect-1
      (implies (pseudo-event-form-listp x)
               (pseudo-event-form-listp (set::intersect x y)))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-form-listp-of-intersect-2

    (defthm pseudo-event-form-listp-of-intersect-2
      (implies (pseudo-event-form-listp y)
               (pseudo-event-form-listp (set::intersect x y)))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-form-listp-of-difference

    (defthm pseudo-event-form-listp-of-difference
      (implies (pseudo-event-form-listp x)
               (pseudo-event-form-listp (set::difference x y)))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-form-listp-of-duplicated-members

    (defthm pseudo-event-form-listp-of-duplicated-members
      (implies (pseudo-event-form-listp x)
               (pseudo-event-form-listp (duplicated-members x)))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-form-listp-of-rev

    (defthm pseudo-event-form-listp-of-rev
      (equal (pseudo-event-form-listp (rev x))
             (pseudo-event-form-listp (list-fix x)))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-form-listp-of-append

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

    Theorem: pseudo-event-form-listp-of-rcons

    (defthm pseudo-event-form-listp-of-rcons
      (iff (pseudo-event-form-listp (rcons a x))
           (and (pseudo-event-formp a)
                (pseudo-event-form-listp (list-fix x))))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-formp-when-member-equal-of-pseudo-event-form-listp

    (defthm
        pseudo-event-formp-when-member-equal-of-pseudo-event-form-listp
      (and (implies (and (member-equal a x)
                         (pseudo-event-form-listp x))
                    (pseudo-event-formp a))
           (implies (and (pseudo-event-form-listp x)
                         (member-equal a x))
                    (pseudo-event-formp a)))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-form-listp-when-subsetp-equal

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

    Theorem: pseudo-event-form-listp-of-set-difference-equal

    (defthm pseudo-event-form-listp-of-set-difference-equal
      (implies (pseudo-event-form-listp x)
               (pseudo-event-form-listp (set-difference-equal x y)))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-form-listp-of-intersection-equal-1

    (defthm pseudo-event-form-listp-of-intersection-equal-1
      (implies (pseudo-event-form-listp (double-rewrite x))
               (pseudo-event-form-listp (intersection-equal x y)))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-form-listp-of-intersection-equal-2

    (defthm pseudo-event-form-listp-of-intersection-equal-2
      (implies (pseudo-event-form-listp (double-rewrite y))
               (pseudo-event-form-listp (intersection-equal x y)))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-form-listp-of-union-equal

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

    Theorem: pseudo-event-form-listp-of-take

    (defthm pseudo-event-form-listp-of-take
      (implies (pseudo-event-form-listp (double-rewrite x))
               (iff (pseudo-event-form-listp (take n x))
                    (or (pseudo-event-formp nil)
                        (<= (nfix n) (len x)))))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-form-listp-of-repeat

    (defthm pseudo-event-form-listp-of-repeat
      (iff (pseudo-event-form-listp (repeat n x))
           (or (pseudo-event-formp x) (zp n)))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-formp-of-nth-when-pseudo-event-form-listp

    (defthm pseudo-event-formp-of-nth-when-pseudo-event-form-listp
      (implies (pseudo-event-form-listp x)
               (iff (pseudo-event-formp (nth n x))
                    (< (nfix n) (len x))))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-form-listp-of-update-nth

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

    Theorem: pseudo-event-form-listp-of-butlast

    (defthm pseudo-event-form-listp-of-butlast
      (implies (pseudo-event-form-listp (double-rewrite x))
               (pseudo-event-form-listp (butlast x n)))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-form-listp-of-nthcdr

    (defthm pseudo-event-form-listp-of-nthcdr
      (implies (pseudo-event-form-listp (double-rewrite x))
               (pseudo-event-form-listp (nthcdr n x)))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-form-listp-of-last

    (defthm pseudo-event-form-listp-of-last
      (implies (pseudo-event-form-listp (double-rewrite x))
               (pseudo-event-form-listp (last x)))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-form-listp-of-remove

    (defthm pseudo-event-form-listp-of-remove
      (implies (pseudo-event-form-listp x)
               (pseudo-event-form-listp (remove a x)))
      :rule-classes ((:rewrite)))

    Theorem: pseudo-event-form-listp-of-revappend

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