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