We wish to prove that for any machine N, ShortestPath(M ∩ N ) passes through the equivalent states in M to those passed through in M for ShortestPath(M ∩ N).
determinization of the resulting intersection after -removal yields the same topology as intersection with the equivalent φ machine.