# Prove or give counter example: $\forall x \exists y(Q(y)\wedge P(x))\vDash \exists y\forall x(Q(y)\wedge P(x))$

Prove or give counter example: $\forall x \exists y(Q(y)\wedge P(x))\vDash \exists y\forall x(Q(y)\wedge P(x))$

I think this statment is true:

$x$ and $y$ are not free, so I can use the following logical equivalences: $$\forall x(\alpha \vee \beta) \equiv \alpha \vee \forall x(\beta)$$ $$\exists x(\alpha \vee \beta) \equiv \alpha \vee \exists x(\beta)$$

$\forall x\exists y(Q(y)\wedge P(x))\Rightarrow\exists y(Q(y)\wedge\forall xP(x)) \Rightarrow \exists y(\forall xP(x)\wedge Q(y))\Rightarrow\forall xP(x)\wedge \exists yQ(y) \Rightarrow\exists y(\forall xP(x)\wedge Q(y))\Rightarrow\exists y( Q(y)\wedge\forall xP(x))\Rightarrow\exists y(\forall x( Q(y)\wedge P(x)))$

$\mathbf{\Rightarrow\exists y\forall x( Q(y)\wedge P(x))}$

 Did I get it right ? Thank you!

$$\forall x\exists y(Q(y)\wedge P(x))\Rightarrow\exists y(Q(y)\wedge\forall xP(x))$$

is not an instance of the two equivalence principles you mention, since the $\exists$ is between the $\forall$ and the $\land$

$$\forall x\exists y(Q(y)\wedge P(x))\Leftrightarrow \forall x\exists y(P(x)\wedge Q(y))\Leftrightarrow\forall x (P(x)\wedge \exists yQ(y))$$
• @rose12 commute, bring the $\forall$ in, commute, bring the $\exists$ out, commute, and bring the $\forall$ out – Bram28 Aug 12 '18 at 20:10