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