A fixtype of true lists of (unsigned 8-bit) bytes of length 32.
Function:
(defun byte-list32-equiv$inline (x y) (declare (xargs :guard (and (byte-list32p x) (byte-list32p y)))) (equal (byte-list32-fix x) (byte-list32-fix y)))
Theorem:
(defthm byte-list32-equiv-is-an-equivalence (and (booleanp (byte-list32-equiv x y)) (byte-list32-equiv x x) (implies (byte-list32-equiv x y) (byte-list32-equiv y x)) (implies (and (byte-list32-equiv x y) (byte-list32-equiv y z)) (byte-list32-equiv x z))) :rule-classes (:equivalence))
Theorem:
(defthm byte-list32-equiv-implies-equal-byte-list32-fix-1 (implies (byte-list32-equiv x x-equiv) (equal (byte-list32-fix x) (byte-list32-fix x-equiv))) :rule-classes (:congruence))
Theorem:
(defthm byte-list32-fix-under-byte-list32-equiv (byte-list32-equiv (byte-list32-fix x) x) :rule-classes (:rewrite :rewrite-quoted-constant))
Theorem:
(defthm equal-of-byte-list32-fix-1-forward-to-byte-list32-equiv (implies (equal (byte-list32-fix x) y) (byte-list32-equiv x y)) :rule-classes :forward-chaining)
Theorem:
(defthm equal-of-byte-list32-fix-2-forward-to-byte-list32-equiv (implies (equal x (byte-list32-fix y)) (byte-list32-equiv x y)) :rule-classes :forward-chaining)
Theorem:
(defthm byte-list32-equiv-of-byte-list32-fix-1-forward (implies (byte-list32-equiv (byte-list32-fix x) y) (byte-list32-equiv x y)) :rule-classes :forward-chaining)
Theorem:
(defthm byte-list32-equiv-of-byte-list32-fix-2-forward (implies (byte-list32-equiv x (byte-list32-fix y)) (byte-list32-equiv x y)) :rule-classes :forward-chaining)