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