K6 minors in large 6-connected graphs

Jørgensen conjectured that every 6-connected graph with no K6 minor has a vertex whose deletion makes the graph planar. We prove the conjecture for all sufficiently large graphs.