		Search-engine friendly clone of the ACL2 documentation.

Bit-list

Bit-list-equiv

Basic equivalence relation for bit-list structures.

Definitions and Theorems

Function: bit-list-equiv$inline

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

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

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

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

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

Theorem: bit-list-fix-under-bit-list-equiv

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

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

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

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

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

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

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

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

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