Heap sort implemented in Python 3

heapsort.py

from heapq import heapify, heappop #is this cheating?
def heapsort(list):
  heap = heapify(list)
  newList = []
  while heap:
    newList.append(heappop(heap))
  return newList

if __name__ == '__main__':
  from sys import argv
  from random import shuffle

  list = list(range(int(argv[1])))
  shuffle(list)
  list = heapsort(list)
  print(all(list[i] <= list[i+1] for i in range(len(list)-1)))