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