It's pretty easy to imagine that, given a starting language, there are facts that require an arbitrary minimum number of words to prove. The only reason the proofs most people learn are short is because:
- There isn't time in a math course to teach arbitrarily long proofs
- Humans don't live long enough to construct arbitrarily long proofs.
- Human minds are turning out to be pretty feeble and they probably couldn't reliably construct and verify anything more than trivially short proofs in the era before computer assistance.
Yes, actually! Well, one of the kernels is, con-leche: https://github.com/leanprover/con-leche
"This is an external checker for the Lean theorem prover that is proven (in Lean) to be consistent in that it does not accept a proof of False."
Or you mean one implementation is used to prove another? In that case, you have a mutual (or circular) recursion of proofs