ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  reldm Unicode version

Theorem reldm 6393
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.
StepHypRef Expression
1 releldm2 6392 . . 3  |-  ( Rel 
A  ->  ( y  e.  dom  A  <->  E. z  e.  A  ( 1st `  z )  =  y ) )
2 vex 2818 . . . . . . 7  |-  x  e. 
_V
3 1stexg 6374 . . . . . . 7  |-  ( x  e.  _V  ->  ( 1st `  x )  e. 
_V )
42, 3ax-mp 5 . . . . . 6  |-  ( 1st `  x )  e.  _V
5 eqid 2234 . . . . . 6  |-  ( x  e.  A  |->  ( 1st `  x ) )  =  ( x  e.  A  |->  ( 1st `  x
) )
64, 5fnmpti 5492 . . . . 5  |-  ( x  e.  A  |->  ( 1st `  x ) )  Fn  A
7 fvelrnb 5729 . . . . 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 ) )
86, 7ax-mp 5 . . . 4  |-  ( y  e.  ran  ( x  e.  A  |->  ( 1st `  x ) )  <->  E. z  e.  A  ( (
x  e.  A  |->  ( 1st `  x ) ) `  z )  =  y )
9 fveq2 5675 . . . . . . . 8  |-  ( x  =  z  ->  ( 1st `  x )  =  ( 1st `  z
) )
10 vex 2818 . . . . . . . . 9  |-  z  e. 
_V
11 1stexg 6374 . . . . . . . . 9  |-  ( z  e.  _V  ->  ( 1st `  z )  e. 
_V )
1210, 11ax-mp 5 . . . . . . . 8  |-  ( 1st `  z )  e.  _V
139, 5, 12fvmpt 5759 . . . . . . 7  |-  ( z  e.  A  ->  (
( x  e.  A  |->  ( 1st `  x
) ) `  z
)  =  ( 1st `  z ) )
1413eqeq1d 2243 . . . . . 6  |-  ( z  e.  A  ->  (
( ( x  e.  A  |->  ( 1st `  x
) ) `  z
)  =  y  <->  ( 1st `  z )  =  y ) )
1514rexbiia 2559 . . . . 5  |-  ( E. z  e.  A  ( ( x  e.  A  |->  ( 1st `  x
) ) `  z
)  =  y  <->  E. z  e.  A  ( 1st `  z )  =  y )
1615a1i 9 . . . 4  |-  ( Rel 
A  ->  ( E. z  e.  A  (
( x  e.  A  |->  ( 1st `  x
) ) `  z
)  =  y  <->  E. z  e.  A  ( 1st `  z )  =  y ) )
178, 16bitr2id 193 . . 3  |-  ( Rel 
A  ->  ( E. z  e.  A  ( 1st `  z )  =  y  <->  y  e.  ran  ( x  e.  A  |->  ( 1st `  x
) ) ) )
181, 17bitrd 188 . 2  |-  ( Rel 
A  ->  ( y  e.  dom  A  <->  y  e.  ran  ( x  e.  A  |->  ( 1st `  x
) ) ) )
1918eqrdv 2232 1  |-  ( Rel 
A  ->  dom  A  =  ran  ( x  e.  A  |->  ( 1st `  x
) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1398    e. wcel 2205   E.wrex 2523   _Vcvv 2815    |-> cmpt 4176   dom cdm 4754   ran crn 4755   Rel wrel 4759    Fn wfn 5352   ` cfv 5357   1stc1st 6345
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-sbc 3046  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-fo 5363  df-fv 5365  df-1st 6347  df-2nd 6348
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator