Applying insertion sort to an ordered list of integers in a range yields the same list.
This should be moved to a more general library.
Theorem:
(defthm insertion-sort-of-integers-from-to (implies (and (integerp min) (integerp max)) (equal (insertion-sort (integers-from-to min max)) (integers-from-to min max))))