Sujet : Re: how
De : wolfgang.mueckenheim (at) *nospam* tha.de (WM)
Groupes : sci.mathDate : 22. Jun 2024, 22:30:23
Autres entêtes
Organisation : Nemoweb
Message-ID : <L45dAOJHQfxivFfY5S_SAJaT-R8@jntp>
References : 1 2 3 4 5 6 7 8 9 10
User-Agent : Nemo/0.999a
Le 22/06/2024 à 23:04, Jim Burns a écrit :
On 6/22/2024 4:12 PM, WM wrote:
Yes,
U{FISON} is the union of all its predecessors.
No,
U{FISON} is not a FISON.
How can adding a FISON change the character of the union?
U{FISON} is the union of all its predecessors.
U{FISON} is not a FISON. It is not finite.
The union cannot be larger than all its FISONs.
No FISON has ℵ₀ elements.
U{FISON} is not a FISON. It is not finite.
Repeat your nonsense claims as often as you like. They show only your incompetence to understand logic:
Every existing set of ordinals has a first or smallest element. The set of FISONs necessary to yield ℕ would be a set of ordinals. It is well defined since for every FISON we can determine whether it is necessary. It has no smallest element. ==> It is empty.
What is your counter argument, except parrotting U{FISON} is not a FISON? You have none!
IF ℕ is the union of FISONs, THEN ℕ is empty. ℕ is not empty. Regards, WM