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