Prefix and remainder theorems for vl-read-include, automatically generated by def-prefix/remainder-thms.
Theorem:
(defthm prefix-of-vl-read-include (and (true-listp (mv-nth 1 (vl-read-include echars config))) (implies (force (vl-echarlist-p echars)) (vl-echarlist-p (mv-nth 1 (vl-read-include echars config))))) :rule-classes ((:rewrite) (:type-prescription :corollary (true-listp (mv-nth 1 (vl-read-include echars config))))))
Theorem:
(defthm remainder-of-vl-read-include (and (equal (true-listp (mv-nth 2 (vl-read-include echars config))) (true-listp echars)) (implies (force (vl-echarlist-p echars)) (vl-echarlist-p (mv-nth 2 (vl-read-include echars config))))) :rule-classes ((:rewrite) (:type-prescription :corollary (implies (true-listp echars) (true-listp (mv-nth 2 (vl-read-include echars config)))))))
Theorem:
(defthm append-of-vl-read-include (equal (append (mv-nth 1 (vl-read-include echars config)) (mv-nth 2 (vl-read-include echars config))) echars))
Theorem:
(defthm no-change-loser-of-vl-read-include (implies (not (mv-nth 1 (vl-read-include echars config))) (equal (mv-nth 2 (vl-read-include echars config)) echars)))
Theorem:
(defthm acl2-count-of-vl-read-include-weak (<= (acl2-count (mv-nth 2 (vl-read-include echars config))) (acl2-count echars)) :rule-classes ((:rewrite) (:linear)))
Theorem:
(defthm acl2-count-of-vl-read-include-strong (implies (mv-nth 1 (vl-read-include echars config)) (< (acl2-count (mv-nth 2 (vl-read-include echars config))) (acl2-count echars))) :rule-classes ((:rewrite) (:linear)))