Determine if a value is a member of the set.
(in x set) → *
Time complexity:
Function:
(defun in (x set) (declare (xargs :guard (setp set))) (declare (xargs :type-prescription (booleanp (in x set)))) (let ((__function__ 'in)) (declare (ignorable __function__)) (mbe :logic (tree-in x (sfix set)) :exec (and (not (emptyp set)) (or (equal x (head set)) (if (bst< x (head set)) (in x (left set)) (in x (right set))))))))
Theorem:
(defthm tree-in-of-sfix-becomes-in-exec (equal (tree-in x (sfix set)) (and (not (emptyp set)) (or (equal x (head set)) (if (bst< x (head set)) (in x (left set)) (in x (right set)))))))