(struct-declon-list-rename c$::struct-declon-list subst) → fty::result
Theorem:
(defthm struct-declon-list-rename-type-prescription (true-listp (struct-declon-list-rename c$::struct-declon-list subst)) :rule-classes :type-prescription)
Theorem:
(defthm struct-declon-list-rename-when-atom (implies (atom c$::struct-declon-list) (equal (struct-declon-list-rename c$::struct-declon-list subst) nil)))
Theorem:
(defthm struct-declon-list-rename-of-cons (equal (struct-declon-list-rename (cons c$::struct-declon c$::struct-declon-list) subst) (cons (struct-declon-rename c$::struct-declon subst) (struct-declon-list-rename c$::struct-declon-list subst))))
Theorem:
(defthm struct-declon-list-rename-of-append (equal (struct-declon-list-rename (append acl2::x acl2::y) subst) (append (struct-declon-list-rename acl2::x subst) (struct-declon-list-rename acl2::y subst))))
Theorem:
(defthm consp-of-struct-declon-list-rename (equal (consp (struct-declon-list-rename c$::struct-declon-list subst)) (consp c$::struct-declon-list)))
Theorem:
(defthm len-of-struct-declon-list-rename (equal (len (struct-declon-list-rename c$::struct-declon-list subst)) (len c$::struct-declon-list)))
Theorem:
(defthm nth-of-struct-declon-list-rename (equal (nth acl2::n (struct-declon-list-rename c$::struct-declon-list subst)) (if (< (nfix acl2::n) (len c$::struct-declon-list)) (struct-declon-rename (nth acl2::n c$::struct-declon-list) subst) nil)))
Theorem:
(defthm struct-declon-list-rename-of-revappend (equal (struct-declon-list-rename (revappend acl2::x acl2::y) subst) (revappend (struct-declon-list-rename acl2::x subst) (struct-declon-list-rename acl2::y subst))))
Theorem:
(defthm struct-declon-list-rename-of-reverse (equal (struct-declon-list-rename (reverse c$::struct-declon-list) subst) (reverse (struct-declon-list-rename c$::struct-declon-list subst))))