507 views
3 votes
3 votes
∀x∃y P(x) → Q(y) ≡ ∀x P(x) → ∃yQ(y)

We have to prove whether this is a tautology or not.

How do we proceed ?

2 Answers

Best answer
2 votes
2 votes

Let $P\left ( x \right )=$" $x$ is a is divisible by  2

Let $Q\left ( y \right )=$" $y$ is a Divisible by  4

And let domain be even number.

$\forall x \exists P\left ( x \right )\rightarrow Q\left ( x \right )$

LHS implies $\forall P\left ( x \right )$  is true and also $\exists y Q\left ( y \right )\left [ y=\left \{ 4,8,12,.. \right \} \right ]$

True$\rightarrow$True $\Rightarrow$true

now $\forall x P\left ( x \right )\rightarrow \exists y Q\left ( y \right )$

$\forall x P\left ( x \right )$ is always true and also $\exists y Q\left ( y \right )$ is also true 

True$\rightarrow$true$\Rightarrow$true 

$\therefore$LHS$=$RHS

If you have confusion change the domain,


Let domain be  the Prime number,

now taking your LHS $\forall P\left ( x \right )$ is false ,you can blindly say LHS is True and same for RHS giving $\Rightarrow$LHS= RHS


selected by
1 votes
1 votes
P: fall from scooter

Q: break the leg

LHS: If all fell from scooter, then some of them broke their legs.

RHS: Also the same thing.

So, tautology.

We can move the Ǝy ahead so that LHS is equivalent to RHS.
edited by

Related questions

1 votes
1 votes
0 answers
1
1 votes
1 votes
2 answers
4
vijaycs asked Aug 19, 2016
1,359 views
Please give one example of each following logic in english sentence -1. ($\forall$xP(x) - $\exists$xQ(x)) == $\exists$x(P(x) - Q(x))2. ($\exists$xP(x) - $\forall$xQ(x)) ...