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

Definition df-r1 5750
Description: Define the cumulative hierarchy of sets function, using Takeuti and Zaring's notation (R1). Starting with the empty set, this function builds up layers of sets where the next layer is the power set of the previous layer (and the union of previous layers when the argument is a limit ordinal). Using the Axiom of Regularity, we can show that any set whatsoever belongs to one of the layers of this hierarchy (see tz9.13 5774). Our definition expresses Definition 9.9 of [TakeutiZaring] p. 76 in a closed form, from which we derive the recursive definition as theorems r10 5762, r1suc 5763, and r1lim 5764. Theorem r1val1 5769 shows a recursive definition that works for all values, and theorems r1val2 5789 and r1val3 5790 show the value expressed in terms of rank. Other notations for this function are R with the argument as a subscript (Equation 3.1 of [BellMachover] p. 477), _V with a a subscript (Definition of [Enderton] p. 202), M with a subscript (Definition 15.19 of [Monk1] p. 113), the capital Greek letter psi (Definition of [Mendelson] p. 281), and bold-face R (Definition 2.1 of [Kunen] p. 95).
Assertion
Ref Expression
df-r1 |- R1 = rec({<.x, y>. | y = ~Px}, (/))
Distinct variable group:   x,y

Detailed syntax breakdown of Definition df-r1
StepHypRef Expression
1 cr1 5748 . 2 class R1
2 vy . . . . . 6 set y
32cv 1297 . . . . 5 class y
4 vx . . . . . . 7 set x
54cv 1297 . . . . . 6 class x
65cpw 3032 . . . . 5 class ~Px
73, 6wceq 1298 . . . 4 wff y = ~Px
87, 4, 2copab 3395 . . 3 class {<.x, y>. | y = ~Px}
9 c0 2875 . . 3 class (/)
108, 9crdg 5139 . 2 class rec({<.x, y>. | y = ~Px}, (/))
111, 10wceq 1298 1 wff R1 = rec({<.x, y>. | y = ~Px}, (/))
Colors of variables: wff set class
This definition is referenced by:  r1fnon 5761  r10 5762  r1suc 5763  r1lim 5764
Copyright terms: Public domain