Alphabetic Substitution is Semantically Equivalent/Universal Quantifier

Theorem
Then:
 * $\forall x: \map \phi x$ and $\forall z: \map \phi z$ are semantically equivalent