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