Get the "left" subset of the nonempty set.
For empty sets, returns
From a user perspective, this should likely be viewed as an arbitrary proper subset excluding the head and disjoint from the right subset. Concretely, it is the subset for which all elements are bst< the head. In terms of the underlying tree representation, this is the left subtree.
Function:
(defun left$inline (set) (declare (xargs :guard (setp set))) (tree-left (sfix set)))
Theorem:
(defthm setp-of-left (b* ((left (left$inline set))) (setp left)) :rule-classes :rewrite)