Occam's Razor (also written as Ockham's razor from William of Ockham (c. 1287 – 1347), and in Latin lex parsimoniae) is a principle of parsimony, economy, or succinctness used in problem-solving. It states that among competing hypotheses, the one with the fewest assumptions should be selected. Other, more complicated solutions may ultimately prove correct, but - in the absence of certainty - the fewer assumptions that are made, the better.
"Quoted from Wikipedia"
In mathematics there are theorems which have several proofs, some short and some long. Based on the limitation of time I cannot explain more than one proof for each multi-proof theorem in my courses but there is a problem here.
Question. Which proof should I choose?
Based on the Occam's razer I should choose the shorter one because it is simpler and less confusing but it seems some of the longer proofs for a particular theorem have more intuitive content. They explain the nature of the phenomenon better. Also they show the complexity and importance of the theorem clearly. Maybe students can gain a deeper intuition using some of these longer proofs. In other words my question is about possible (dis)advantages of using Occam's Razor in mathematics. Precisely, is there any exception for Occam's Razor principal in mathematics? Is there a longer proof of a particular theorem which has a significant educational advantage to all other shorter proofs?
Example. In my "Introduction to Large Cardinal Theory" graduate course, there are several approaches to Hanf-Tarski theorem which says The least inaccessible cardinal is not measurable. The current standard proof in textbooks (e.g. Drake, An Introduction to Large Cardinal Theory) is based on a very short simplified proof but Tarski and Hanf's original sophisticated argument (using introducing the notion of a weakly compact cardinal and analyzing the expression power of infinitary language $\mathcal{L}_{\kappa,\kappa}$ for weakly compact cardinal $\kappa$) is really useful for understanding the complexity of this theorem which was one of the most important open problems of set theory for many years.