TITLE: Is it normal to treat Math Theorems as "Black Boxes"
QUESTION [65 upvotes]: It seems to me that as one goes higher up in mathematics, the proof of theorems get more involved and convoluted, that at some point one must postpone (or even give up?) understanding all prior theorems, and take them as "Black Boxes" instead? Is this true?
Personally, in an ideal situation, I would certainly like to understand and know (and remember) the proof of the theorems, but am slowly finding it starting to be an uphill (and near impossible) task.
In high school, it is still quite possible for the conscientious student to learn and understand the proofs of Pythagoras' Theorem, limits proof of calculus, etc, even though it is not being taught in school. At the undergraduate level, things get harder, but I suppose it is still possible, to know all the necessary theorems proofs like Intermediate Value Theorem, Mean Value Theorem, etc.
As things go higher, the key theorems like Egorov's Theorem, Lebesgue's Differentiation Theorem, etc, have rather non-trivial proofs that span pages. I am sure there are more difficult theorems than these which have even more difficult proofs.
If I were to learn the full proof of the theorems first, before proceeding to learning other stuff, my progress would be painfully slow.
My question is: To do mathematics at a sufficiently high level, what are some tips to judge which theorems to learn in detail, and which to just take it like a "black box"? Any experiences to share?
Thanks.

REPLY [5 votes]: The question asked is refined --- albeit not definitively answered --- by Vladimir Voevodsky in recent works that include, in particular, the lectures "How I became interested in foundations of mathematics" (2014) and "UniMath" (2016).
Voevodsky's web pages provide links to both the lecture-slides (respectively, here and here) and the lecture-videos (respectively, here and here).  These lectures are suited particularly to young mathematicians.
In a nutshell, Voevodsky argues in his "UniMath" lecture of 2016 that:

Today we face a problem that involves two difficult to satisfy conditions.
On the one hand we have to find a way for computer assisted verification of mathematical proofs. This is necessary, first of all, because we have to stop the dissolution of the concept of proof in mathematics.
On the other hand we have to preserve the intimate connection between mathematics and the world of human intuition.
This connection is what moves mathematics forward and what we often experience as the beauty of mathematics.

The purpose of this answer is not to argue that Voevodsky's views are right or wrong in any absolute sense, but rather to suggest to anyone interested in these questions---students in particular---that Voevodsky's recent lectures and writings will amply reward careful study.