Fixing function for op-32-funct structures.
(op-32-funct-fix x) → new-x
Function:
(defun op-32-funct-fix$inline (x) (declare (xargs :guard (op-32-funct-p x))) (let ((__function__ 'op-32-funct-fix)) (declare (ignorable __function__)) (mbe :logic (case (op-32-funct-kind x) (:addw (cons :addw (list))) (:subw (cons :subw (list))) (:sllw (cons :sllw (list))) (:srlw (cons :srlw (list))) (:sraw (cons :sraw (list))) (:mulw (cons :mulw (list))) (:divw (cons :divw (list))) (:divuw (cons :divuw (list))) (:remw (cons :remw (list))) (:remuw (cons :remuw (list)))) :exec x)))
Theorem:
(defthm op-32-funct-p-of-op-32-funct-fix (b* ((new-x (op-32-funct-fix$inline x))) (op-32-funct-p new-x)) :rule-classes :rewrite)
Theorem:
(defthm op-32-funct-fix-when-op-32-funct-p (implies (op-32-funct-p x) (equal (op-32-funct-fix x) x)))
Function:
(defun op-32-funct-equiv$inline (acl2::x acl2::y) (declare (xargs :guard (and (op-32-funct-p acl2::x) (op-32-funct-p acl2::y)))) (equal (op-32-funct-fix acl2::x) (op-32-funct-fix acl2::y)))
Theorem:
(defthm op-32-funct-equiv-is-an-equivalence (and (booleanp (op-32-funct-equiv x y)) (op-32-funct-equiv x x) (implies (op-32-funct-equiv x y) (op-32-funct-equiv y x)) (implies (and (op-32-funct-equiv x y) (op-32-funct-equiv y z)) (op-32-funct-equiv x z))) :rule-classes (:equivalence))
Theorem:
(defthm op-32-funct-equiv-implies-equal-op-32-funct-fix-1 (implies (op-32-funct-equiv acl2::x x-equiv) (equal (op-32-funct-fix acl2::x) (op-32-funct-fix x-equiv))) :rule-classes (:congruence))
Theorem:
(defthm op-32-funct-fix-under-op-32-funct-equiv (op-32-funct-equiv (op-32-funct-fix acl2::x) acl2::x) :rule-classes (:rewrite :rewrite-quoted-constant))
Theorem:
(defthm equal-of-op-32-funct-fix-1-forward-to-op-32-funct-equiv (implies (equal (op-32-funct-fix acl2::x) acl2::y) (op-32-funct-equiv acl2::x acl2::y)) :rule-classes :forward-chaining)
Theorem:
(defthm equal-of-op-32-funct-fix-2-forward-to-op-32-funct-equiv (implies (equal acl2::x (op-32-funct-fix acl2::y)) (op-32-funct-equiv acl2::x acl2::y)) :rule-classes :forward-chaining)
Theorem:
(defthm op-32-funct-equiv-of-op-32-funct-fix-1-forward (implies (op-32-funct-equiv (op-32-funct-fix acl2::x) acl2::y) (op-32-funct-equiv acl2::x acl2::y)) :rule-classes :forward-chaining)
Theorem:
(defthm op-32-funct-equiv-of-op-32-funct-fix-2-forward (implies (op-32-funct-equiv acl2::x (op-32-funct-fix acl2::y)) (op-32-funct-equiv acl2::x acl2::y)) :rule-classes :forward-chaining)
Theorem:
(defthm op-32-funct-kind$inline-of-op-32-funct-fix-x (equal (op-32-funct-kind$inline (op-32-funct-fix x)) (op-32-funct-kind$inline x)))
Theorem:
(defthm op-32-funct-kind$inline-op-32-funct-equiv-congruence-on-x (implies (op-32-funct-equiv x x-equiv) (equal (op-32-funct-kind$inline x) (op-32-funct-kind$inline x-equiv))) :rule-classes :congruence)
Theorem:
(defthm consp-of-op-32-funct-fix (consp (op-32-funct-fix x)) :rule-classes :type-prescription)