Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: WM <wolfgang.mueckenheim@tha.de>
Newsgroups: sci.math
Subject: Re: The set of necessary FISONs
Date: Mon, 3 Feb 2025 18:22:39 +0100
Organization: A noiseless patient Spider
Lines: 23
Message-ID: <vnqu0v$1cbur$1@dont-email.me>
References: <vmo1bs$1rnl$1@dont-email.me> <vnl5dv$3ae6$2@dont-email.me>
 <080c854de10093669d87615694e51dd052ed2394@i2pn2.org>
 <vnlog6$6dbv$2@dont-email.me>
 <bf10f777d4005fb3ee28e246cbe0245d554223d3@i2pn2.org>
 <vnnl8v$kkq0$1@dont-email.me>
 <80abaa335fdefb7dfd2cf4694a8bc1eba7f3eecd@i2pn2.org>
 <vno6rg$nm9i$4@dont-email.me>
 <fdb7f19edfab2141f518d74f00df194616d16121@i2pn2.org>
 <vnqmar$1a7ie$1@dont-email.me> <EQiG1s5v1m-CQrQ0IP6Qop7elHU@jntp>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Mon, 03 Feb 2025 18:22:39 +0100 (CET)
Injection-Info: dont-email.me; posting-host="c18b476823b5321779f9f8668e16b24c";
	logging-data="1454043"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1+HbgEcB+wgepmwmGCoS7febqdiilsmizk="
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:cQeTWyr1xLoV72cQKKOHFwPfPeU=
In-Reply-To: <EQiG1s5v1m-CQrQ0IP6Qop7elHU@jntp>
Content-Language: en-US
Bytes: 2358

On 03.02.2025 16:15, Python wrote:
> Le 03/02/2025 à 16:11, crank Wolfang Mückenheim aka WM a écrit :
>> German A(n), or English F(n) 
>> is the FISON {1, 2, 3, ..., n}.
>> The assumption is that U(F(n)) = ℕ.
>>
>> By induction we prove that every F(n) can be removed without changing 
>> the union. Therefore the assumption leads to { } = ℕ. Therefore the 
>> assumption is wrong.
> 
> Anyone able to claim such a fallacy

You appear far unable to understand this discussion. Every intelligent 
mathematician understands: All natural numbers created by Peano 
induction are subject to induction and can be removed by the same 
induction. Matheology needs the wselfcontradictory assumption that the 
set ℕ is constructed by induction but cannot be deconstructed by induction.

By the way, have you meanwhile understood why Rennenkampff's example 
failed? Hint: First you have to enumerate the euros.

Regards, WM