Basic theorems about rangelist-p, generated by std::deflist.
Theorem:
(defthm rangelist-p-of-cons (equal (rangelist-p (cons acl2::a x)) (and (range-p acl2::a) (rangelist-p x))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-cdr-when-rangelist-p (implies (rangelist-p (double-rewrite x)) (rangelist-p (cdr x))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-when-not-consp (implies (not (consp x)) (equal (rangelist-p x) (not x))) :rule-classes ((:rewrite)))
Theorem:
(defthm range-p-of-car-when-rangelist-p (implies (rangelist-p x) (iff (range-p (car x)) (or (consp x) (range-p nil)))) :rule-classes ((:rewrite)))
Theorem:
(defthm true-listp-when-rangelist-p-compound-recognizer (implies (rangelist-p x) (true-listp x)) :rule-classes :compound-recognizer)
Theorem:
(defthm rangelist-p-of-list-fix (implies (rangelist-p x) (rangelist-p (list-fix x))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-sfix (iff (rangelist-p (sfix x)) (or (rangelist-p x) (not (setp x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-insert (iff (rangelist-p (insert acl2::a x)) (and (rangelist-p (sfix x)) (range-p acl2::a))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-delete (implies (rangelist-p x) (rangelist-p (delete acl2::k x))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-mergesort (iff (rangelist-p (mergesort x)) (rangelist-p (list-fix x))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-union (iff (rangelist-p (union x y)) (and (rangelist-p (sfix x)) (rangelist-p (sfix y)))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-intersect-1 (implies (rangelist-p x) (rangelist-p (intersect x y))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-intersect-2 (implies (rangelist-p y) (rangelist-p (intersect x y))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-difference (implies (rangelist-p x) (rangelist-p (difference x y))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-duplicated-members (implies (rangelist-p x) (rangelist-p (duplicated-members x))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-rev (equal (rangelist-p (rev x)) (rangelist-p (list-fix x))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-append (equal (rangelist-p (append acl2::a acl2::b)) (and (rangelist-p (list-fix acl2::a)) (rangelist-p acl2::b))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-rcons (iff (rangelist-p (acl2::rcons acl2::a x)) (and (range-p acl2::a) (rangelist-p (list-fix x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm range-p-when-member-equal-of-rangelist-p (and (implies (and (member-equal acl2::a x) (rangelist-p x)) (range-p acl2::a)) (implies (and (rangelist-p x) (member-equal acl2::a x)) (range-p acl2::a))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-when-subsetp-equal (and (implies (and (subsetp-equal x y) (rangelist-p y)) (equal (rangelist-p x) (true-listp x))) (implies (and (rangelist-p y) (subsetp-equal x y)) (equal (rangelist-p x) (true-listp x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-set-difference-equal (implies (rangelist-p x) (rangelist-p (set-difference-equal x y))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-intersection-equal-1 (implies (rangelist-p (double-rewrite x)) (rangelist-p (intersection-equal x y))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-intersection-equal-2 (implies (rangelist-p (double-rewrite y)) (rangelist-p (intersection-equal x y))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-union-equal (equal (rangelist-p (union-equal x y)) (and (rangelist-p (list-fix x)) (rangelist-p (double-rewrite y)))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-take (implies (rangelist-p (double-rewrite x)) (iff (rangelist-p (take acl2::n x)) (or (range-p nil) (<= (nfix acl2::n) (len x))))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-repeat (iff (rangelist-p (repeat acl2::n x)) (or (range-p x) (zp acl2::n))) :rule-classes ((:rewrite)))
Theorem:
(defthm range-p-of-nth-when-rangelist-p (implies (and (rangelist-p x) (< (nfix acl2::n) (len x))) (range-p (nth acl2::n x))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-update-nth (implies (rangelist-p (double-rewrite x)) (iff (rangelist-p (update-nth acl2::n y x)) (and (range-p y) (or (<= (nfix acl2::n) (len x)) (range-p nil))))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-butlast (implies (rangelist-p (double-rewrite x)) (rangelist-p (butlast x acl2::n))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-nthcdr (implies (rangelist-p (double-rewrite x)) (rangelist-p (nthcdr acl2::n x))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-last (implies (rangelist-p (double-rewrite x)) (rangelist-p (last x))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-remove (implies (rangelist-p x) (rangelist-p (remove acl2::a x))) :rule-classes ((:rewrite)))
Theorem:
(defthm rangelist-p-of-revappend (equal (rangelist-p (revappend x y)) (and (rangelist-p (list-fix x)) (rangelist-p y))) :rule-classes ((:rewrite)))