Question

"Prove these logical equivalences, assuming that the domain is nonempty."
"You will probably have to use a proof by cases on the two possible values of proposition"
"∀yQ(y) and ∃yQ(y) respectively. This proof will use word arguments (not symbolic formula manipulation)."
"(a) ∀x(∀yQ(y) → P (x)) ≡ ∀yQ(y) → ∀xP (x)"

Answer 1

if i expand this out ... i get .. Ax~AyQ(y) v P(x) for the left
and then for the right i get ~AyQ(y) v AxP(x) for the right

Answer 2

then i continue expanding out and get Ax ( Ey~Q(y) v P(x) ) on the left
and on the right i get ... Ey~Q(y) v AxP(x)

Answer 3

and then im STUCK Lol ...

Answer 4

i got confused

Answer 5

looks like ascii

Answer 6

its discrete math

Answer 7

Ah.

Answer 8

Well, I can help you, but I'm a bit rusty. Give me some time, lol.

Answer 9

ok lol sorry no can do
but watch

Answer 10

thanks!!!
ive been struggling for 3 hours or more

Answer 11

When you type A you mean it to be a universal quantification, and E is an existential one, right?

Answer 12

yes!

Answer 13

im not sure if i factored in properly but if you need to know any rules or confirm any rules i think i can confirm some of them ..

Answer 14

pikachu didnt i tell u if it has nothing to do with calc i skip?

Answer 15

Oh, my bad.

Also, gah, discrete math. >.< I know basic proofs, but never had a formal class in it.

Answer 16

actually you know what .. you dont even have to factor it out
... you just have to look at it and then .. somehow prove that it can be equivalent .. i just notice on either side theres a EyQ(y)

Answer 17

3 in the morning is not the time to be asking actually high level math problems, lol.

Answer 18

its ok Lol .. ive been working on it all day .. im kinda stumped lol

Answer 19

ill figure it out somehow lol thanks anyway