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

Theorem releldm2 6185
Description: Two ways of expressing membership in the domain of a relation. (Contributed by NM, 22-Sep-2013.)
Assertion
Ref Expression
releldm2  |-  ( Rel 
A  ->  ( B  e.  dom  A  <->  E. x  e.  A  ( 1st `  x )  =  B ) )
Distinct variable groups:    x, A    x, B

Proof of Theorem releldm2
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 elex 2748 . . 3  |-  ( B  e.  dom  A  ->  B  e.  _V )
21anim2i 342 . 2  |-  ( ( Rel  A  /\  B  e.  dom  A )  -> 
( Rel  A  /\  B  e.  _V )
)
3 id 19 . . . . 5  |-  ( ( 1st `  x )  =  B  ->  ( 1st `  x )  =  B )
4 vex 2740 . . . . . 6  |-  x  e. 
_V
5 1stexg 6167 . . . . . 6  |-  ( x  e.  _V  ->  ( 1st `  x )  e. 
_V )
64, 5ax-mp 5 . . . . 5  |-  ( 1st `  x )  e.  _V
73, 6eqeltrrdi 2269 . . . 4  |-  ( ( 1st `  x )  =  B  ->  B  e.  _V )
87rexlimivw 2590 . . 3  |-  ( E. x  e.  A  ( 1st `  x )  =  B  ->  B  e.  _V )
98anim2i 342 . 2  |-  ( ( Rel  A  /\  E. x  e.  A  ( 1st `  x )  =  B )  ->  ( Rel  A  /\  B  e. 
_V ) )
10 eldm2g 4823 . . . 4  |-  ( B  e.  _V  ->  ( B  e.  dom  A  <->  E. y <. B ,  y >.  e.  A ) )
1110adantl 277 . . 3  |-  ( ( Rel  A  /\  B  e.  _V )  ->  ( B  e.  dom  A  <->  E. y <. B ,  y >.  e.  A ) )
12 df-rel 4633 . . . . . . . . 9  |-  ( Rel 
A  <->  A  C_  ( _V 
X.  _V ) )
13 ssel 3149 . . . . . . . . 9  |-  ( A 
C_  ( _V  X.  _V )  ->  ( x  e.  A  ->  x  e.  ( _V  X.  _V ) ) )
1412, 13sylbi 121 . . . . . . . 8  |-  ( Rel 
A  ->  ( x  e.  A  ->  x  e.  ( _V  X.  _V ) ) )
1514imp 124 . . . . . . 7  |-  ( ( Rel  A  /\  x  e.  A )  ->  x  e.  ( _V  X.  _V ) )
16 op1steq 6179 . . . . . . 7  |-  ( x  e.  ( _V  X.  _V )  ->  ( ( 1st `  x )  =  B  <->  E. y  x  =  <. B , 
y >. ) )
1715, 16syl 14 . . . . . 6  |-  ( ( Rel  A  /\  x  e.  A )  ->  (
( 1st `  x
)  =  B  <->  E. y  x  =  <. B , 
y >. ) )
1817rexbidva 2474 . . . . 5  |-  ( Rel 
A  ->  ( E. x  e.  A  ( 1st `  x )  =  B  <->  E. x  e.  A  E. y  x  =  <. B ,  y >.
) )
1918adantr 276 . . . 4  |-  ( ( Rel  A  /\  B  e.  _V )  ->  ( E. x  e.  A  ( 1st `  x )  =  B  <->  E. x  e.  A  E. y  x  =  <. B , 
y >. ) )
20 rexcom4 2760 . . . . 5  |-  ( E. x  e.  A  E. y  x  =  <. B ,  y >.  <->  E. y E. x  e.  A  x  =  <. B , 
y >. )
21 risset 2505 . . . . . 6  |-  ( <. B ,  y >.  e.  A  <->  E. x  e.  A  x  =  <. B , 
y >. )
2221exbii 1605 . . . . 5  |-  ( E. y <. B ,  y
>.  e.  A  <->  E. y E. x  e.  A  x  =  <. B , 
y >. )
2320, 22bitr4i 187 . . . 4  |-  ( E. x  e.  A  E. y  x  =  <. B ,  y >.  <->  E. y <. B ,  y >.  e.  A )
2419, 23bitrdi 196 . . 3  |-  ( ( Rel  A  /\  B  e.  _V )  ->  ( E. x  e.  A  ( 1st `  x )  =  B  <->  E. y <. B ,  y >.  e.  A ) )
2511, 24bitr4d 191 . 2  |-  ( ( Rel  A  /\  B  e.  _V )  ->  ( B  e.  dom  A  <->  E. x  e.  A  ( 1st `  x )  =  B ) )
262, 9, 25pm5.21nd 916 1  |-  ( Rel 
A  ->  ( B  e.  dom  A  <->  E. x  e.  A  ( 1st `  x )  =  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1353   E.wex 1492    e. wcel 2148   E.wrex 2456   _Vcvv 2737    C_ wss 3129   <.cop 3595    X. cxp 4624   dom cdm 4626   Rel wrel 4631   ` cfv 5216   1stc1st 6138
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4121  ax-pow 4174  ax-pr 4209  ax-un 4433
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2739  df-sbc 2963  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-br 4004  df-opab 4065  df-mpt 4066  df-id 4293  df-xp 4632  df-rel 4633  df-cnv 4634  df-co 4635  df-dm 4636  df-rn 4637  df-iota 5178  df-fun 5218  df-fn 5219  df-f 5220  df-fo 5222  df-fv 5224  df-1st 6140  df-2nd 6141
This theorem is referenced by:  reldm  6186
  Copyright terms: Public domain W3C validator