Every well-ordered set is isomorphic to an ordinal. Common notion, for example see Introduction to https://arxiv.org/abs/2409.07352

⊢((𝐴∈V∧𝑅We𝐴)↔∃𝑓(dom𝑓∈On∧𝑓IsomE,𝑅(dom𝑓,𝐴)))

\[ \vdash ( ( A \in \mathrm{V} \wedge R \mathrm{We} A ) \leftrightarrow \exists f ( \mathrm{dom} f \in \mathrm{On} \wedge f \mathrm{Isom} \mathrm{E} , R ( \mathrm{dom} f , A ) ) ) \]

Every well-ordered set is isomorphic to
a unique ordinal.

⊢((𝐴∈V∧𝑅We𝐴)↔∃!𝑜∈On∃𝑓∈(𝐴↑ₘ𝑜)𝑓IsomE,𝑅(𝑜,𝐴))

\[ \vdash ( ( A \in \mathrm{V} \wedge R \mathrm{We} A ) \leftrightarrow \exists{!} o \in \mathrm{On} \exists f \in ( A \uparrow_\mathrm{m} o ) f \mathrm{Isom} \mathrm{E} , R ( o , A ) ) \]

We can phrase the Axiom of Choice as "Every set injects into an ordinal."

⊢(CHOICE↔∀𝑥∃𝑜∈On𝑥≼𝑜)

\[ \vdash ( \mathrm{CHOICE} \leftrightarrow \forall x \exists o \in \mathrm{On} x \preccurlyeq o ) \]

#math #metamath #SetTheory #WellOrdering #OrdinalNumbers

@FishFace Update:

What I refer to as EScbO is usually called #LO the #LinearOrdering principle.

⊢ ∃y ∀a ∈ x ∀b ∈ x ∀c ∈ x (¬ aya ∧ ((ayb ∧ byc) → ayc) ∧ (ayb ∨ a = b ∨ bya))
or using abbreviations in #Metamath
⊢ ∃y y Or x

I think AC implies LO, but LO is independent of DC and CC.

So we have { 1, 2 } ∈ Fin₁ ⊆ Fin₁ₐ ⊆ Fin₂ ⊆ Fin₃ ⊆ Fin₄ ⊆ Fin₅ ⊆ Fin₆ ⊆ Fin₇

If a set is in Fin₁ then it is considered finite by all the other definitions.

But since the axiom of choice is equivalent to saying every set can be well-ordered, if we accept it VII-finite sets are equinumerous with a finite ordinal and so Fin₇ ⊆ Fin₁ and so the differences between these definitions collapse and ZF becomes ZFC, which is a widely accepted basis for Set Theory.

My consultation with math resources was inspired by a blog post:

https://www.infinitelymore.xyz/p/what-is-the-infinite

#Metamath #ZFC #SetTheory #AxiomOfChoice #FiniteSet #Infinity

What is the infinite?

What does it mean, exactly, to say that a set is infinite? Can we provide precise mathematical definitions of the finite and the infinite?

Infinitely More

Also from #Metamath I learned #infinity is hard to think about.

A . Lévy in "The independence of various definitions of finiteness" Fundamenta Mathematicae, 46:1-13 (1958) established 8 distinct set-theoretic definitions of a #finiteSet which in ZF cannot be equated without the #AxiomOfChoice

I-finite -- equinumerous with a finite ordinal. // i.e. admits a finite well-order (Numerically Finite) ⟺ the powerset of its powerset is Dedekind finite ⟺ every collection of its subsets has a maximum element ⟺ every collection of subsets has a minimal element

Ia-finite -- not the union of two sets which are not I-finite

II-finite -- every possible way of finding within the set a chain of nested subsets always contains a maximum element (Tarski finite) ⟺ equivalently every such chain contains its intersection ⟺ (Linearly Finite) ⟺ (Stäckel Finite)

|||-finite -- It's powerset is |V-finite finite, (weakly Dedekind finite) ⟺ cannot be mapped onto ordinal ω ⟺ doesn't contain a chain of subsets which can be placed in order with ω

|V-finite -- doesn't have a proper subset which is equinumerous to itself. (Dedekind finite) ⟺ there is no 1-1 map from ordinal ω to it ⟺ it is strictly dominated by the disjoint sum of it and a singleton (acts finite under successor)

V-finite -- it is either empty or strictly dominated by the disjoint sum of it with itself (acts finite under addition)

VI-finite -- it is either empty, a singleton or strictly dominated by the Cartesian product of it with itself (acts finite under multiplication)

VII-finite -- it cannot be infinitely well-ordered (not equiinumerous with the ordinal ω or any larger ordinal)

Keeping busy with Sudoku, Wordle, Crosswords, and mining textbooks for statements to practice proving in #Metamath ...

Inspired by this video playlist on #RealAnalysis #Math

https://www.youtube.com/playlist?list=PLYPU-RArkLZNwMZ55-y8FZZEeY7zCJX59

Which was created from https://www.jirka.org/ra/ _Basic Analysis:
Introduction to Real Analysis_ by Jiří Lebl. #JiříLebl a #CreativeCommons (4.0) free #math #textbook

In Metamath's compressed format, my proofs of strong induction over the natural numbers took 316 bytes, well-ordering of the natural numbers: 376 bytes, 2ⁿ⁻¹ ≤ n! : 1204 bytes, formula for finite sum of geometric series: 2566 bytes. The last has 147 steps, some of which are reused and some of which depend on up to 8 prior steps and on a truncated library of 30477 statements of syntax, axioms, definitions, and theorems from the wider world of Metamath.

Readings shared October 29, 2025

The readings shared in Bluesky on 29 October 2025 are: Formalizing Schwartz functions and tempered distributions. ~ Moritz Doll. #ITP #LeanProver #Math 1000+ theorems (The spiritual successor of Free

Vestigium
1000+ theorems (The spiritual successor of Freek’s list of 100 theorems. Now with more than 1000 theorems!). ~ Katja Berčič et als. https://1000-plus.github.io/all #Math #ITP #IsabelleHOL #HOL_Light #Rocq #LeanProver #Metamath #Mizar
All theorems

Keeping track of formalizations of theorems from the Wikipedia’s List of theorems.

1000+ theorems

At #Dyalog24, Brandon Wilson is demonstrating how APL can handle large mathematical databases like Metamath, offering a unique solution for efficient proof verification. But who will ask the questions at the end? 😱

#APL #ProofVerification #DataParallel #Metamath

Lecturas compartidas el 25 de junio de 2024

Las lecturas compartidas en Mastodon el 25 de junio de 2024 son Lecturas compartidas el 24 de junio de 2024. #ITP #Lean4 #IsabelleHOL #Math #Haskell #Python #Calculemus: Demostraciones con Lean4 e Is

Vestigium
Lessons from Metamath. ~ Mario Carneiro. https://youtu.be/aEYhBl-S2EE #ITP #Metamath
Mario Carneiro: Lessons from Metamath

YouTube