The graph minor theorem and the graph structure theorem are two results which are invoked quite often in combinatorics/graph theory. Much like the classification of finite simple groups they are excellent ways of sweeping hundreds of pages of technical proofs under just a few sentences.