		Search-engine friendly clone of the ACL2 documentation.

Fun-table

Fun-table-fix

(fun-table-fix x) is a usual ACL2::fty omap fixing function.

Signature
(fun-table-fix x) → *
Arguments: x — Guard (fun-tablep x).

Definitions and Theorems

Function: fun-table-fix

(defun fun-table-fix (x)
  (declare (xargs :guard (fun-tablep x)))
  (mbe :logic (if (fun-tablep x) x nil)
       :exec x))

Theorem: fun-tablep-of-fun-table-fix

(defthm fun-tablep-of-fun-table-fix
  (fun-tablep (fun-table-fix x)))

Theorem: fun-table-fix-when-fun-tablep

(defthm fun-table-fix-when-fun-tablep
  (implies (fun-tablep x)
           (equal (fun-table-fix x) x)))

Theorem: emptyp-fun-table-fix

(defthm emptyp-fun-table-fix
  (implies (or (omap::emptyp x)
               (not (fun-tablep x)))
           (omap::emptyp (fun-table-fix x))))

Theorem: emptyp-of-fun-table-fix-to-not-fun-table-or-emptyp

(defthm emptyp-of-fun-table-fix-to-not-fun-table-or-emptyp
  (equal (omap::emptyp (fun-table-fix x))
         (or (not (fun-tablep x))
             (omap::emptyp x))))

Function: fun-table-equiv$inline

(defun fun-table-equiv$inline (acl2::x acl2::y)
  (declare (xargs :guard (and (fun-tablep acl2::x)
                              (fun-tablep acl2::y))))
  (equal (fun-table-fix acl2::x)
         (fun-table-fix acl2::y)))

Theorem: fun-table-equiv-is-an-equivalence

(defthm fun-table-equiv-is-an-equivalence
  (and (booleanp (fun-table-equiv x y))
       (fun-table-equiv x x)
       (implies (fun-table-equiv x y)
                (fun-table-equiv y x))
       (implies (and (fun-table-equiv x y)
                     (fun-table-equiv y z))
                (fun-table-equiv x z)))
  :rule-classes (:equivalence))

Theorem: fun-table-equiv-implies-equal-fun-table-fix-1

(defthm fun-table-equiv-implies-equal-fun-table-fix-1
  (implies (fun-table-equiv acl2::x x-equiv)
           (equal (fun-table-fix acl2::x)
                  (fun-table-fix x-equiv)))
  :rule-classes (:congruence))

Theorem: fun-table-fix-under-fun-table-equiv

(defthm fun-table-fix-under-fun-table-equiv
  (fun-table-equiv (fun-table-fix acl2::x)
                   acl2::x)
  :rule-classes (:rewrite :rewrite-quoted-constant))

Theorem: equal-of-fun-table-fix-1-forward-to-fun-table-equiv

(defthm equal-of-fun-table-fix-1-forward-to-fun-table-equiv
  (implies (equal (fun-table-fix acl2::x) acl2::y)
           (fun-table-equiv acl2::x acl2::y))
  :rule-classes :forward-chaining)

Theorem: equal-of-fun-table-fix-2-forward-to-fun-table-equiv

(defthm equal-of-fun-table-fix-2-forward-to-fun-table-equiv
  (implies (equal acl2::x (fun-table-fix acl2::y))
           (fun-table-equiv acl2::x acl2::y))
  :rule-classes :forward-chaining)

Theorem: fun-table-equiv-of-fun-table-fix-1-forward

(defthm fun-table-equiv-of-fun-table-fix-1-forward
  (implies (fun-table-equiv (fun-table-fix acl2::x)
                            acl2::y)
           (fun-table-equiv acl2::x acl2::y))
  :rule-classes :forward-chaining)

Theorem: fun-table-equiv-of-fun-table-fix-2-forward

(defthm fun-table-equiv-of-fun-table-fix-2-forward
  (implies (fun-table-equiv acl2::x (fun-table-fix acl2::y))
           (fun-table-equiv acl2::x acl2::y))
  :rule-classes :forward-chaining)