Re: The set of necessary FISONs

On 02.02.2025 21:11, Richard Damon wrote:

Since I don't recall you actually DEFINING what A(n) means, any assumption about it would be unwarranted.

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.
Regards, WM