Recognizer for address+pos-set.
(address+pos-setp x) → *
Function:
(defun address+pos-setp (x) (declare (xargs :guard t)) (if (atom x) (null x) (and (address+pos-p (car x)) (or (null (cdr x)) (and (consp (cdr x)) (acl2::fast-<< (car x) (cadr x)) (address+pos-setp (cdr x)))))))
Theorem:
(defthm booleanp-ofaddress+pos-setp (booleanp (address+pos-setp x)))
Theorem:
(defthm setp-when-address+pos-setp (implies (address+pos-setp x) (setp x)) :rule-classes (:rewrite))
Theorem:
(defthm address+pos-p-of-head-when-address+pos-setp (implies (address+pos-setp x) (equal (address+pos-p (head x)) (not (emptyp x)))))
Theorem:
(defthm address+pos-setp-of-tail-when-address+pos-setp (implies (address+pos-setp x) (address+pos-setp (tail x))))
Theorem:
(defthm address+pos-setp-of-insert (equal (address+pos-setp (insert a x)) (and (address+pos-p a) (address+pos-setp (sfix x)))))
Theorem:
(defthm address+pos-p-when-in-address+pos-setp-binds-free-x (implies (and (in a x) (address+pos-setp x)) (address+pos-p a)))
Theorem:
(defthm not-in-address+pos-setp-when-not-address+pos-p (implies (and (address+pos-setp x) (not (address+pos-p a))) (not (in a x))))
Theorem:
(defthm address+pos-setp-of-union (equal (address+pos-setp (union x y)) (and (address+pos-setp (sfix x)) (address+pos-setp (sfix y)))))
Theorem:
(defthm address+pos-setp-of-intersect (implies (and (address+pos-setp x) (address+pos-setp y)) (address+pos-setp (intersect x y))))
Theorem:
(defthm address+pos-setp-of-difference (implies (address+pos-setp x) (address+pos-setp (difference x y))))
Theorem:
(defthm address+pos-setp-of-delete (implies (address+pos-setp x) (address+pos-setp (delete a x))))