Independence of order of insertion hashtable with open addressing
You can get from any order to any other order by making a series of swaps (see e.g., https://en.wikipedia.org/wiki/Cyclic_permutation#Transpositions).  So, if you can prove that making a single swap never changes the number of attempts, then it follows that the number of attempts does not depend on the order.