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