Thank you for your interest and for advertising my work. 

The answer to this specific question (as well as to most of the questions asked on my work in this venue) is given in the paper published in JLC: Sergei Artemov. *Serial properties, selector proofs and the provability of consistency*. **Journal of Logic and Computation**,
https://doi.org/10.1093/logcom/exae034, Published: 26 July 2024. 
(Ask me if you have trouble downloading the paper from JLC.)

Here is the answer (a quote from the paper): "Whereas our methods allow proving the consistency of a theory in itself, we don’t know how to prove in T the consistency of a theory S, which is strictly stronger than T. In particular, Kurahashi-Sinclaire’s observation that prohibits PA from proving the consistency scheme for PA+ConPA shows also that PA cannot prove the consistency of ZF.

This paper refutes the Unprovability of Consistency thesis, and these findings have their foundational value. Though this does not reach the goals of Hilbert’s consistency program, it removes a principal roadblock on its way."