> The existence of an undiscovered soundness bug doesn't make everything proven in Lean illicit. The proof would have to exploit the bug.
Yes, correct. The proofs would have to be checked to make sure they don't exploit the bug.
> computer formal verification could reach the trustworthiness of math itself.
Yes, it could. I don't think that is currently the case.