Basic theorems about modinstlist-p, generated by std::deflist.
Theorem:
(defthm modinstlist-p-of-cons (equal (modinstlist-p (cons acl2::a x)) (and (modinst-p acl2::a) (modinstlist-p x))) :rule-classes ((:rewrite)))
Theorem:
(defthm modinstlist-p-of-cdr-when-modinstlist-p (implies (modinstlist-p (double-rewrite x)) (modinstlist-p (cdr x))) :rule-classes ((:rewrite)))
Theorem:
(defthm modinstlist-p-when-not-consp (implies (not (consp x)) (equal (modinstlist-p x) (not x))) :rule-classes ((:rewrite)))
Theorem:
(defthm modinst-p-of-car-when-modinstlist-p (implies (modinstlist-p x) (iff (modinst-p (car x)) (or (consp x) (modinst-p nil)))) :rule-classes ((:rewrite)))
Theorem:
(defthm true-listp-when-modinstlist-p-compound-recognizer (implies (modinstlist-p x) (true-listp x)) :rule-classes :compound-recognizer)
Theorem:
(defthm modinstlist-p-of-list-fix (implies (modinstlist-p x) (modinstlist-p (list-fix x))) :rule-classes ((:rewrite)))
Theorem:
(defthm modinstlist-p-of-rev (equal (modinstlist-p (rev x)) (modinstlist-p (list-fix x))) :rule-classes ((:rewrite)))
Theorem:
(defthm modinstlist-p-of-repeat (iff (modinstlist-p (repeat acl2::n x)) (or (modinst-p x) (zp acl2::n))) :rule-classes ((:rewrite)))
Theorem:
(defthm modinstlist-p-of-append (equal (modinstlist-p (append acl2::a acl2::b)) (and (modinstlist-p (list-fix acl2::a)) (modinstlist-p acl2::b))) :rule-classes ((:rewrite)))
Theorem:
(defthm modinstlist-p-of-take (implies (modinstlist-p (double-rewrite x)) (iff (modinstlist-p (take acl2::n x)) (or (modinst-p nil) (<= (nfix acl2::n) (len x))))) :rule-classes ((:rewrite)))
Theorem:
(defthm modinstlist-p-of-butlast (implies (modinstlist-p (double-rewrite x)) (modinstlist-p (butlast x acl2::n))) :rule-classes ((:rewrite)))