People often talk about the proof as if they just enumerated every possible planar graph and checked. Which is true in a sense, but disregards the work that went into making it possible to enumerate the cases in the first place.
There are infinitely-many possible planar graphs, so you of course need to find some invariants that allow you to bring the necessary number of graphs to check to be finite. Beyond that, the techniques in the 4CT which make it actually possible to reduce the number of cases to a feasibly enumerable number are very clever and require some insight.
Proof by exhaustion is considered a real argument as long as there are not too many cases to exhaust. One of the most dramatic examples is the proof of that result that goes... if RH is true, then the result is true. If RH is false, then the result is true. Therefore, the result is true!
So, why make the cut-off point of when exhaustiong is an explanation at some finite number of cases?
To be fair, though it's a bit ambiguous, I read sebastialonso's post https://news.ycombinator.com/item?id=8799362 as indicating that he or she believes that the result is true—i.e., does not necessarily reject the validity of proof by exhaustion as a style of argumentation—but does not feel that the proof by exhaustion is an explanation.
There are infinitely-many possible planar graphs, so you of course need to find some invariants that allow you to bring the necessary number of graphs to check to be finite. Beyond that, the techniques in the 4CT which make it actually possible to reduce the number of cases to a feasibly enumerable number are very clever and require some insight.