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

Theorem 2ndconst 6224
Description: The mapping of a restriction of the  2nd function to a converse constant function. (Contributed by NM, 27-Mar-2008.)
Assertion
Ref Expression
2ndconst  |-  ( A  e.  V  ->  ( 2nd  |`  ( { A }  X.  B ) ) : ( { A }  X.  B ) -1-1-onto-> B )

Proof of Theorem 2ndconst
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 snnzg 3756 . . 3  |-  ( A  e.  V  ->  { A }  =/=  (/) )
2 fo2ndres 6160 . . 3  |-  ( { A }  =/=  (/)  ->  ( 2nd  |`  ( { A }  X.  B ) ) : ( { A }  X.  B ) -onto-> B )
31, 2syl 15 . 2  |-  ( A  e.  V  ->  ( 2nd  |`  ( { A }  X.  B ) ) : ( { A }  X.  B ) -onto-> B )
4 moeq 2954 . . . . . 6  |-  E* x  x  =  <. A , 
y >.
54moani 2208 . . . . 5  |-  E* x
( y  e.  B  /\  x  =  <. A ,  y >. )
6 vex 2804 . . . . . . . 8  |-  y  e. 
_V
76brres 4977 . . . . . . 7  |-  ( x ( 2nd  |`  ( { A }  X.  B
) ) y  <->  ( x 2nd y  /\  x  e.  ( { A }  X.  B ) ) )
8 fo2nd 6156 . . . . . . . . . . 11  |-  2nd : _V -onto-> _V
9 fofn 5469 . . . . . . . . . . 11  |-  ( 2nd
: _V -onto-> _V  ->  2nd 
Fn  _V )
108, 9ax-mp 8 . . . . . . . . . 10  |-  2nd  Fn  _V
11 vex 2804 . . . . . . . . . 10  |-  x  e. 
_V
12 fnbrfvb 5579 . . . . . . . . . 10  |-  ( ( 2nd  Fn  _V  /\  x  e.  _V )  ->  ( ( 2nd `  x
)  =  y  <->  x 2nd y ) )
1310, 11, 12mp2an 653 . . . . . . . . 9  |-  ( ( 2nd `  x )  =  y  <->  x 2nd y )
1413anbi1i 676 . . . . . . . 8  |-  ( ( ( 2nd `  x
)  =  y  /\  x  e.  ( { A }  X.  B
) )  <->  ( x 2nd y  /\  x  e.  ( { A }  X.  B ) ) )
15 elxp7 6168 . . . . . . . . . . 11  |-  ( x  e.  ( { A }  X.  B )  <->  ( x  e.  ( _V  X.  _V )  /\  ( ( 1st `  x )  e.  { A }  /\  ( 2nd `  x )  e.  B ) ) )
16 eleq1 2356 . . . . . . . . . . . . . . 15  |-  ( ( 2nd `  x )  =  y  ->  (
( 2nd `  x
)  e.  B  <->  y  e.  B ) )
1716biimpa 470 . . . . . . . . . . . . . 14  |-  ( ( ( 2nd `  x
)  =  y  /\  ( 2nd `  x )  e.  B )  -> 
y  e.  B )
1817adantrl 696 . . . . . . . . . . . . 13  |-  ( ( ( 2nd `  x
)  =  y  /\  ( ( 1st `  x
)  e.  { A }  /\  ( 2nd `  x
)  e.  B ) )  ->  y  e.  B )
1918adantrl 696 . . . . . . . . . . . 12  |-  ( ( ( 2nd `  x
)  =  y  /\  ( x  e.  ( _V  X.  _V )  /\  ( ( 1st `  x
)  e.  { A }  /\  ( 2nd `  x
)  e.  B ) ) )  ->  y  e.  B )
20 elsni 3677 . . . . . . . . . . . . . 14  |-  ( ( 1st `  x )  e.  { A }  ->  ( 1st `  x
)  =  A )
21 eqopi 6172 . . . . . . . . . . . . . . . 16  |-  ( ( x  e.  ( _V 
X.  _V )  /\  (
( 1st `  x
)  =  A  /\  ( 2nd `  x )  =  y ) )  ->  x  =  <. A ,  y >. )
2221ancom2s 777 . . . . . . . . . . . . . . 15  |-  ( ( x  e.  ( _V 
X.  _V )  /\  (
( 2nd `  x
)  =  y  /\  ( 1st `  x )  =  A ) )  ->  x  =  <. A ,  y >. )
2322an12s 776 . . . . . . . . . . . . . 14  |-  ( ( ( 2nd `  x
)  =  y  /\  ( x  e.  ( _V  X.  _V )  /\  ( 1st `  x )  =  A ) )  ->  x  =  <. A ,  y >. )
2420, 23sylanr2 634 . . . . . . . . . . . . 13  |-  ( ( ( 2nd `  x
)  =  y  /\  ( x  e.  ( _V  X.  _V )  /\  ( 1st `  x )  e.  { A }
) )  ->  x  =  <. A ,  y
>. )
2524adantrrr 705 . . . . . . . . . . . 12  |-  ( ( ( 2nd `  x
)  =  y  /\  ( x  e.  ( _V  X.  _V )  /\  ( ( 1st `  x
)  e.  { A }  /\  ( 2nd `  x
)  e.  B ) ) )  ->  x  =  <. A ,  y
>. )
2619, 25jca 518 . . . . . . . . . . 11  |-  ( ( ( 2nd `  x
)  =  y  /\  ( x  e.  ( _V  X.  _V )  /\  ( ( 1st `  x
)  e.  { A }  /\  ( 2nd `  x
)  e.  B ) ) )  ->  (
y  e.  B  /\  x  =  <. A , 
y >. ) )
2715, 26sylan2b 461 . . . . . . . . . 10  |-  ( ( ( 2nd `  x
)  =  y  /\  x  e.  ( { A }  X.  B
) )  ->  (
y  e.  B  /\  x  =  <. A , 
y >. ) )
2827adantl 452 . . . . . . . . 9  |-  ( ( A  e.  V  /\  ( ( 2nd `  x
)  =  y  /\  x  e.  ( { A }  X.  B
) ) )  -> 
( y  e.  B  /\  x  =  <. A ,  y >. )
)
29 fveq2 5541 . . . . . . . . . . . 12  |-  ( x  =  <. A ,  y
>.  ->  ( 2nd `  x
)  =  ( 2nd `  <. A ,  y
>. ) )
30 op2ndg 6149 . . . . . . . . . . . . 13  |-  ( ( A  e.  V  /\  y  e.  _V )  ->  ( 2nd `  <. A ,  y >. )  =  y )
316, 30mpan2 652 . . . . . . . . . . . 12  |-  ( A  e.  V  ->  ( 2nd `  <. A ,  y
>. )  =  y
)
3229, 31sylan9eqr 2350 . . . . . . . . . . 11  |-  ( ( A  e.  V  /\  x  =  <. A , 
y >. )  ->  ( 2nd `  x )  =  y )
3332adantrl 696 . . . . . . . . . 10  |-  ( ( A  e.  V  /\  ( y  e.  B  /\  x  =  <. A ,  y >. )
)  ->  ( 2nd `  x )  =  y )
34 simprr 733 . . . . . . . . . . 11  |-  ( ( A  e.  V  /\  ( y  e.  B  /\  x  =  <. A ,  y >. )
)  ->  x  =  <. A ,  y >.
)
35 snidg 3678 . . . . . . . . . . . . 13  |-  ( A  e.  V  ->  A  e.  { A } )
3635adantr 451 . . . . . . . . . . . 12  |-  ( ( A  e.  V  /\  ( y  e.  B  /\  x  =  <. A ,  y >. )
)  ->  A  e.  { A } )
37 simprl 732 . . . . . . . . . . . 12  |-  ( ( A  e.  V  /\  ( y  e.  B  /\  x  =  <. A ,  y >. )
)  ->  y  e.  B )
38 opelxpi 4737 . . . . . . . . . . . 12  |-  ( ( A  e.  { A }  /\  y  e.  B
)  ->  <. A , 
y >.  e.  ( { A }  X.  B
) )
3936, 37, 38syl2anc 642 . . . . . . . . . . 11  |-  ( ( A  e.  V  /\  ( y  e.  B  /\  x  =  <. A ,  y >. )
)  ->  <. A , 
y >.  e.  ( { A }  X.  B
) )
4034, 39eqeltrd 2370 . . . . . . . . . 10  |-  ( ( A  e.  V  /\  ( y  e.  B  /\  x  =  <. A ,  y >. )
)  ->  x  e.  ( { A }  X.  B ) )
4133, 40jca 518 . . . . . . . . 9  |-  ( ( A  e.  V  /\  ( y  e.  B  /\  x  =  <. A ,  y >. )
)  ->  ( ( 2nd `  x )  =  y  /\  x  e.  ( { A }  X.  B ) ) )
4228, 41impbida 805 . . . . . . . 8  |-  ( A  e.  V  ->  (
( ( 2nd `  x
)  =  y  /\  x  e.  ( { A }  X.  B
) )  <->  ( y  e.  B  /\  x  =  <. A ,  y
>. ) ) )
4314, 42syl5bbr 250 . . . . . . 7  |-  ( A  e.  V  ->  (
( x 2nd y  /\  x  e.  ( { A }  X.  B
) )  <->  ( y  e.  B  /\  x  =  <. A ,  y
>. ) ) )
447, 43syl5bb 248 . . . . . 6  |-  ( A  e.  V  ->  (
x ( 2nd  |`  ( { A }  X.  B
) ) y  <->  ( y  e.  B  /\  x  =  <. A ,  y
>. ) ) )
4544mobidv 2191 . . . . 5  |-  ( A  e.  V  ->  ( E* x  x ( 2nd  |`  ( { A }  X.  B ) ) y  <->  E* x ( y  e.  B  /\  x  =  <. A ,  y
>. ) ) )
465, 45mpbiri 224 . . . 4  |-  ( A  e.  V  ->  E* x  x ( 2nd  |`  ( { A }  X.  B
) ) y )
4746alrimiv 1621 . . 3  |-  ( A  e.  V  ->  A. y E* x  x ( 2nd  |`  ( { A }  X.  B ) ) y )
48 funcnv2 5325 . . 3  |-  ( Fun  `' ( 2nd  |`  ( { A }  X.  B
) )  <->  A. y E* x  x ( 2nd  |`  ( { A }  X.  B ) ) y )
4947, 48sylibr 203 . 2  |-  ( A  e.  V  ->  Fun  `' ( 2nd  |`  ( { A }  X.  B
) ) )
50 dff1o3 5494 . 2  |-  ( ( 2nd  |`  ( { A }  X.  B
) ) : ( { A }  X.  B ) -1-1-onto-> B  <->  ( ( 2nd  |`  ( { A }  X.  B ) ) : ( { A }  X.  B ) -onto-> B  /\  Fun  `' ( 2nd  |`  ( { A }  X.  B
) ) ) )
513, 49, 50sylanbrc 645 1  |-  ( A  e.  V  ->  ( 2nd  |`  ( { A }  X.  B ) ) : ( { A }  X.  B ) -1-1-onto-> B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358   A.wal 1530    = wceq 1632    e. wcel 1696   E*wmo 2157    =/= wne 2459   _Vcvv 2801   (/)c0 3468   {csn 3653   <.cop 3656   class class class wbr 4039    X. cxp 4703   `'ccnv 4704    |` cres 4707   Fun wfun 5265    Fn wfn 5266   -onto->wfo 5269   -1-1-onto->wf1o 5270   ` cfv 5271   1stc1st 6136   2ndc2nd 6137
This theorem is referenced by:  curry1  6226  xpfi  7144  fsum2dlem  12249  gsum2d  15239  ovoliunlem1  18877  domrancur1b  25303  domrancur1c  25305
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-rab 2565  df-v 2803  df-sbc 3005  df-csb 3095  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-iun 3923  df-br 4040  df-opab 4094  df-mpt 4095  df-id 4325  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-1st 6138  df-2nd 6139
  Copyright terms: Public domain W3C validator