MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  f2ndres Structured version   Unicode version

Theorem f2ndres 6722
Description: Mapping of a restriction of the  2nd (second member of an ordered pair) function. (Contributed by NM, 7-Aug-2006.) (Revised by Mario Carneiro, 8-Sep-2013.)
Assertion
Ref Expression
f2ndres  |-  ( 2nd  |`  ( A  X.  B
) ) : ( A  X.  B ) --> B

Proof of Theorem f2ndres
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 3037 . . . . . . . 8  |-  y  e. 
_V
2 vex 3037 . . . . . . . 8  |-  z  e. 
_V
31, 2op2nda 5401 . . . . . . 7  |-  U. ran  {
<. y ,  z >. }  =  z
43eleq1i 2459 . . . . . 6  |-  ( U. ran  { <. y ,  z
>. }  e.  B  <->  z  e.  B )
54biimpri 206 . . . . 5  |-  ( z  e.  B  ->  U. ran  {
<. y ,  z >. }  e.  B )
65adantl 464 . . . 4  |-  ( ( y  e.  A  /\  z  e.  B )  ->  U. ran  { <. y ,  z >. }  e.  B )
76rgen2 2807 . . 3  |-  A. y  e.  A  A. z  e.  B  U. ran  { <. y ,  z >. }  e.  B
8 sneq 3954 . . . . . . 7  |-  ( x  =  <. y ,  z
>.  ->  { x }  =  { <. y ,  z
>. } )
98rneqd 5143 . . . . . 6  |-  ( x  =  <. y ,  z
>.  ->  ran  { x }  =  ran  { <. y ,  z >. } )
109unieqd 4173 . . . . 5  |-  ( x  =  <. y ,  z
>.  ->  U. ran  { x }  =  U. ran  { <. y ,  z >. } )
1110eleq1d 2451 . . . 4  |-  ( x  =  <. y ,  z
>.  ->  ( U. ran  { x }  e.  B  <->  U.
ran  { <. y ,  z
>. }  e.  B ) )
1211ralxp 5057 . . 3  |-  ( A. x  e.  ( A  X.  B ) U. ran  { x }  e.  B  <->  A. y  e.  A  A. z  e.  B  U. ran  { <. y ,  z
>. }  e.  B )
137, 12mpbir 209 . 2  |-  A. x  e.  ( A  X.  B
) U. ran  {
x }  e.  B
14 df-2nd 6700 . . . . 5  |-  2nd  =  ( x  e.  _V  |->  U.
ran  { x } )
1514reseq1i 5182 . . . 4  |-  ( 2nd  |`  ( A  X.  B
) )  =  ( ( x  e.  _V  |->  U.
ran  { x } )  |`  ( A  X.  B
) )
16 ssv 3437 . . . . 5  |-  ( A  X.  B )  C_  _V
17 resmpt 5235 . . . . 5  |-  ( ( A  X.  B ) 
C_  _V  ->  ( ( x  e.  _V  |->  U.
ran  { x } )  |`  ( A  X.  B
) )  =  ( x  e.  ( A  X.  B )  |->  U.
ran  { x } ) )
1816, 17ax-mp 5 . . . 4  |-  ( ( x  e.  _V  |->  U.
ran  { x } )  |`  ( A  X.  B
) )  =  ( x  e.  ( A  X.  B )  |->  U.
ran  { x } )
1915, 18eqtri 2411 . . 3  |-  ( 2nd  |`  ( A  X.  B
) )  =  ( x  e.  ( A  X.  B )  |->  U.
ran  { x } )
2019fmpt 5954 . 2  |-  ( A. x  e.  ( A  X.  B ) U. ran  { x }  e.  B  <->  ( 2nd  |`  ( A  X.  B ) ) : ( A  X.  B
) --> B )
2113, 20mpbi 208 1  |-  ( 2nd  |`  ( A  X.  B
) ) : ( A  X.  B ) --> B
Colors of variables: wff setvar class
Syntax hints:    = wceq 1399    e. wcel 1826   A.wral 2732   _Vcvv 3034    C_ wss 3389   {csn 3944   <.cop 3950   U.cuni 4163    |-> cmpt 4425    X. cxp 4911   ran crn 4914    |` cres 4915   -->wf 5492   2ndc2nd 6698
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1626  ax-4 1639  ax-5 1712  ax-6 1755  ax-7 1798  ax-9 1830  ax-10 1845  ax-11 1850  ax-12 1862  ax-13 2006  ax-ext 2360  ax-sep 4488  ax-nul 4496  ax-pr 4601
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3an 973  df-tru 1402  df-ex 1621  df-nf 1625  df-sb 1748  df-eu 2222  df-mo 2223  df-clab 2368  df-cleq 2374  df-clel 2377  df-nfc 2532  df-ne 2579  df-ral 2737  df-rex 2738  df-rab 2741  df-v 3036  df-sbc 3253  df-csb 3349  df-dif 3392  df-un 3394  df-in 3396  df-ss 3403  df-nul 3712  df-if 3858  df-sn 3945  df-pr 3947  df-op 3951  df-uni 4164  df-iun 4245  df-br 4368  df-opab 4426  df-mpt 4427  df-id 4709  df-xp 4919  df-rel 4920  df-cnv 4921  df-co 4922  df-dm 4923  df-rn 4924  df-res 4925  df-ima 4926  df-iota 5460  df-fun 5498  df-fn 5499  df-f 5500  df-fv 5504  df-2nd 6700
This theorem is referenced by:  fo2ndres  6724  2ndcof  6728  fparlem2  6800  f2ndf  6805  eucalgcvga  14217  2ndfcl  15584  gaid  16454  tx2cn  20196  txkgen  20238  xpinpreima  28042  xpinpreima2  28043  2ndmbfm  28388  filnetlem4  30365  hausgraph  31340
  Copyright terms: Public domain W3C validator