Re: Separation,Power and Countability.

On Jun 19, 9:36 pm, zuhair <zaljo...@xxxxxxxxx> wrote:
On Jun 19, 11:05 pm, Keith Ramsay <kram...@xxxxxxx> wrote:

On Jun 19, 7:26 am, zuhair <zaljo...@xxxxxxxxx> wrote:
|I asked for the proof of the following:
|For any set d that is a member of Pw and is indefinable what is the
|prove of d being equinumerous to w?

Meaning, I suppose, how can one prove that each
undefinable subset A of w is equinumerous with w.

If A is finite, then A is definable as {n : n is
a natural number and (n=a0 or n=a1 or ... or
n=a_m)} for some a0,...,a_m.

If A is undefinable, then, A is infinite and each
infinite subset of w is equinumerous with w. Let
a0 be the least element of A, and inductively let
a_{k+1} be the least element of A not among a1,...,
a_k. Then a_i gives a 1-1 correspondence between
A and w.

Keith Ramsay

This depends on choice.

No, it doesn't; think about it for a moment.

MoeBlee

.

Relevant Pages

  • Re: Separation,Power and Countability.
    ... |For any set d that is a member of Pw and is indefinable what is the ... undefinable subset A of w is equinumerous with w. ... infinite subset of w is equinumerous with w. ... Keith Ramsay ...
    (sci.math)
  • Re: Separation,Power and Countability.
    ... |For any set d that is a member of Pw and is indefinable what is the ... undefinable subset A of w is equinumerous with w. ... infinite subset of w is equinumerous with w. ... Keith Ramsay ...
    (sci.math)
  • Re: Separation,Power and Countability.
    ... undefinable subset A of w is equinumerous with w. ... that is not a member of Pw and let d be indefinable ... Then let f map Pw into d by f= y. ... Oh, that's not what you had in mind, is it? ...
    (sci.math)