• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
    • Apt
    • Zfc
    • Acre
    • Milawa
    • Smtlink
    • Abnf
    • Vwsim
    • Isar
    • Wp-gen
    • Dimacs-reader
    • Pfcs
    • Legacy-defrstobj
    • C
    • Proof-checker-array
    • Soft
    • Farray
    • Rp-rewriter
    • Instant-runoff-voting
    • Imp-language
    • Sidekick
    • Ethereum
    • Leftist-trees
    • Java
    • Riscv
    • Taspi
    • Bitcoin
    • Zcash
    • Des
    • X86isa
    • Sha-2
    • Yul
    • Proof-checker-itp13
    • Regex
    • ACL2-programming-language
    • Json
    • Jfkr
    • Equational
    • Cryptography
    • Axe
    • Poseidon
    • Where-do-i-place-my-book
    • Aleo
      • Aleobft
        • Correctness
        • Definition
          • Initialization
          • Transitions
          • States
            • Committees
            • System-states
            • Certificates
            • Messages
            • Transactions
              • Transaction
              • Transaction-list
                • Transaction-list-fix
                • Transaction-list-equiv
                • Transaction-listp
                  • Transaction-listp-basics
            • Proposals
            • Validator-states
            • Blocks
            • Addresses
          • Events
          • Reachability
        • Library-extensions
      • Aleovm
      • Leo
    • Bigmems
    • Builtins
    • Execloader
    • Solidity
    • Paco
    • Concurrent-programs
    • Bls12-377-curves
  • Debugging
  • Community
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
  • Math
  • Testing-utilities

• Transaction-listp

Transaction-listp-basics

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

Definitions and Theorems

Theorem: transaction-listp-of-cons

(defthm transaction-listp-of-cons
  (equal (transaction-listp (cons acl2::a acl2::x))
         (and (transactionp acl2::a)
              (transaction-listp acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: transaction-listp-of-cdr-when-transaction-listp

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

Theorem: transaction-listp-when-not-consp

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

Theorem: transactionp-of-car-when-transaction-listp

(defthm transactionp-of-car-when-transaction-listp
  (implies (transaction-listp acl2::x)
           (iff (transactionp (car acl2::x))
                (consp acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: true-listp-when-transaction-listp-compound-recognizer

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

Theorem: transaction-listp-of-list-fix

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

Theorem: transaction-listp-of-rev

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

Theorem: transaction-listp-of-append

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

Theorem: transaction-listp-of-last

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

Theorem: transactionp-of-nth-when-transaction-listp

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

Theorem: transaction-listp-of-nthcdr

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

Theorem: transaction-listp-of-remove

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

Theorem: transaction-listp-of-repeat

(defthm transaction-listp-of-repeat
  (iff (transaction-listp (repeat acl2::n acl2::x))
       (or (transactionp acl2::x)
           (zp acl2::n)))
  :rule-classes ((:rewrite)))

Theorem: transaction-listp-of-revappend

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

Theorem: transaction-listp-of-rcons

(defthm transaction-listp-of-rcons
  (iff (transaction-listp (rcons acl2::a acl2::x))
       (and (transactionp acl2::a)
            (transaction-listp (list-fix acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: transactionp-when-member-equal-of-transaction-listp

(defthm transactionp-when-member-equal-of-transaction-listp
  (and (implies (and (member-equal acl2::a acl2::x)
                     (transaction-listp acl2::x))
                (transactionp acl2::a))
       (implies (and (transaction-listp acl2::x)
                     (member-equal acl2::a acl2::x))
                (transactionp acl2::a)))
  :rule-classes ((:rewrite)))

Theorem: transaction-listp-when-subsetp-equal

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

Theorem: transaction-listp-of-set-difference-equal

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

Theorem: transaction-listp-of-intersection-equal-1

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

Theorem: transaction-listp-of-intersection-equal-2

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

Theorem: transaction-listp-of-union-equal

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

Theorem: transaction-listp-of-take

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

Theorem: transaction-listp-of-update-nth

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