jsfisher
ETcorngods survivor
- Joined
- Dec 23, 2005
- Messages
- 24,532
OK, let us follow ZF where any member must be also a set.
1) This rule does not hold in the case of the empty set, because the "member" of {} is not a set.
Wrong. Every member of {} is a set, without exception.
2) Let us say that 0={} and 1={{}}, so in this case {1}={{{}}}.
Ok. You have unnecessarily complicated HatRack's example (as is your custom), but proceed.
3) Any other set (accept {{}})
(The word is "except" by the way.)
...is not a member of {{{}}},
Oddly presented, but substantially what HatRack posted. The set containing {{}} as its member has {{}} as its member and no other set (including itself) as a member.
...so also in this case a given set is used as a factor in order to determine itself as a part of its own derermination.
Well, that's HatRack's point, now wasn't it? Such a construction is always possible, so if it invalidates things, then everything, including Doronetics, is invalid. But, of course, since it is not circular reasoning (except in the twisted but fortunately invalid logic embodied in Doronetics), the world is safe. Mathematics still works.
So thank you HatRack, according to (1) and (3) we see that ZF is based on an invalid reasoning.
Well, if we overlook your failures in logic, that may be true, but only in some alternate universe.
js.