Re: The set of necessary FISONs

On 26.02.2025 15:21, joes wrote:

Am Wed, 26 Feb 2025 13:49:49 +0100 schrieb WM:

The power of induction proves ∀n ∈ U(F): |ℕ \ {1, 2, 3, ..., n}| = ℵo

It does not prove |N \ U{F(n): n e U(F)}| = oo.

Then U(F) must contain more than all n ∈ U(F). But it does not. And you cannot find a difference.

The *set* is not in the set.

No, why should it? But the set is proven to exist by induction.

Indeed, that you keep referring to removing |N| elements instead
of n e N is a mistake on your part. The existence has never been
disputed.

Then show what remains after removing all n ∈ U(F).
Regards, WM