Definition df-1st 6699

Description: Define a function that extracts the first member, or abscissa, of an ordered pair. Theorem op1st 6707 proves that it does this. For example, ( 1st ` <. 3 , 4 >. ) = 3. Equivalent to Definition 5.13 (i) of [Monk1] p. 52 (compare op1sta 5398 and op1stb 4632). The notation is the same as Monk's. (Contributed by NM, 9-Oct-2004.)

Assertion

Ref	Expression
df-1st	|- 1st = ( x e. _V |-> U. dom { x } )

Detailed syntax breakdown of Definition df-1st

Step	Hyp	Ref	Expression
1		c1st 6697	. 2 class 1st
2		vx	. . 3 setvar x
3		cvv 3034	. . 3 class _V
4	2	cv 1398	. . . . . 6 class x
5	4	csn 3944	. . . . 5 class { x }
6	5	cdm 4913	. . . 4 class dom { x }
7	6	cuni 4163	. . 3 class U. dom { x }
8	2, 3, 7	cmpt 4425	. 2 class ( x e. _V |-> U. dom { x } )
9	1, 8	wceq 1399	1 wff 1st = ( x e. _V |-> U. dom { x } )

This definition is referenced by:  1stval  6701  fo1st  6719  f1stres  6721