Recognizer for obj-alist.
(obj-alist-p x) → *
Function:
(defun obj-alist-p (x) (declare (xargs :guard t)) (let ((__function__ 'obj-alist-p)) (declare (ignorable __function__)) (if (atom x) (eq x nil) (and (consp (car x)) (obj-alist-p (cdr x))))))
Theorem:
(defthm obj-alist-p-of-revappend (equal (obj-alist-p (revappend x y)) (and (obj-alist-p (list-fix x)) (obj-alist-p y))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-remove (implies (obj-alist-p x) (obj-alist-p (remove a x))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-last (implies (obj-alist-p (double-rewrite x)) (obj-alist-p (last x))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-nthcdr (implies (obj-alist-p (double-rewrite x)) (obj-alist-p (nthcdr n x))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-butlast (implies (obj-alist-p (double-rewrite x)) (obj-alist-p (butlast x n))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-update-nth (implies (obj-alist-p (double-rewrite x)) (iff (obj-alist-p (update-nth n y x)) (and (and (consp y)) (or (<= (nfix n) (len x)) (and (consp nil)))))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-repeat (iff (obj-alist-p (acl2::repeat n x)) (or (and (consp x)) (zp n))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-take (implies (obj-alist-p (double-rewrite x)) (iff (obj-alist-p (take n x)) (or (and (consp nil)) (<= (nfix n) (len x))))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-union-equal (equal (obj-alist-p (union-equal x y)) (and (obj-alist-p (list-fix x)) (obj-alist-p (double-rewrite y)))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-intersection-equal-2 (implies (obj-alist-p (double-rewrite y)) (obj-alist-p (intersection-equal x y))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-intersection-equal-1 (implies (obj-alist-p (double-rewrite x)) (obj-alist-p (intersection-equal x y))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-set-difference-equal (implies (obj-alist-p x) (obj-alist-p (set-difference-equal x y))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-when-subsetp-equal (and (implies (and (subsetp-equal x y) (obj-alist-p y)) (equal (obj-alist-p x) (true-listp x))) (implies (and (obj-alist-p y) (subsetp-equal x y)) (equal (obj-alist-p x) (true-listp x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-rcons (iff (obj-alist-p (acl2::rcons a x)) (and (and (consp a)) (obj-alist-p (list-fix x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-append (equal (obj-alist-p (append a b)) (and (obj-alist-p (list-fix a)) (obj-alist-p b))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-rev (equal (obj-alist-p (rev x)) (obj-alist-p (list-fix x))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-duplicated-members (implies (obj-alist-p x) (obj-alist-p (acl2::duplicated-members x))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-difference (implies (obj-alist-p x) (obj-alist-p (set::difference x y))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-intersect-2 (implies (obj-alist-p y) (obj-alist-p (set::intersect x y))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-intersect-1 (implies (obj-alist-p x) (obj-alist-p (set::intersect x y))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-union (iff (obj-alist-p (set::union x y)) (and (obj-alist-p (set::sfix x)) (obj-alist-p (set::sfix y)))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-mergesort (iff (obj-alist-p (set::mergesort x)) (obj-alist-p (list-fix x))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-delete (implies (obj-alist-p x) (obj-alist-p (set::delete k x))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-insert (iff (obj-alist-p (set::insert a x)) (and (obj-alist-p (set::sfix x)) (and (consp a)))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-sfix (iff (obj-alist-p (set::sfix x)) (or (obj-alist-p x) (not (set::setp x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-list-fix (implies (obj-alist-p x) (obj-alist-p (list-fix x))) :rule-classes ((:rewrite)))
Theorem:
(defthm true-listp-when-obj-alist-p-compound-recognizer (implies (obj-alist-p x) (true-listp x)) :rule-classes :compound-recognizer)
Theorem:
(defthm obj-alist-p-when-not-consp (implies (not (consp x)) (equal (obj-alist-p x) (not x))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-cdr-when-obj-alist-p (implies (obj-alist-p (double-rewrite x)) (obj-alist-p (cdr x))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-cons (equal (obj-alist-p (cons a x)) (and (and (consp a)) (obj-alist-p x))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-remove-assoc (implies (obj-alist-p x) (obj-alist-p (remove-assoc-equal name x))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-put-assoc (implies (and (obj-alist-p x)) (iff (obj-alist-p (put-assoc-equal name acl2::val x)) (and t t))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-fast-alist-clean (implies (obj-alist-p x) (obj-alist-p (fast-alist-clean x))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-hons-shrink-alist (implies (and (obj-alist-p x) (obj-alist-p y)) (obj-alist-p (hons-shrink-alist x y))) :rule-classes ((:rewrite)))
Theorem:
(defthm obj-alist-p-of-hons-acons (equal (obj-alist-p (hons-acons a n x)) (and t t (obj-alist-p x))) :rule-classes ((:rewrite)))
Theorem:
(defthm alistp-when-obj-alist-p-rewrite (implies (obj-alist-p x) (alistp x)) :rule-classes ((:rewrite)))
Theorem:
(defthm alistp-when-obj-alist-p (implies (obj-alist-p x) (alistp x)) :rule-classes :tau-system)