Basic equivalence relation for ubyte2-list structures.
Function:
(defun ubyte2-list-equiv$inline (x y) (declare (xargs :guard (and (ubyte2-listp x) (ubyte2-listp y)))) (equal (ubyte2-list-fix x) (ubyte2-list-fix y)))
Theorem:
(defthm ubyte2-list-equiv-is-an-equivalence (and (booleanp (ubyte2-list-equiv x y)) (ubyte2-list-equiv x x) (implies (ubyte2-list-equiv x y) (ubyte2-list-equiv y x)) (implies (and (ubyte2-list-equiv x y) (ubyte2-list-equiv y z)) (ubyte2-list-equiv x z))) :rule-classes (:equivalence))
Theorem:
(defthm ubyte2-list-equiv-implies-equal-ubyte2-list-fix-1 (implies (ubyte2-list-equiv x x-equiv) (equal (ubyte2-list-fix x) (ubyte2-list-fix x-equiv))) :rule-classes (:congruence))
Theorem:
(defthm ubyte2-list-fix-under-ubyte2-list-equiv (ubyte2-list-equiv (ubyte2-list-fix x) x) :rule-classes (:rewrite :rewrite-quoted-constant))
Theorem:
(defthm equal-of-ubyte2-list-fix-1-forward-to-ubyte2-list-equiv (implies (equal (ubyte2-list-fix x) y) (ubyte2-list-equiv x y)) :rule-classes :forward-chaining)
Theorem:
(defthm equal-of-ubyte2-list-fix-2-forward-to-ubyte2-list-equiv (implies (equal x (ubyte2-list-fix y)) (ubyte2-list-equiv x y)) :rule-classes :forward-chaining)
Theorem:
(defthm ubyte2-list-equiv-of-ubyte2-list-fix-1-forward (implies (ubyte2-list-equiv (ubyte2-list-fix x) y) (ubyte2-list-equiv x y)) :rule-classes :forward-chaining)
Theorem:
(defthm ubyte2-list-equiv-of-ubyte2-list-fix-2-forward (implies (ubyte2-list-equiv x (ubyte2-list-fix y)) (ubyte2-list-equiv x y)) :rule-classes :forward-chaining)