Basic theorems about hex-pair-listp, generated by std::deflist.
Theorem:
(defthm hex-pair-listp-of-cons (equal (hex-pair-listp (cons acl2::a acl2::x)) (and (hex-pairp acl2::a) (hex-pair-listp acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-cdr-when-hex-pair-listp (implies (hex-pair-listp (double-rewrite acl2::x)) (hex-pair-listp (cdr acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-when-not-consp (implies (not (consp acl2::x)) (equal (hex-pair-listp acl2::x) (not acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pairp-of-car-when-hex-pair-listp (implies (hex-pair-listp acl2::x) (iff (hex-pairp (car acl2::x)) (consp acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm true-listp-when-hex-pair-listp-compound-recognizer (implies (hex-pair-listp acl2::x) (true-listp acl2::x)) :rule-classes :compound-recognizer)
Theorem:
(defthm hex-pair-listp-of-list-fix (implies (hex-pair-listp acl2::x) (hex-pair-listp (list-fix acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-sfix (iff (hex-pair-listp (sfix acl2::x)) (or (hex-pair-listp acl2::x) (not (setp acl2::x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-insert (iff (hex-pair-listp (insert acl2::a acl2::x)) (and (hex-pair-listp (sfix acl2::x)) (hex-pairp acl2::a))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-delete (implies (hex-pair-listp acl2::x) (hex-pair-listp (delete acl2::k acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-mergesort (iff (hex-pair-listp (mergesort acl2::x)) (hex-pair-listp (list-fix acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-union (iff (hex-pair-listp (union acl2::x acl2::y)) (and (hex-pair-listp (sfix acl2::x)) (hex-pair-listp (sfix acl2::y)))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-intersect-1 (implies (hex-pair-listp acl2::x) (hex-pair-listp (intersect acl2::x acl2::y))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-intersect-2 (implies (hex-pair-listp acl2::y) (hex-pair-listp (intersect acl2::x acl2::y))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-difference (implies (hex-pair-listp acl2::x) (hex-pair-listp (difference acl2::x acl2::y))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-duplicated-members (implies (hex-pair-listp acl2::x) (hex-pair-listp (duplicated-members acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-rev (equal (hex-pair-listp (rev acl2::x)) (hex-pair-listp (list-fix acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-append (equal (hex-pair-listp (append acl2::a acl2::b)) (and (hex-pair-listp (list-fix acl2::a)) (hex-pair-listp acl2::b))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-rcons (iff (hex-pair-listp (rcons acl2::a acl2::x)) (and (hex-pairp acl2::a) (hex-pair-listp (list-fix acl2::x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pairp-when-member-equal-of-hex-pair-listp (and (implies (and (member-equal acl2::a acl2::x) (hex-pair-listp acl2::x)) (hex-pairp acl2::a)) (implies (and (hex-pair-listp acl2::x) (member-equal acl2::a acl2::x)) (hex-pairp acl2::a))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-when-subsetp-equal (and (implies (and (subsetp-equal acl2::x acl2::y) (hex-pair-listp acl2::y)) (equal (hex-pair-listp acl2::x) (true-listp acl2::x))) (implies (and (hex-pair-listp acl2::y) (subsetp-equal acl2::x acl2::y)) (equal (hex-pair-listp acl2::x) (true-listp acl2::x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-set-difference-equal (implies (hex-pair-listp acl2::x) (hex-pair-listp (set-difference-equal acl2::x acl2::y))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-intersection-equal-1 (implies (hex-pair-listp (double-rewrite acl2::x)) (hex-pair-listp (intersection-equal acl2::x acl2::y))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-intersection-equal-2 (implies (hex-pair-listp (double-rewrite acl2::y)) (hex-pair-listp (intersection-equal acl2::x acl2::y))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-union-equal (equal (hex-pair-listp (union-equal acl2::x acl2::y)) (and (hex-pair-listp (list-fix acl2::x)) (hex-pair-listp (double-rewrite acl2::y)))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-take (implies (hex-pair-listp (double-rewrite acl2::x)) (iff (hex-pair-listp (take acl2::n acl2::x)) (or (hex-pairp nil) (<= (nfix acl2::n) (len acl2::x))))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-repeat (iff (hex-pair-listp (repeat acl2::n acl2::x)) (or (hex-pairp acl2::x) (zp acl2::n))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pairp-of-nth-when-hex-pair-listp (implies (hex-pair-listp acl2::x) (iff (hex-pairp (nth acl2::n acl2::x)) (< (nfix acl2::n) (len acl2::x)))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-update-nth (implies (hex-pair-listp (double-rewrite acl2::x)) (iff (hex-pair-listp (update-nth acl2::n acl2::y acl2::x)) (and (hex-pairp acl2::y) (or (<= (nfix acl2::n) (len acl2::x)) (hex-pairp nil))))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-butlast (implies (hex-pair-listp (double-rewrite acl2::x)) (hex-pair-listp (butlast acl2::x acl2::n))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-nthcdr (implies (hex-pair-listp (double-rewrite acl2::x)) (hex-pair-listp (nthcdr acl2::n acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-last (implies (hex-pair-listp (double-rewrite acl2::x)) (hex-pair-listp (last acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-remove (implies (hex-pair-listp acl2::x) (hex-pair-listp (remove acl2::a acl2::x))) :rule-classes ((:rewrite)))
Theorem:
(defthm hex-pair-listp-of-revappend (equal (hex-pair-listp (revappend acl2::x acl2::y)) (and (hex-pair-listp (list-fix acl2::x)) (hex-pair-listp acl2::y))) :rule-classes ((:rewrite)))