Liste des Groupes | Revenir à s math |
On 2/18/2025 10:22 AM, WM wrote:
You (WM) have located a problem.Wrong. Induction has been invented for infinite sets.
You try to work around it by not.mentioning it.
What you're not.mentioning is your assumption
that none of these sets are infinite.
⋃{F} = ℕProof: If UF = ℕ is assumed, then F(1) can be omitted without changing the union of the remainder. And if F(n) can be omitted without changing this union, then also F(n+1) can be omitted without changing this union. That makes the omitted FISONs the inductive collection of all FISONs and proves the implication: If UF = ℕ, then { } = ℕ.
Les messages affichés proviennent d'usenet.