The original four color theorem proof used a computer as a computational aid for some nasty casework: the procedure for checking each case and the list of cases that needed to be checked were found by hand.
Proving something in a theorem prover means the proof itself is an object constructed in the prover's language.
I think that's a bit too harsh. An entire complicated proof concocted solely looking at a computer screen in Coq? Every mathematician will have plenty of hand written sketches, ideas and parts of proofs. Does that mean it was "ported" to Coq?
> I think that's a bit too harsh. An entire complicated proof concocted solely looking at a computer screen in Coq?
Nobody is suggesting this, and in this case, it was indeed "ported" to Coq from existing sketches.
The distinction here isn't between on-paper-first vs computer-first. The distinction here is between using a custom computer program to perform computations for a mostly-paper proof, versus taking an existing general-purpose theorem-checker (Coq, in this case) and writing down the entire proof in its language so it can check it.
No, the point is that the proof itself should be written in the Coq language. The original 4-color proof in 1976 was written in English. They used computer programs to do certain computations, but the proof that those programs were correct and that they were computing the right thing was written in English and checked by humans.
https://en.m.wikipedia.org/wiki/Four_color_theorem
I guess maybe I don't understand what you mean by "formally verified setting", but I believe the four color theorem was first proven using a computer.
> Although flawed, Kempe's original purported proof of the four color theorem provided some of the basic tools later used to prove it.
It sounds like Kempe laid some of the groundwork, but then the theorem was ultimately proved using a computer.
I could be wrong though, I'm not an expert in this area.