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