Add a list of values to the set.
(insert-all list set) → set$
Time complexity:
Function:
(defun insert-all (list set) (declare (xargs :guard (and (true-listp list) (setp set)))) (let ((__function__ 'insert-all)) (declare (ignorable __function__)) (if (endp list) (sfix set) (insert-all (rest list) (insert (first list) set)))))
Theorem:
(defthm setp-of-insert-all (b* ((set$ (insert-all list set))) (setp set$)) :rule-classes :rewrite)