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

Theorem releldm2 6051
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 2671 . . 3  |-  ( B  e.  dom  A  ->  B  e.  _V )
21anim2i 339 . 2  |-  ( ( Rel  A  /\  B  e.  dom  A )  -> 
( Rel  A  /\  B  e.  _V )
)
3 id 19 . . . . 5  |-  ( ( 1st `  x )  =  B  ->  ( 1st `  x )  =  B )
4 vex 2663 . . . . . 6  |-  x  e. 
_V
5 1stexg 6033 . . . . . 6  |-  ( x  e.  _V  ->  ( 1st `  x )  e. 
_V )
64, 5ax-mp 5 . . . . 5  |-  ( 1st `  x )  e.  _V
73, 6syl6eqelr 2209 . . . 4  |-  ( ( 1st `  x )  =  B  ->  B  e.  _V )
87rexlimivw 2522 . . 3  |-  ( E. x  e.  A  ( 1st `  x )  =  B  ->  B  e.  _V )
98anim2i 339 . 2  |-  ( ( Rel  A  /\  E. x  e.  A  ( 1st `  x )  =  B )  ->  ( Rel  A  /\  B  e. 
_V ) )
10 eldm2g 4705 . . . 4  |-  ( B  e.  _V  ->  ( B  e.  dom  A  <->  E. y <. B ,  y >.  e.  A ) )
1110adantl 275 . . 3  |-  ( ( Rel  A  /\  B  e.  _V )  ->  ( B  e.  dom  A  <->  E. y <. B ,  y >.  e.  A ) )
12 df-rel 4516 . . . . . . . . 9  |-  ( Rel 
A  <->  A  C_  ( _V 
X.  _V ) )
13 ssel 3061 . . . . . . . . 9  |-  ( A 
C_  ( _V  X.  _V )  ->  ( x  e.  A  ->  x  e.  ( _V  X.  _V ) ) )
1412, 13sylbi 120 . . . . . . . 8  |-  ( Rel 
A  ->  ( x  e.  A  ->  x  e.  ( _V  X.  _V ) ) )
1514imp 123 . . . . . . 7  |-  ( ( Rel  A  /\  x  e.  A )  ->  x  e.  ( _V  X.  _V ) )
16 op1steq 6045 . . . . . . 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 2411 . . . . 5  |-  ( Rel 
A  ->  ( E. x  e.  A  ( 1st `  x )  =  B  <->  E. x  e.  A  E. y  x  =  <. B ,  y >.
) )
1918adantr 274 . . . 4  |-  ( ( Rel  A  /\  B  e.  _V )  ->  ( E. x  e.  A  ( 1st `  x )  =  B  <->  E. x  e.  A  E. y  x  =  <. B , 
y >. ) )
20 rexcom4 2683 . . . . 5  |-  ( E. x  e.  A  E. y  x  =  <. B ,  y >.  <->  E. y E. x  e.  A  x  =  <. B , 
y >. )
21 risset 2440 . . . . . 6  |-  ( <. B ,  y >.  e.  A  <->  E. x  e.  A  x  =  <. B , 
y >. )
2221exbii 1569 . . . . 5  |-  ( E. y <. B ,  y
>.  e.  A  <->  E. y E. x  e.  A  x  =  <. B , 
y >. )
2320, 22bitr4i 186 . . . 4  |-  ( E. x  e.  A  E. y  x  =  <. B ,  y >.  <->  E. y <. B ,  y >.  e.  A )
2419, 23syl6bb 195 . . 3  |-  ( ( Rel  A  /\  B  e.  _V )  ->  ( E. x  e.  A  ( 1st `  x )  =  B  <->  E. y <. B ,  y >.  e.  A ) )
2511, 24bitr4d 190 . 2  |-  ( ( Rel  A  /\  B  e.  _V )  ->  ( B  e.  dom  A  <->  E. x  e.  A  ( 1st `  x )  =  B ) )
262, 9, 25pm5.21nd 886 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 103    <-> wb 104    = wceq 1316   E.wex 1453    e. wcel 1465   E.wrex 2394   _Vcvv 2660    C_ wss 3041   <.cop 3500    X. cxp 4507   dom cdm 4509   Rel wrel 4514   ` cfv 5093   1stc1st 6004
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 683  ax-5 1408  ax-7 1409  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-8 1467  ax-10 1468  ax-11 1469  ax-i12 1470  ax-bndl 1471  ax-4 1472  ax-13 1476  ax-14 1477  ax-17 1491  ax-i9 1495  ax-ial 1499  ax-i5r 1500  ax-ext 2099  ax-sep 4016  ax-pow 4068  ax-pr 4101  ax-un 4325
This theorem depends on definitions:  df-bi 116  df-3an 949  df-tru 1319  df-nf 1422  df-sb 1721  df-eu 1980  df-mo 1981  df-clab 2104  df-cleq 2110  df-clel 2113  df-nfc 2247  df-ral 2398  df-rex 2399  df-v 2662  df-sbc 2883  df-un 3045  df-in 3047  df-ss 3054  df-pw 3482  df-sn 3503  df-pr 3504  df-op 3506  df-uni 3707  df-br 3900  df-opab 3960  df-mpt 3961  df-id 4185  df-xp 4515  df-rel 4516  df-cnv 4517  df-co 4518  df-dm 4519  df-rn 4520  df-iota 5058  df-fun 5095  df-fn 5096  df-f 5097  df-fo 5099  df-fv 5101  df-1st 6006  df-2nd 6007
This theorem is referenced by:  reldm  6052
  Copyright terms: Public domain W3C validator