theorem Std.PRange.Nat.succ_eq {n : Nat} : UpwardEnumerable.succ n = n + 1

theorem Std.PRange.Nat.ClosedOpen.toList_succ_succ {m n : Nat} : ((m + 1)...n + 1).toList = List.map (fun (x : Nat) => x + 1) (m...n).toList