Re: The set of necessary FISONs

Am Sat, 08 Feb 2025 11:27:49 +0100 schrieb WM:

On 08.02.2025 01:14, Richard Damon wrote:

On 2/7/25 11:39 AM, WM wrote:

On 07.02.2025 17:10, Jim Burns wrote:

On 2/6/2025 2:32 PM, WM wrote:

>

I prefer Wikipedia:
∀P (P(1) /\ ∀k(P(k) ==> P(k+1)) ==> ∀n (P(n)).

>
That's intended to be part of the definition of ℕ₁

>
As well it is the definition of the collection of all FISONs.

>
Which is curious, when one considers that the collection of all
FISONs appears nowhere in it.

>
The axiom of induction says: If any property or predicate P satifies
(P(1) /\ ∀k(P(k) ==> P(k+1)), then it describes all elements of an
inductive = infinite set. That is satisfied by the set M of all FISONs
which are useless in U(A(n)) = ℕ.

 
So all elements are individually not needed.

 
All not needed elements belong to an inductive set.

All FISONs do.

Therefore the set of FISONs which could have the union
ℕ has no first element.

WTF? The first element of set of all FISONs is A(0) = {0}.

--
Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
It is not guaranteed that n+1 exists for every n.