• Top
  • Documentation
  • Books
  • Recursion-and-induction
  • Boolean-reasoning
  • Projects
  • Debugging
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
    • Gl
    • Esim
    • Vl2014
    • Sv
      • Svex-stvs
      • Svex-fixpoint-decomposition-methodology
      • Sv-versus-esim
      • Svex-decomp
      • Svex-compose-dfs
      • Moddb
      • Svex-compilation
      • Svmods
      • Svstmt
      • Sv-tutorial
      • Expressions
        • Rewriting
        • Svex
          • Svar
          • Least-fixpoint
          • Svex-p
          • Svex-select
          • Svex-alist
            • Svex-alist-p
            • Svex-alist-fix
            • Svex-alist-vars
            • Svex-alist-eval
            • Svex-lookup
            • Svex-fastacons
            • Svex-alist-vals
            • Svex-alist-keys
            • Svex-acons
            • Svex-alist-equiv
            • Svex-fastlookup
          • Svex-equiv
          • Svexlist
          • Svex-call
          • Fnsym
          • Svex-quote
          • Svex-var
          • Svcall-rw
          • Svcall
          • Svex-kind
          • Svcall*
          • Svex-fix
          • Svex-count
          • Svex-1z
          • Svex-1x
          • Svex-z
          • Svex-x
        • Bit-blasting
        • Functions
        • 4vmask
        • Why-infinite-width
        • Svex-vars
        • Evaluation
        • Values
      • Symbolic-test-vector
      • Vl-to-svex
    • Vwsim
    • Fgl
    • Vl
    • X86isa
    • Svl
    • Rtl
  • Software-verification
  • Testing-utilities
  • Math

• Svex-alist

Svex-alist-equiv

Basic equivalence relation for svex-alist structures.

Definitions and Theorems

Function: svex-alist-equiv$inline

(defun svex-alist-equiv$inline (x y)
  (declare (xargs :guard (and (svex-alist-p x)
                              (svex-alist-p y))))
  (equal (svex-alist-fix x)
         (svex-alist-fix y)))

Theorem: svex-alist-equiv-is-an-equivalence

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

Theorem: svex-alist-equiv-implies-equal-svex-alist-fix-1

(defthm svex-alist-equiv-implies-equal-svex-alist-fix-1
  (implies (svex-alist-equiv x x-equiv)
           (equal (svex-alist-fix x)
                  (svex-alist-fix x-equiv)))
  :rule-classes (:congruence))

Theorem: svex-alist-fix-under-svex-alist-equiv

(defthm svex-alist-fix-under-svex-alist-equiv
  (svex-alist-equiv (svex-alist-fix x) x)
  :rule-classes (:rewrite :rewrite-quoted-constant))

Theorem: equal-of-svex-alist-fix-1-forward-to-svex-alist-equiv

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

Theorem: equal-of-svex-alist-fix-2-forward-to-svex-alist-equiv

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

Theorem: svex-alist-equiv-of-svex-alist-fix-1-forward

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

Theorem: svex-alist-equiv-of-svex-alist-fix-2-forward

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