Fixing function for cgraph-value structures.
(cgraph-value-fix x) → new-x
Function:
(defun cgraph-value-fix$inline (x) (declare (xargs :guard (cgraph-value-p x))) (let ((__function__ 'cgraph-value-fix)) (declare (ignorable __function__)) (mbe :logic (b* ((val (cdr (std::da-nth 0 x))) (priority (nfix (cdr (std::da-nth 1 x)))) (rule (acl2::symbol-fix (cdr (std::da-nth 2 x))))) (list (cons 'val val) (cons 'priority priority) (cons 'rule rule))) :exec x)))
Theorem:
(defthm cgraph-value-p-of-cgraph-value-fix (b* ((new-x (cgraph-value-fix$inline x))) (cgraph-value-p new-x)) :rule-classes :rewrite)
Theorem:
(defthm cgraph-value-fix-when-cgraph-value-p (implies (cgraph-value-p x) (equal (cgraph-value-fix x) x)))
Function:
(defun cgraph-value-equiv$inline (x y) (declare (xargs :guard (and (cgraph-value-p x) (cgraph-value-p y)))) (equal (cgraph-value-fix x) (cgraph-value-fix y)))
Theorem:
(defthm cgraph-value-equiv-is-an-equivalence (and (booleanp (cgraph-value-equiv x y)) (cgraph-value-equiv x x) (implies (cgraph-value-equiv x y) (cgraph-value-equiv y x)) (implies (and (cgraph-value-equiv x y) (cgraph-value-equiv y z)) (cgraph-value-equiv x z))) :rule-classes (:equivalence))
Theorem:
(defthm cgraph-value-equiv-implies-equal-cgraph-value-fix-1 (implies (cgraph-value-equiv x x-equiv) (equal (cgraph-value-fix x) (cgraph-value-fix x-equiv))) :rule-classes (:congruence))
Theorem:
(defthm cgraph-value-fix-under-cgraph-value-equiv (cgraph-value-equiv (cgraph-value-fix x) x) :rule-classes (:rewrite :rewrite-quoted-constant))
Theorem:
(defthm equal-of-cgraph-value-fix-1-forward-to-cgraph-value-equiv (implies (equal (cgraph-value-fix x) y) (cgraph-value-equiv x y)) :rule-classes :forward-chaining)
Theorem:
(defthm equal-of-cgraph-value-fix-2-forward-to-cgraph-value-equiv (implies (equal x (cgraph-value-fix y)) (cgraph-value-equiv x y)) :rule-classes :forward-chaining)
Theorem:
(defthm cgraph-value-equiv-of-cgraph-value-fix-1-forward (implies (cgraph-value-equiv (cgraph-value-fix x) y) (cgraph-value-equiv x y)) :rule-classes :forward-chaining)
Theorem:
(defthm cgraph-value-equiv-of-cgraph-value-fix-2-forward (implies (cgraph-value-equiv x (cgraph-value-fix y)) (cgraph-value-equiv x y)) :rule-classes :forward-chaining)