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