Mathematical proofs written in natural language can often be used as guides to create formal proofs in proof assistants, depending on the level of detail of the proof and how many results and concepts it uses that have not already been written in the proof assistant. When this is done, the original proof serves as a natural language summary of the formal proof.
Sometimes the formal proof doesn't quite match the original proof, for example due to errors or skipped steps in the original proof. In these cases, as far as I know it's usually possible to straightforwardly modify the original proof to account for this modification.
But is it possible to construct natural language summaries of formal proofs that look very different from traditional natural language mathematics proofs, but still are readable to someone unfamiliar with the language?
For example, can people learn to use proof assistants without much exposure to traditional mathematics writing and then summarize their own work in new ways?