We have to be careful using the word 'meaning' in logic, because in natural language 'meaning' is associated with 'semantics', but semantics in logic refers to a whole new area involving
models and
interpretations, which need not be invoked when we are just talking about theorem proving as above.
In the absence of an
Interpretation, in the full model-theory sense of that word, there is no meaning of the symbol string ∀y.∀x.p(y,x). It is just a symbol string that is syntactically correct in a given language and from which can be deduced various different but logically equivalent symbol strings using the available logical and non-logical axioms and rules of inference.
A cleaner example is the two strings
∀x.q(x)
and
(r → r) ∧ ∀x.q(x)
The two are syntactically very different, but logically equivalent in most logical systems.
In the absence of a selected Interpretation, would one say they mean the same thing? Logic theory is silent on that question.
EDIT: As pointed out by
@Cabbage Farmer, this proves something different from what's in the OP. I'll leave this here to avoid confusion, and post a proof that relates to the
actual question below.
The proof, using the rules of a
Hilbert System, and referencing logical axioms, axiom schemas and metatheorems using the labels in that link, is:
1. ∀y.∀x.p(y,x) ⊢∀y.∀x.p(y,x)
2. ∀y.∀x.p(y,x) ⊢∀y.∀x.p(y,x) → ∀x. p(y,x) [Q5 with x:=x]
3. ∀y.∀x.p(y,x) ⊢∀x.p(y,x) [Modus Ponens on 1, 2]
4. ∀y.∀x.p(y,x) ⊢∀x.p(y,x)→ p(y,x) [Q5 with y:=y]
5. ∀y.∀x.p(y,x) ⊢p(y,x) [Modus Ponens on 3, 4]
6. ∀y.∀x.p(y,x) ⊢∀y.p(y,x) [Generalisation metatheorem on 5]
7. ∀y.∀x.p(y,x) ⊢∀x.∀y.p(y,x) [Generalisation metatheorem on 6]
8. ⊢∀y.∀x.p(y,x)→∀x.∀y.p(y,x) [deduction theorem (metatheorem) on 7]
We can then switch x and y and follow the same steps to prove that
⊢ ∀x.∀y.p(y,x)→∀y.∀x.p(y,x)
and putting the two together we get
⊢∀y.∀x.p(y,x) ↔∀x.∀y.p(y,x)
So we have proven that the two are logically equivalent, despite being syntactically very different. Sometimes the symbol ≡ is used to denote full syntactic equivalence, as distinct from logical equivalence (↔). That can be useful when alternate forms of notation are used in the same system. For instance when writing in a Hilbert system, in which the only official operators are ¬ and →, it is sometimes convenient to use the symbols ∨ and ∧ as shortcuts, so that (a∨b) is shorthand for (¬a→b) and (a∧b) is shorthand for ¬(a→¬b). Then one could write (a∨b) ≡ (¬a→b) meaning that, on a formal level, the two are syntactically identical because the LHS is just an informal abbreviation for the RHS. But we could not write
∀x.q(x) ≡ (r → r) ∧ ∀x.q(x)
as the two are syntactically distinct, even though in most logics they are logically equivalent.
Not all texts distinguish between ↔ and ≡ which I think is a pity because the distinction is often useful when one is using extended symbol sets.