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

Theorem reldm 6077
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 6076 . . 3  |-  ( Rel 
A  ->  ( y  e.  dom  A  <->  E. z  e.  A  ( 1st `  z )  =  y ) )
2 vex 2684 . . . . . . 7  |-  x  e. 
_V
3 1stexg 6058 . . . . . . 7  |-  ( x  e.  _V  ->  ( 1st `  x )  e. 
_V )
42, 3ax-mp 5 . . . . . 6  |-  ( 1st `  x )  e.  _V
5 eqid 2137 . . . . . 6  |-  ( x  e.  A  |->  ( 1st `  x ) )  =  ( x  e.  A  |->  ( 1st `  x
) )
64, 5fnmpti 5246 . . . . 5  |-  ( x  e.  A  |->  ( 1st `  x ) )  Fn  A
7 fvelrnb 5462 . . . . 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 5414 . . . . . . . 8  |-  ( x  =  z  ->  ( 1st `  x )  =  ( 1st `  z
) )
10 vex 2684 . . . . . . . . 9  |-  z  e. 
_V
11 1stexg 6058 . . . . . . . . 9  |-  ( z  e.  _V  ->  ( 1st `  z )  e. 
_V )
1210, 11ax-mp 5 . . . . . . . 8  |-  ( 1st `  z )  e.  _V
139, 5, 12fvmpt 5491 . . . . . . 7  |-  ( z  e.  A  ->  (
( x  e.  A  |->  ( 1st `  x
) ) `  z
)  =  ( 1st `  z ) )
1413eqeq1d 2146 . . . . . 6  |-  ( z  e.  A  ->  (
( ( x  e.  A  |->  ( 1st `  x
) ) `  z
)  =  y  <->  ( 1st `  z )  =  y ) )
1514rexbiia 2448 . . . . 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, 16syl5rbb 192 . . 3  |-  ( Rel 
A  ->  ( E. z  e.  A  ( 1st `  z )  =  y  <->  y  e.  ran  ( x  e.  A  |->  ( 1st `  x
) ) ) )
181, 17bitrd 187 . 2  |-  ( Rel 
A  ->  ( y  e.  dom  A  <->  y  e.  ran  ( x  e.  A  |->  ( 1st `  x
) ) ) )
1918eqrdv 2135 1  |-  ( Rel 
A  ->  dom  A  =  ran  ( x  e.  A  |->  ( 1st `  x
) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104    = wceq 1331    e. wcel 1480   E.wrex 2415   _Vcvv 2681    |-> cmpt 3984   dom cdm 4534   ran crn 4535   Rel wrel 4539    Fn wfn 5113   ` cfv 5118   1stc1st 6029
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126  ax-un 4350
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-sbc 2905  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-br 3925  df-opab 3985  df-mpt 3986  df-id 4210  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-iota 5083  df-fun 5120  df-fn 5121  df-f 5122  df-fo 5124  df-fv 5126  df-1st 6031  df-2nd 6032
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator