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