• 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
      • Set
      • C
      • Soft
      • Bv
      • Imp-language
      • Ethereum
        • Mmp-trees
        • Semaphore
        • Database
        • Cryptography
        • Rlp
          • Rlp-tree
            • Rlp-tree-case
            • Rlp-tree-equiv
            • Rlp-treep
            • Rlp-tree-leaf
            • Rlp-tree-branch
            • Rlp-tree-kind
            • Rlp-tree-list
              • Rlp-tree-list-equiv
              • Rlp-tree-listp
                • Rlp-tree-listp-basics
              • Rlp-tree-list-fix
            • Rlp-tree-fix
            • Rlp-tree-count
          • Rlp-decoding-executable
          • Rlp-decodability
          • Rlp-encoding
          • Rlp-decoding-declarative
          • Rlp-big-endian-representations
        • Transactions
        • Hex-prefix
        • Basics
        • Addresses
      • 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

• Rlp-tree-listp

Rlp-tree-listp-basics

Basic theorems about rlp-tree-listp, generated by std::deflist.

Definitions and Theorems

Theorem: rlp-tree-listp-of-cons

(defthm rlp-tree-listp-of-cons
  (equal (rlp-tree-listp (cons acl2::a acl2::x))
         (and (rlp-treep acl2::a)
              (rlp-tree-listp acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-cdr-when-rlp-tree-listp

(defthm rlp-tree-listp-of-cdr-when-rlp-tree-listp
  (implies (rlp-tree-listp (double-rewrite acl2::x))
           (rlp-tree-listp (cdr acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-when-not-consp

(defthm rlp-tree-listp-when-not-consp
  (implies (not (consp acl2::x))
           (equal (rlp-tree-listp acl2::x)
                  (not acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: rlp-treep-of-car-when-rlp-tree-listp

(defthm rlp-treep-of-car-when-rlp-tree-listp
  (implies (rlp-tree-listp acl2::x)
           (iff (rlp-treep (car acl2::x))
                (consp acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: true-listp-when-rlp-tree-listp-compound-recognizer

(defthm true-listp-when-rlp-tree-listp-compound-recognizer
  (implies (rlp-tree-listp acl2::x)
           (true-listp acl2::x))
  :rule-classes :compound-recognizer)

Theorem: rlp-tree-listp-of-list-fix

(defthm rlp-tree-listp-of-list-fix
  (implies (rlp-tree-listp acl2::x)
           (rlp-tree-listp (list-fix acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-sfix

(defthm rlp-tree-listp-of-sfix
  (iff (rlp-tree-listp (sfix acl2::x))
       (or (rlp-tree-listp acl2::x)
           (not (setp acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-insert

(defthm rlp-tree-listp-of-insert
  (iff (rlp-tree-listp (insert acl2::a acl2::x))
       (and (rlp-tree-listp (sfix acl2::x))
            (rlp-treep acl2::a)))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-delete

(defthm rlp-tree-listp-of-delete
  (implies (rlp-tree-listp acl2::x)
           (rlp-tree-listp (delete acl2::k acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-mergesort

(defthm rlp-tree-listp-of-mergesort
  (iff (rlp-tree-listp (mergesort acl2::x))
       (rlp-tree-listp (list-fix acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-union

(defthm rlp-tree-listp-of-union
  (iff (rlp-tree-listp (union acl2::x acl2::y))
       (and (rlp-tree-listp (sfix acl2::x))
            (rlp-tree-listp (sfix acl2::y))))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-intersect-1

(defthm rlp-tree-listp-of-intersect-1
  (implies (rlp-tree-listp acl2::x)
           (rlp-tree-listp (intersect acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-intersect-2

(defthm rlp-tree-listp-of-intersect-2
  (implies (rlp-tree-listp acl2::y)
           (rlp-tree-listp (intersect acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-difference

(defthm rlp-tree-listp-of-difference
  (implies (rlp-tree-listp acl2::x)
           (rlp-tree-listp (difference acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-duplicated-members

(defthm rlp-tree-listp-of-duplicated-members
  (implies (rlp-tree-listp acl2::x)
           (rlp-tree-listp (duplicated-members acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-rev

(defthm rlp-tree-listp-of-rev
  (equal (rlp-tree-listp (rev acl2::x))
         (rlp-tree-listp (list-fix acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-append

(defthm rlp-tree-listp-of-append
  (equal (rlp-tree-listp (append acl2::a acl2::b))
         (and (rlp-tree-listp (list-fix acl2::a))
              (rlp-tree-listp acl2::b)))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-rcons

(defthm rlp-tree-listp-of-rcons
  (iff (rlp-tree-listp (rcons acl2::a acl2::x))
       (and (rlp-treep acl2::a)
            (rlp-tree-listp (list-fix acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: rlp-treep-when-member-equal-of-rlp-tree-listp

(defthm rlp-treep-when-member-equal-of-rlp-tree-listp
  (and (implies (and (member-equal acl2::a acl2::x)
                     (rlp-tree-listp acl2::x))
                (rlp-treep acl2::a))
       (implies (and (rlp-tree-listp acl2::x)
                     (member-equal acl2::a acl2::x))
                (rlp-treep acl2::a)))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-when-subsetp-equal

(defthm rlp-tree-listp-when-subsetp-equal
  (and (implies (and (subsetp-equal acl2::x acl2::y)
                     (rlp-tree-listp acl2::y))
                (equal (rlp-tree-listp acl2::x)
                       (true-listp acl2::x)))
       (implies (and (rlp-tree-listp acl2::y)
                     (subsetp-equal acl2::x acl2::y))
                (equal (rlp-tree-listp acl2::x)
                       (true-listp acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-set-difference-equal

(defthm rlp-tree-listp-of-set-difference-equal
  (implies (rlp-tree-listp acl2::x)
           (rlp-tree-listp (set-difference-equal acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-intersection-equal-1

(defthm rlp-tree-listp-of-intersection-equal-1
  (implies (rlp-tree-listp (double-rewrite acl2::x))
           (rlp-tree-listp (intersection-equal acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-intersection-equal-2

(defthm rlp-tree-listp-of-intersection-equal-2
  (implies (rlp-tree-listp (double-rewrite acl2::y))
           (rlp-tree-listp (intersection-equal acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-union-equal

(defthm rlp-tree-listp-of-union-equal
  (equal (rlp-tree-listp (union-equal acl2::x acl2::y))
         (and (rlp-tree-listp (list-fix acl2::x))
              (rlp-tree-listp (double-rewrite acl2::y))))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-take

(defthm rlp-tree-listp-of-take
  (implies (rlp-tree-listp (double-rewrite acl2::x))
           (iff (rlp-tree-listp (take acl2::n acl2::x))
                (or (rlp-treep nil)
                    (<= (nfix acl2::n) (len acl2::x)))))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-repeat

(defthm rlp-tree-listp-of-repeat
  (iff (rlp-tree-listp (repeat acl2::n acl2::x))
       (or (rlp-treep acl2::x) (zp acl2::n)))
  :rule-classes ((:rewrite)))

Theorem: rlp-treep-of-nth-when-rlp-tree-listp

(defthm rlp-treep-of-nth-when-rlp-tree-listp
  (implies (rlp-tree-listp acl2::x)
           (iff (rlp-treep (nth acl2::n acl2::x))
                (< (nfix acl2::n) (len acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-update-nth

(defthm rlp-tree-listp-of-update-nth
 (implies (rlp-tree-listp (double-rewrite acl2::x))
          (iff (rlp-tree-listp (update-nth acl2::n acl2::y acl2::x))
               (and (rlp-treep acl2::y)
                    (or (<= (nfix acl2::n) (len acl2::x))
                        (rlp-treep nil)))))
 :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-butlast

(defthm rlp-tree-listp-of-butlast
  (implies (rlp-tree-listp (double-rewrite acl2::x))
           (rlp-tree-listp (butlast acl2::x acl2::n)))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-nthcdr

(defthm rlp-tree-listp-of-nthcdr
  (implies (rlp-tree-listp (double-rewrite acl2::x))
           (rlp-tree-listp (nthcdr acl2::n acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-last

(defthm rlp-tree-listp-of-last
  (implies (rlp-tree-listp (double-rewrite acl2::x))
           (rlp-tree-listp (last acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-remove

(defthm rlp-tree-listp-of-remove
  (implies (rlp-tree-listp acl2::x)
           (rlp-tree-listp (remove acl2::a acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: rlp-tree-listp-of-revappend

(defthm rlp-tree-listp-of-revappend
  (equal (rlp-tree-listp (revappend acl2::x acl2::y))
         (and (rlp-tree-listp (list-fix acl2::x))
              (rlp-tree-listp acl2::y)))
  :rule-classes ((:rewrite)))