• Top
  • Documentation
  • Books
  • Recursion-and-induction
  • Boolean-reasoning
  • Debugging
  • Projects
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
    • Kestrel-books
      • Crypto-hdwallet
      • Error-checking
      • Apt
      • Abnf
      • Fty-extensions
      • Isar
      • Kestrel-utilities
      • Prime-field-constraint-systems
      • Soft
      • Bv
      • Imp-language
      • Event-macros
      • Bitcoin
      • Ethereum
      • Yul
      • Zcash
      • ACL2-programming-language
        • Primitive-functions
        • Translated-terms
          • Tterm-constant-list->value-list
          • Tterm-free-vars
          • Tterm-option
          • Tterm-constant-list
          • Tterm-case-constant-listp
          • Lift-term
          • Tterms
            • Tterm
            • Tfunction
            • Tterm-list
              • Tterm-list-equiv
              • Tterm-listp
              • Tterm-list-fix
        • Values
        • Evaluation
        • Program-equivalence
        • Functions
        • Packages
        • Programs
        • Interpreter
        • Evaluation-states
      • Prime-fields
      • Java
      • C
      • Syntheto
      • Number-theory
      • Cryptography
      • Lists-light
      • File-io-light
      • Json
      • Built-ins
      • Solidity
      • Axe
      • Std-extensions
      • Htclient
      • Typed-lists-light
      • Arithmetic-light
    • X86isa
    • Execloader
    • Axe
  • Testing-utilities
  • Math

• Tterm-list

Tterm-list-equiv

Basic equivalence relation for tterm-list structures.

Definitions and Theorems

Function: tterm-list-equiv$inline

(defun tterm-list-equiv$inline
       (acl2::x acl2::y)
       (declare (xargs :guard (and (tterm-listp acl2::x)
                                   (tterm-listp acl2::y))))
       (equal (tterm-list-fix acl2::x)
              (tterm-list-fix acl2::y)))

Theorem: tterm-list-equiv-is-an-equivalence

(defthm tterm-list-equiv-is-an-equivalence
        (and (booleanp (tterm-list-equiv x y))
             (tterm-list-equiv x x)
             (implies (tterm-list-equiv x y)
                      (tterm-list-equiv y x))
             (implies (and (tterm-list-equiv x y)
                           (tterm-list-equiv y z))
                      (tterm-list-equiv x z)))
        :rule-classes (:equivalence))

Theorem: tterm-list-equiv-implies-equal-tterm-list-fix-1

(defthm tterm-list-equiv-implies-equal-tterm-list-fix-1
        (implies (tterm-list-equiv acl2::x x-equiv)
                 (equal (tterm-list-fix acl2::x)
                        (tterm-list-fix x-equiv)))
        :rule-classes (:congruence))

Theorem: tterm-list-fix-under-tterm-list-equiv

(defthm tterm-list-fix-under-tterm-list-equiv
        (tterm-list-equiv (tterm-list-fix acl2::x)
                          acl2::x)
        :rule-classes (:rewrite :rewrite-quoted-constant))

Theorem: equal-of-tterm-list-fix-1-forward-to-tterm-list-equiv

(defthm equal-of-tterm-list-fix-1-forward-to-tterm-list-equiv
        (implies (equal (tterm-list-fix acl2::x) acl2::y)
                 (tterm-list-equiv acl2::x acl2::y))
        :rule-classes :forward-chaining)

Theorem: equal-of-tterm-list-fix-2-forward-to-tterm-list-equiv

(defthm equal-of-tterm-list-fix-2-forward-to-tterm-list-equiv
        (implies (equal acl2::x (tterm-list-fix acl2::y))
                 (tterm-list-equiv acl2::x acl2::y))
        :rule-classes :forward-chaining)

Theorem: tterm-list-equiv-of-tterm-list-fix-1-forward

(defthm tterm-list-equiv-of-tterm-list-fix-1-forward
        (implies (tterm-list-equiv (tterm-list-fix acl2::x)
                                   acl2::y)
                 (tterm-list-equiv acl2::x acl2::y))
        :rule-classes :forward-chaining)

Theorem: tterm-list-equiv-of-tterm-list-fix-2-forward

(defthm tterm-list-equiv-of-tterm-list-fix-2-forward
        (implies (tterm-list-equiv acl2::x (tterm-list-fix acl2::y))
                 (tterm-list-equiv acl2::x acl2::y))
        :rule-classes :forward-chaining)