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