The statement, “At least one of your friends is perfect”. Let P (x) be “x is perfect” and let F (x) be “x is your friend” and let the domain be all people.
(a) ∀x (F (x) → P (x))
(b) ∀x (F (x) ∧ P (x))
(c) ∃x (F (x) ∧ P (x))
(d) ∃x (F (x) → P (x))
The question was posed to me in class test.
I'm obligated to ask this question of Predicate Logic Quantifiers in chapter The Foundation: Logics and Proofs of Discrete Mathematics