Recognizer for id-neg-alist.
(id-neg-alist-p x) → *
Function:
(defun id-neg-alist-p (x) (declare (xargs :guard t)) (let ((__function__ 'id-neg-alist-p)) (declare (ignorable __function__)) (if (atom x) (eq x nil) (and (consp (car x)) (natp (caar x)) (bitp (cdar x)) (id-neg-alist-p (cdr x))))))
Theorem:
(defthm id-neg-alist-p-of-butlast (implies (id-neg-alist-p (double-rewrite x)) (id-neg-alist-p (butlast x acl2::n))) :rule-classes ((:rewrite)))
Theorem:
(defthm id-neg-alist-p-of-rev (equal (id-neg-alist-p (acl2::rev x)) (id-neg-alist-p (acl2::list-fix x))) :rule-classes ((:rewrite)))
Theorem:
(defthm id-neg-alist-p-of-append (equal (id-neg-alist-p (append acl2::a acl2::b)) (and (id-neg-alist-p (acl2::list-fix acl2::a)) (id-neg-alist-p acl2::b))) :rule-classes ((:rewrite)))
Theorem:
(defthm id-neg-alist-p-of-list-fix (implies (id-neg-alist-p x) (id-neg-alist-p (acl2::list-fix x))) :rule-classes ((:rewrite)))
Theorem:
(defthm true-listp-when-id-neg-alist-p-compound-recognizer (implies (id-neg-alist-p x) (true-listp x)) :rule-classes :compound-recognizer)
Theorem:
(defthm id-neg-alist-p-when-not-consp (implies (not (consp x)) (equal (id-neg-alist-p x) (not x))) :rule-classes ((:rewrite)))
Theorem:
(defthm id-neg-alist-p-of-cdr-when-id-neg-alist-p (implies (id-neg-alist-p (double-rewrite x)) (id-neg-alist-p (cdr x))) :rule-classes ((:rewrite)))
Theorem:
(defthm id-neg-alist-p-of-cons (equal (id-neg-alist-p (cons acl2::a x)) (and (and (consp acl2::a) (natp (car acl2::a)) (bitp (cdr acl2::a))) (id-neg-alist-p x))) :rule-classes ((:rewrite)))
Theorem:
(defthm id-neg-alist-p-of-remove-assoc (implies (id-neg-alist-p x) (id-neg-alist-p (remove-assoc-equal acl2::name x))) :rule-classes ((:rewrite)))
Theorem:
(defthm id-neg-alist-p-of-put-assoc (implies (and (id-neg-alist-p x)) (iff (id-neg-alist-p (put-assoc-equal acl2::name acl2::val x)) (and (natp acl2::name) (bitp acl2::val)))) :rule-classes ((:rewrite)))
Theorem:
(defthm id-neg-alist-p-of-fast-alist-clean (implies (id-neg-alist-p x) (id-neg-alist-p (fast-alist-clean x))) :rule-classes ((:rewrite)))
Theorem:
(defthm id-neg-alist-p-of-hons-shrink-alist (implies (and (id-neg-alist-p x) (id-neg-alist-p acl2::y)) (id-neg-alist-p (hons-shrink-alist x acl2::y))) :rule-classes ((:rewrite)))
Theorem:
(defthm id-neg-alist-p-of-hons-acons (equal (id-neg-alist-p (hons-acons acl2::a acl2::n x)) (and (natp acl2::a) (bitp acl2::n) (id-neg-alist-p x))) :rule-classes ((:rewrite)))
Theorem:
(defthm bitp-of-cdr-of-hons-assoc-equal-when-id-neg-alist-p (implies (id-neg-alist-p x) (iff (bitp (cdr (hons-assoc-equal acl2::k x))) (or (hons-assoc-equal acl2::k x) (bitp nil)))) :rule-classes ((:rewrite)))
Theorem:
(defthm alistp-when-id-neg-alist-p-rewrite (implies (id-neg-alist-p x) (alistp x)) :rule-classes ((:rewrite)))
Theorem:
(defthm alistp-when-id-neg-alist-p (implies (id-neg-alist-p x) (alistp x)) :rule-classes :tau-system)
Theorem:
(defthm bitp-of-cdar-when-id-neg-alist-p (implies (id-neg-alist-p x) (iff (bitp (cdar x)) (or (consp x) (bitp nil)))) :rule-classes ((:rewrite)))
Theorem:
(defthm natp-of-caar-when-id-neg-alist-p (implies (id-neg-alist-p x) (iff (natp (caar x)) (or (consp x) (natp nil)))) :rule-classes ((:rewrite)))