Capture-safe equality replacement gives the corrected scheme:
where replaces selected free occurrences of by , without capture. One may equivalently use full capture-avoiding substitution, after renaming conflicting binders. Replacing bound occurrences as though they were free is not permitted.
Here is a syntactic proof. Write for . First derive symmetry under : A6 and A4 give , and A7 applied to the first position in that atomic equality gives . Modus ponens and the deduction theorem give . Atomic replacement in the forward direction is A7 itself; in the reverse direction apply A7 with exchanged and use this symmetry. Thus under , an atomic formula and its designated replacement imply each other.
Induct on the formation of , proving both directions simultaneously. For negation, the reverse implication for the immediate subformula gives the forward implication of its negations by contraposition, and vice versa. For , the two induction equivalences combine propositionally to . This uses only the propositional tautologies allowed in this part.
For , first take distinct from . From assumptions and , A4 gives , the induction hypothesis gives , and generalization gives : is free in neither open assumption. Discharge the two assumptions to obtain . The reverse direction is identical. If the binder is , no free occurrence of that variable lies beneath it and the replacement there is empty. If it is , capture avoidance likewise forbids a changed free below that binder unless the binder is first renamed to a fresh variable. Bound-variable renaming is derived from A4 followed by admissible generalization and A5, with the same freshness restriction. This completes the structural induction and proves the scheme for arbitrary formulas.