Theorem reldm 6420

Description: An expression for the domain of a relation. (Contributed by NM, 22-Sep-2013.)

Assertion

Ref	Expression
reldm	|- ( Rel A -> dom A = ran ( x e. A |-> ( 1st ` x ) ) )

Distinct variable group:   x, A

Proof of Theorem reldm

Dummy variables y z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		releldm2 6419	. . 3 |- ( Rel A -> ( y e. dom A <-> E. z e. A ( 1st ` z ) = y ) )
2		vex 2824	. . . . . . 7 |- x e. _V
3		1stexg 6401	. . . . . . 7 |- ( x e. _V -> ( 1st ` x ) e. _V )
4	2, 3	ax-mp 5	. . . . . 6 |- ( 1st ` x ) e. _V
5		eqid 2238	. . . . . 6 |- ( x e. A |-> ( 1st ` x ) ) = ( x e. A |-> ( 1st ` x ) )
6	4, 5	fnmpti 5512	. . . . 5 |- ( x e. A |-> ( 1st ` x ) ) Fn A
7		fvelrnb 5750	. . . . 5 |- ( ( x e. A |-> ( 1st ` x ) ) Fn A -> ( y e. ran ( x e. A |-> ( 1st ` x ) ) <-> E. z e. A ( ( x e. A |-> ( 1st ` x ) ) ` z ) = y ) )
8	6, 7	ax-mp 5	. . . 4 |- ( y e. ran ( x e. A |-> ( 1st ` x ) ) <-> E. z e. A ( ( x e. A |-> ( 1st ` x ) ) ` z ) = y )
9		fveq2 5695	. . . . . . . 8 |- ( x = z -> ( 1st ` x ) = ( 1st ` z ) )
10		vex 2824	. . . . . . . . 9 |- z e. _V
11		1stexg 6401	. . . . . . . . 9 |- ( z e. _V -> ( 1st ` z ) e. _V )
12	10, 11	ax-mp 5	. . . . . . . 8 |- ( 1st ` z ) e. _V
13	9, 5, 12	fvmpt 5782	. . . . . . 7 |- ( z e. A -> ( ( x e. A |-> ( 1st ` x ) ) ` z ) = ( 1st ` z ) )
14	13	eqeq1d 2247	. . . . . 6 |- ( z e. A -> ( ( ( x e. A |-> ( 1st ` x ) ) ` z ) = y <-> ( 1st ` z ) = y ) )
15	14	rexbiia 2565	. . . . 5 |- ( E. z e. A ( ( x e. A |-> ( 1st ` x ) ) ` z ) = y <-> E. z e. A ( 1st ` z ) = y )
16	15	a1i 9	. . . 4 |- ( Rel A -> ( E. z e. A ( ( x e. A |-> ( 1st ` x ) ) ` z ) = y <-> E. z e. A ( 1st ` z ) = y ) )
17	8, 16	bitr2id 193	. . 3 |- ( Rel A -> ( E. z e. A ( 1st ` z ) = y <-> y e. ran ( x e. A |-> ( 1st ` x ) ) ) )
18	1, 17	bitrd 188	. 2 |- ( Rel A -> ( y e. dom A <-> y e. ran ( x e. A |-> ( 1st ` x ) ) ) )
19	18	eqrdv 2236	1 |- ( Rel A -> dom A = ran ( x e. A |-> ( 1st ` x ) ) )

This proof depends on syntax axioms:   -> wi 4   <-> wb 105   = wceq 1402   e. wcel 2209   E.wrex 2529   _Vcvv 2821   |-> cmpt 4192   dom cdm 4774   ran crn 4775   Rel wrel 4779   Fn wfn 5372   ` cfv 5377   1stc1st 6372

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fo 5383  df-fv 5385  df-1st 6374  df-2nd 6375

This theorem is used by: (None)