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