• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
    • Gl
    • Esim
    • Vl2014
    • Sv
      • Svex-stvs
      • Svex-decomposition-methodology
      • Sv-versus-esim
      • Svex-decomp
      • Svex-compose-dfs
      • Svex-compilation
      • Moddb
      • Svmods
        • Address
        • Wire
        • Module
        • Lhs
        • Path
        • Svar-add-namespace
        • Design
        • Modinst
        • Lhs-add-namespace
        • Modalist
        • Path-add-namespace
        • Modname->submodnames
        • Name
          • Name-p
          • Name-equiv
          • Name-fix
          • Namelist
        • Constraintlist-addr-p
        • Svex-alist-addr-p
        • Svar-map-addr-p
        • Lhspairs-addr-p
        • Modname
        • Assigns-addr-p
        • Lhs-addr-p
        • Lhatom-addr-p
        • Modhier-list-measure
        • Attributes
        • Modhier-measure
        • Modhier-list-measure-aux
        • Modhier-loopfreelist-p
        • Modhier-loopfree-p
      • Svstmt
      • Sv-tutorial
      • Expressions
      • Symbolic-test-vector
      • Vl-to-svex
    • Vwsim
    • Fgl
    • Vl
    • X86isa
    • Svl
    • Rtl
  • Software-verification
  • Math
  • Testing-utilities

• Name

Name-equiv

Definitions and Theorems

Function: name-equiv$inline

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

Theorem: name-equiv-is-an-equivalence

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

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

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

Theorem: name-fix-under-name-equiv

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

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

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

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

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

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

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

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

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