I have been presented with this syllogism:
All labradors are four legged (1)
All dogs are labradors (2)
Therefore, some dogs are four legged (3)
I responded valid, my reasoning as follows:
L = Labrador
F = Four Legged
D = Dog
∀x L(x) ->F(x) -- 1
∀x D(x) -> L(x) --2
The hypothesis:
∃x D(x) ∧ F(x)
I think I am allowed to begin my assumption by saying that if x is a dog, then by combining rules 1 and 2 then x is also four legged:
∀x (D(x) -> L(x) ∧ L(x) -> F(x)) -> ∀x ( D(x) -> F(x) ) -- 1+2
But - isn't the "is valid for all" statement trivially imply "is valid for some"?
Let me explain. If we have a generic predicate P, wouldn't it make sense that:
(a) ∀x P(x) |= ∃x P(x)
If that wasn't the case, then we'd have:
(b) ∀x P(x) |= ¬∃x P(x)
(Quite simply, because there either is or isn't an x that makes a given predicate valid, saying (c) ¬∃x P(x) ∧ ∃x P(x) would be a contradiction! )
Well, b must be false, as it translates to "P(x) being valid for all x entails that there is no x for which P(x) is valid" which is a contradiction. So by c we must accept a which allows me to (trivially) say that if all dogs are four legged, then some dogs are four legged.
..Any thoughts?