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