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

Definition df-1st 5020
Description: Define a function that extracts the first member, or abscissa, of an ordered pair. Theorem op1st 5026 proves that it does this. Equivalent to Definition 5.13 (i) of [Monk1] p. 52 (compare op1sta 4372 and op1stb 3857). The notation is the same as Monk's.
Assertion
Ref Expression
df-1st |- 1st = {<.x, y>. | y = U.dom { x}}
Distinct variable group:   x,y

Detailed syntax breakdown of Definition df-1st
StepHypRef Expression
1 c1st 5018 . 2 class 1st
2 vy . . . . 5 set y
32cv 1297 . . . 4 class y
4 vx . . . . . . . 8 set x
54cv 1297 . . . . . . 7 class x
65csn 3044 . . . . . 6 class {x}
76cdm 3986 . . . . 5 class dom { x}
87cuni 3177 . . . 4 class U.dom { x}
93, 8wceq 1298 . . 3 wff y = U.dom { x}
109, 4, 2copab 3395 . 2 class {<.x, y>. | y = U.dom { x}}
111, 10wceq 1298 1 wff 1st = {<.x, y>. | y = U.dom { x}}
Colors of variables: wff set class
This definition is referenced by:  1stval 5022  fo1st 5032  f1stres 5034
Copyright terms: Public domain