Fixing function for cgraph-edge structures.
(cgraph-edge-fix x) → new-x
Function:
(defun cgraph-edge-fix$inline (x) (declare (xargs :guard (cgraph-edge-p x))) (let ((__function__ 'cgraph-edge-fix)) (declare (ignorable __function__)) (mbe :logic (b* ((match-vars (pseudo-var-list-fix (std::prod-car x))) (rule (ctrex-rule-fix (std::prod-car (std::prod-cdr x)))) (subst (fgl-object-bindings-fix (std::prod-cdr (std::prod-cdr x))))) (std::prod-cons match-vars (std::prod-cons rule subst))) :exec x)))
Theorem:
(defthm cgraph-edge-p-of-cgraph-edge-fix (b* ((new-x (cgraph-edge-fix$inline x))) (cgraph-edge-p new-x)) :rule-classes :rewrite)
Theorem:
(defthm cgraph-edge-fix-when-cgraph-edge-p (implies (cgraph-edge-p x) (equal (cgraph-edge-fix x) x)))
Function:
(defun cgraph-edge-equiv$inline (x y) (declare (xargs :guard (and (cgraph-edge-p x) (cgraph-edge-p y)))) (equal (cgraph-edge-fix x) (cgraph-edge-fix y)))
Theorem:
(defthm cgraph-edge-equiv-is-an-equivalence (and (booleanp (cgraph-edge-equiv x y)) (cgraph-edge-equiv x x) (implies (cgraph-edge-equiv x y) (cgraph-edge-equiv y x)) (implies (and (cgraph-edge-equiv x y) (cgraph-edge-equiv y z)) (cgraph-edge-equiv x z))) :rule-classes (:equivalence))
Theorem:
(defthm cgraph-edge-equiv-implies-equal-cgraph-edge-fix-1 (implies (cgraph-edge-equiv x x-equiv) (equal (cgraph-edge-fix x) (cgraph-edge-fix x-equiv))) :rule-classes (:congruence))
Theorem:
(defthm cgraph-edge-fix-under-cgraph-edge-equiv (cgraph-edge-equiv (cgraph-edge-fix x) x) :rule-classes (:rewrite :rewrite-quoted-constant))
Theorem:
(defthm equal-of-cgraph-edge-fix-1-forward-to-cgraph-edge-equiv (implies (equal (cgraph-edge-fix x) y) (cgraph-edge-equiv x y)) :rule-classes :forward-chaining)
Theorem:
(defthm equal-of-cgraph-edge-fix-2-forward-to-cgraph-edge-equiv (implies (equal x (cgraph-edge-fix y)) (cgraph-edge-equiv x y)) :rule-classes :forward-chaining)
Theorem:
(defthm cgraph-edge-equiv-of-cgraph-edge-fix-1-forward (implies (cgraph-edge-equiv (cgraph-edge-fix x) y) (cgraph-edge-equiv x y)) :rule-classes :forward-chaining)
Theorem:
(defthm cgraph-edge-equiv-of-cgraph-edge-fix-2-forward (implies (cgraph-edge-equiv x (cgraph-edge-fix y)) (cgraph-edge-equiv x y)) :rule-classes :forward-chaining)