(maybe-vex-p x) → *
Function:
(defun maybe-vex-p (x) (declare (xargs :guard t)) (let ((__function__ 'maybe-vex-p)) (declare (ignorable __function__)) (or (not x) (vex-p x))))
Function:
(defun maybe-vex-fix (x) (declare (xargs :guard (maybe-vex-p x))) (let ((__function__ 'maybe-vex-fix)) (declare (ignorable __function__)) (mbe :logic (if (maybe-vex-p x) x 'nil) :exec x)))
Function:
(defun maybe-vex-equiv$inline (x y) (declare (xargs :guard (and (maybe-vex-p x) (maybe-vex-p y)))) (equal (maybe-vex-fix x) (maybe-vex-fix y)))
Theorem:
(defthm maybe-vex-equiv-is-an-equivalence (and (booleanp (maybe-vex-equiv x y)) (maybe-vex-equiv x x) (implies (maybe-vex-equiv x y) (maybe-vex-equiv y x)) (implies (and (maybe-vex-equiv x y) (maybe-vex-equiv y z)) (maybe-vex-equiv x z))) :rule-classes (:equivalence))
Theorem:
(defthm maybe-vex-equiv-implies-equal-maybe-vex-fix-1 (implies (maybe-vex-equiv x x-equiv) (equal (maybe-vex-fix x) (maybe-vex-fix x-equiv))) :rule-classes (:congruence))
Theorem:
(defthm maybe-vex-fix-under-maybe-vex-equiv (maybe-vex-equiv (maybe-vex-fix x) x) :rule-classes (:rewrite :rewrite-quoted-constant))