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

Definition df-om 3950
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 3951 for an alternate definition. Later, when we assume the Axiom of Infinity, we show om is a set in omex 5733, and om can then be defined per dfom3 5737 (the smallest inductive set) and dfom4 5739.

Note: the natural numbers om are a subset of the ordinal numbers df-on 3661. They are completely different from the natural numbers NN (df-n 7108) 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 3949 . 2 class om
2 vx . . . . . 6 set x
32cv 1297 . . . . 5 class x
43word 3656 . . . 4 wff Ord x
5 vy . . . . . . . 8 set y
65cv 1297 . . . . . . 7 class y
76wlim 3658 . . . . . 6 wff Lim y
83, 6wcel 1300 . . . . . 6 wff x e. y
97, 8wi 3 . . . . 5 wff (Lim y -> x e. y)
109, 5wal 1296 . . . 4 wff A.y(Lim y -> x e. y)
114, 10wa 240 . . 3 wff (Ord x /\ A.y(Lim y -> x e. y))
1211, 2cab 1871 . 2 class {x | (Ord x /\ A.y(Lim y -> x e. y))}
131, 12wceq 1298 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 3951  elom 3952  dfom5 14081
Copyright terms: Public domain