• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • 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
        • Soft
        • C
        • Bv
        • Imp-language
        • Event-macros
        • Java
        • Bitcoin
        • Ethereum
        • Yul
        • Zcash
        • ACL2-programming-language
          • Primitive-functions
          • Translated-terms
          • Values
          • Evaluation
          • Program-equivalence
          • Functions
          • Packages
          • Programs
          • Interpreter
          • Evaluation-states
            • Eval-state
            • Frame
            • Binding
              • Binding-fix
              • Bindingp
              • Binding-equiv
              • Stack
          • Prime-fields
          • Json
          • Syntheto
          • File-io-light
          • Cryptography
          • Number-theory
          • Lists-light
          • Axe
          • Builtins
          • Solidity
          • Helpers
          • Htclient
          • Typed-lists-light
          • Arithmetic-light
        • X86isa
        • Axe
        • Execloader
      • Math
      • Testing-utilities
    • Binding

    Binding-equiv

    Basic equivalence relation for binding structures.

    Definitions and Theorems

    Function: binding-equiv$inline

    (defun binding-equiv$inline (acl2::x acl2::y)
      (declare (xargs :guard (and (bindingp acl2::x)
                                  (bindingp acl2::y))))
      (equal (binding-fix acl2::x)
             (binding-fix acl2::y)))

    Theorem: binding-equiv-is-an-equivalence

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

    Theorem: binding-equiv-implies-equal-binding-fix-1

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

    Theorem: binding-fix-under-binding-equiv

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

    Theorem: equal-of-binding-fix-1-forward-to-binding-equiv

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

    Theorem: equal-of-binding-fix-2-forward-to-binding-equiv

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

    Theorem: binding-equiv-of-binding-fix-1-forward

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

    Theorem: binding-equiv-of-binding-fix-2-forward

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