Isolation lemma is a technique used in randomized algorithms to reduce the number of solutions of a problem to one, should a solution exist. This is achieved by giving random weights to solutions and showing that there is a unique solution of minimal weight with constant probability. We will prove this lemma and use it to show that in a computational model called switching networks counting is not weaker than non determinism.