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