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