Recognizer for vl-includeskips.
(vl-includeskips-p x) → *
Function:
(defun vl-includeskips-p (x) (declare (xargs :guard t)) (let ((__function__ 'vl-includeskips-p)) (declare (ignorable __function__)) (if (atom x) t (and (consp (car x)) (stringp (caar x)) (vl-iskipinfo-p (cdar x)) (vl-includeskips-p (cdr x))))))
Theorem:
(defthm vl-includeskips-p-of-revappend (equal (vl-includeskips-p (revappend acl2::x acl2::y)) (and (vl-includeskips-p (list-fix acl2::x)) (vl-includeskips-p acl2::y))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-remove (implies (vl-includeskips-p acl2::x) (vl-includeskips-p (remove acl2::a acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-last (implies (vl-includeskips-p (double-rewrite acl2::x)) (vl-includeskips-p (last acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-nthcdr (implies (vl-includeskips-p (double-rewrite acl2::x)) (vl-includeskips-p (nthcdr acl2::n acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-butlast (implies (vl-includeskips-p (double-rewrite acl2::x)) (vl-includeskips-p (butlast acl2::x acl2::n))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-update-nth (implies (vl-includeskips-p (double-rewrite acl2::x)) (iff (vl-includeskips-p (update-nth acl2::n acl2::y acl2::x)) (and (and (consp acl2::y) (stringp (car acl2::y)) (vl-iskipinfo-p (cdr acl2::y))) (or (<= (nfix acl2::n) (len acl2::x)) (and (consp nil) (stringp (car nil)) (vl-iskipinfo-p (cdr nil))))))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-repeat (iff (vl-includeskips-p (repeat acl2::n acl2::x)) (or (and (consp acl2::x) (stringp (car acl2::x)) (vl-iskipinfo-p (cdr acl2::x))) (zp acl2::n))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-take (implies (vl-includeskips-p (double-rewrite acl2::x)) (iff (vl-includeskips-p (take acl2::n acl2::x)) (or (and (consp nil) (stringp (car nil)) (vl-iskipinfo-p (cdr nil))) (<= (nfix acl2::n) (len acl2::x))))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-union-equal (equal (vl-includeskips-p (union-equal acl2::x acl2::y)) (and (vl-includeskips-p (list-fix acl2::x)) (vl-includeskips-p (double-rewrite acl2::y)))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-intersection-equal-2 (implies (vl-includeskips-p (double-rewrite acl2::y)) (vl-includeskips-p (intersection-equal acl2::x acl2::y))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-intersection-equal-1 (implies (vl-includeskips-p (double-rewrite acl2::x)) (vl-includeskips-p (intersection-equal acl2::x acl2::y))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-set-difference-equal (implies (vl-includeskips-p acl2::x) (vl-includeskips-p (set-difference-equal acl2::x acl2::y))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-set-equiv-congruence (implies (set-equiv acl2::x acl2::y) (equal (vl-includeskips-p acl2::x) (vl-includeskips-p acl2::y))) :rule-classes :congruence)
Theorem:
(defthm vl-includeskips-p-when-subsetp-equal (and (implies (and (subsetp-equal acl2::x acl2::y) (vl-includeskips-p acl2::y)) (vl-includeskips-p acl2::x)) (implies (and (vl-includeskips-p acl2::y) (subsetp-equal acl2::x acl2::y)) (vl-includeskips-p acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-rcons (iff (vl-includeskips-p (acl2::rcons acl2::a acl2::x)) (and (and (consp acl2::a) (stringp (car acl2::a)) (vl-iskipinfo-p (cdr acl2::a))) (vl-includeskips-p (list-fix acl2::x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-rev (equal (vl-includeskips-p (rev acl2::x)) (vl-includeskips-p (list-fix acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-duplicated-members (implies (vl-includeskips-p acl2::x) (vl-includeskips-p (duplicated-members acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-difference (implies (vl-includeskips-p acl2::x) (vl-includeskips-p (difference acl2::x acl2::y))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-intersect-2 (implies (vl-includeskips-p acl2::y) (vl-includeskips-p (intersect acl2::x acl2::y))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-intersect-1 (implies (vl-includeskips-p acl2::x) (vl-includeskips-p (intersect acl2::x acl2::y))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-union (iff (vl-includeskips-p (union acl2::x acl2::y)) (and (vl-includeskips-p (sfix acl2::x)) (vl-includeskips-p (sfix acl2::y)))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-mergesort (iff (vl-includeskips-p (mergesort acl2::x)) (vl-includeskips-p (list-fix acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-delete (implies (vl-includeskips-p acl2::x) (vl-includeskips-p (delete acl2::k acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-insert (iff (vl-includeskips-p (insert acl2::a acl2::x)) (and (vl-includeskips-p (sfix acl2::x)) (and (consp acl2::a) (stringp (car acl2::a)) (vl-iskipinfo-p (cdr acl2::a))))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-sfix (iff (vl-includeskips-p (sfix acl2::x)) (or (vl-includeskips-p acl2::x) (not (setp acl2::x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-list-fix (equal (vl-includeskips-p (list-fix acl2::x)) (vl-includeskips-p acl2::x)) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-append (equal (vl-includeskips-p (append acl2::a acl2::b)) (and (vl-includeskips-p acl2::a) (vl-includeskips-p acl2::b))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-when-not-consp (implies (not (consp acl2::x)) (vl-includeskips-p acl2::x)) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-cdr-when-vl-includeskips-p (implies (vl-includeskips-p (double-rewrite acl2::x)) (vl-includeskips-p (cdr acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-cons (equal (vl-includeskips-p (cons acl2::a acl2::x)) (and (and (consp acl2::a) (stringp (car acl2::a)) (vl-iskipinfo-p (cdr acl2::a))) (vl-includeskips-p acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-make-fal (implies (and (vl-includeskips-p acl2::x) (vl-includeskips-p acl2::y)) (vl-includeskips-p (make-fal acl2::x acl2::y))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-iskipinfo-p-of-cdr-when-member-equal-of-vl-includeskips-p (and (implies (and (vl-includeskips-p acl2::x) (member-equal acl2::a acl2::x)) (vl-iskipinfo-p (cdr acl2::a))) (implies (and (member-equal acl2::a acl2::x) (vl-includeskips-p acl2::x)) (vl-iskipinfo-p (cdr acl2::a)))) :rule-classes ((:rewrite)))
Theorem:
(defthm stringp-of-car-when-member-equal-of-vl-includeskips-p (and (implies (and (vl-includeskips-p acl2::x) (member-equal acl2::a acl2::x)) (stringp (car acl2::a))) (implies (and (member-equal acl2::a acl2::x) (vl-includeskips-p acl2::x)) (stringp (car acl2::a)))) :rule-classes ((:rewrite)))
Theorem:
(defthm consp-when-member-equal-of-vl-includeskips-p (implies (and (vl-includeskips-p 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) (vl-includeskips-p acl2::x) 'nil) (consp acl2::a)))))
Theorem:
(defthm vl-includeskips-p-of-fast-alist-clean (implies (vl-includeskips-p acl2::x) (vl-includeskips-p (fast-alist-clean acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-hons-shrink-alist (implies (and (vl-includeskips-p acl2::x) (vl-includeskips-p acl2::y)) (vl-includeskips-p (hons-shrink-alist acl2::x acl2::y))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-includeskips-p-of-hons-acons (equal (vl-includeskips-p (hons-acons acl2::a acl2::n acl2::x)) (and (stringp acl2::a) (vl-iskipinfo-p acl2::n) (vl-includeskips-p acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-iskipinfo-p-of-cdr-of-hons-assoc-equal-when-vl-includeskips-p (implies (vl-includeskips-p acl2::x) (iff (vl-iskipinfo-p (cdr (hons-assoc-equal acl2::k acl2::x))) (or (hons-assoc-equal acl2::k acl2::x) (vl-iskipinfo-p nil)))) :rule-classes ((:rewrite)))
Theorem:
(defthm vl-iskipinfo-p-of-cdar-when-vl-includeskips-p (implies (vl-includeskips-p acl2::x) (iff (vl-iskipinfo-p (cdar acl2::x)) (or (consp acl2::x) (vl-iskipinfo-p nil)))) :rule-classes ((:rewrite)))
Theorem:
(defthm stringp-of-caar-when-vl-includeskips-p (implies (vl-includeskips-p acl2::x) (iff (stringp (caar acl2::x)) (or (consp acl2::x) (stringp nil)))) :rule-classes ((:rewrite)))