• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Community
  • Std
    • Std/lists
    • Omaps
    • Std/alists
    • Obags
    • Std/util
    • Std/strings
    • Std/osets
    • Std/io
    • Std/basic
      • Maybe-stringp
      • Maybe-natp
      • Two-nats-measure
      • Impossible
      • Bytep
      • Nat-list-measure
      • Maybe-posp
      • Nibblep
        • Nibble
          • Nibble-list
            • Nibble-list-fix
            • Nibble-list-equiv
            • Nibble-listp
          • Nibble-fix
          • Nibblep-additional-theorems
        • Nibblep-additional-theorems
      • Organize-symbols-by-pkg
      • Organize-symbols-by-name
      • Lnfix
      • Good-valuep
      • Streqv
      • Chareqv
      • Symbol-package-name-non-cl
      • Arith-equivs
      • Induction-schemes
      • Maybe-integerp
      • Char-fix
      • Pos-fix
      • Symbol-package-name-lst
      • Mbt$
      • Maybe-bitp
      • Good-pseudo-termp
      • Str-fix
      • Maybe-string-fix
      • Nonkeyword-listp
      • Lifix
      • Bfix
      • Std/basic/if*
      • Impliez
      • Tuplep
      • Std/basic/intern-in-package-of-symbol
      • Lbfix
      • Std/basic/symbol-name-lst
      • True
      • Std/basic/rfix
      • Std/basic/realfix
      • Std/basic/member-symbol-name
      • Std/basic/fix
      • False
      • Std/basic/nfix
      • Std/basic/ifix
    • Std/system
    • Std/typed-lists
    • Std/bitsets
    • Std/testing
    • Std/typed-alists
    • Std/stobjs
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
  • Math
  • Testing-utilities

• Nibble-list

Nibble-list-equiv

Basic equivalence relation for nibble-list structures.

Definitions and Theorems

Function: nibble-list-equiv$inline

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

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

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

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

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

Theorem: nibble-list-fix-under-nibble-list-equiv

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

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

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

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

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

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

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

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

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