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