HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Definition df-om 3218
Description: Define the class of natural numbers, which are all ordinal numbers that are less than every limit ordinal, i.e. all finite ordinals. Our definition is a variant of the Definition of N of [BellMachover] p. 471. See dfom2 3219 for an alternate definition. Later, when we assume the Axiom of Infinity, we show om is a set in omex 4770, and om can then be defined per dfom3 4774 (the smallest inductive set) and dfom4 4776.

Note: the natural numbers om are a subset of the ordinal numbers df-on 2978. They are completely different from the natural numbers NN (df-n 6068) that are a subset of the complex numbers defined much later in our development, although the two sets have analogous properties and operations defined on them.

Assertion
Ref Expression
df-om |- om = {x | (Ord x /\ A.y(Lim y -> x e. y))}
Distinct variable group:   x,y

Detailed syntax breakdown of Definition df-om
StepHypRef Expression
1 com 3217 . 2 class om
2 vx . . . . . 6 set x
32cv 990 . . . . 5 class x
43word 2973 . . . 4 wff Ord x
5 vy . . . . . . . 8 set y
65cv 990 . . . . . . 7 class y
76wlim 2975 . . . . . 6 wff Lim y
83, 6wcel 993 . . . . . 6 wff x e. y
97, 8wi 3 . . . . 5 wff (Lim y -> x e. y)
109, 5wal 989 . . . 4 wff A.y(Lim y -> x e. y)
114, 10wa 221 . . 3 wff (Ord x /\ A.y(Lim y -> x e. y))
1211, 2cab 1504 . 2 class {x | (Ord x /\ A.y(Lim y -> x e. y))}
131, 12wceq 991 1 wff om = {x | (Ord x /\ A.y(Lim y -> x e. y))}
Colors of variables: wff set class
This definition is referenced by:  dfom2 3219  elom 3220
Copyright terms: Public domain