MHB Conditional proof for multiple quantifier

Click For Summary
To prove ((Ǝx) F(x) → (Ǝx) G(x)) using conditional proof, start with the premises: ((Ǝx) F(x) → (∀z) H(z)) and H(a) → G(b). The discussion suggests that a formal proof in logical calculus may be necessary for clarity. A reference link is provided for additional guidance on formal proofs. Understanding the relationship between existential and universal quantifiers is crucial in this context.
lize
Messages
1
Reaction score
0
Hi, I don't know how to prove ((Ǝx) F(x) →(Ǝx) (G(x)) with conditional proof from:
((Ǝx) F(x) → (∀z) H(z))
H(a) →G(b)

Thanks
 
Physics news on Phys.org
What kind of proof do you have in mind? If you are talking about a formal proof in some logical calculus, then please see https://driven2services.com/staging/mh/index.php?threads/29/.
 
First trick I learned this one a long time ago and have used it to entertain and amuse young kids. Ask your friend to write down a three-digit number without showing it to you. Then ask him or her to rearrange the digits to form a new three-digit number. After that, write whichever is the larger number above the other number, and then subtract the smaller from the larger, making sure that you don't see any of the numbers. Then ask the young "victim" to tell you any two of the digits of the...

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K