We say a formula ϕ has repeated occurrences of a bound variable x, if Qx appears more than once in the sub-formulas of ϕ (recall Q ∈{∀,∃}). Prove that there exists a formula ϕ0 which has no repeated occurrences of any bound variable such that ϕ and ϕ0 are syntactically equivalent.
