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

Theorem 2ndconst 6087
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 snmg 3611 . . 3  |-  ( A  e.  V  ->  E. x  x  e.  { A } )
2 fo2ndresm 6028 . . 3  |-  ( E. x  x  e.  { A }  ->  ( 2nd  |`  ( { A }  X.  B ) ) : ( { A }  X.  B ) -onto-> B )
31, 2syl 14 . 2  |-  ( A  e.  V  ->  ( 2nd  |`  ( { A }  X.  B ) ) : ( { A }  X.  B ) -onto-> B )
4 moeq 2832 . . . . . 6  |-  E* x  x  =  <. A , 
y >.
54moani 2047 . . . . 5  |-  E* x
( y  e.  B  /\  x  =  <. A ,  y >. )
6 vex 2663 . . . . . . . 8  |-  y  e. 
_V
76brres 4795 . . . . . . 7  |-  ( x ( 2nd  |`  ( { A }  X.  B
) ) y  <->  ( x 2nd y  /\  x  e.  ( { A }  X.  B ) ) )
8 fo2nd 6024 . . . . . . . . . . 11  |-  2nd : _V -onto-> _V
9 fofn 5317 . . . . . . . . . . 11  |-  ( 2nd
: _V -onto-> _V  ->  2nd 
Fn  _V )
108, 9ax-mp 5 . . . . . . . . . 10  |-  2nd  Fn  _V
11 vex 2663 . . . . . . . . . 10  |-  x  e. 
_V
12 fnbrfvb 5430 . . . . . . . . . 10  |-  ( ( 2nd  Fn  _V  /\  x  e.  _V )  ->  ( ( 2nd `  x
)  =  y  <->  x 2nd y ) )
1310, 11, 12mp2an 422 . . . . . . . . 9  |-  ( ( 2nd `  x )  =  y  <->  x 2nd y )
1413anbi1i 453 . . . . . . . 8  |-  ( ( ( 2nd `  x
)  =  y  /\  x  e.  ( { A }  X.  B
) )  <->  ( x 2nd y  /\  x  e.  ( { A }  X.  B ) ) )
15 elxp7 6036 . . . . . . . . . . 11  |-  ( x  e.  ( { A }  X.  B )  <->  ( x  e.  ( _V  X.  _V )  /\  ( ( 1st `  x )  e.  { A }  /\  ( 2nd `  x )  e.  B ) ) )
16 eleq1 2180 . . . . . . . . . . . . . . 15  |-  ( ( 2nd `  x )  =  y  ->  (
( 2nd `  x
)  e.  B  <->  y  e.  B ) )
1716biimpa 294 . . . . . . . . . . . . . 14  |-  ( ( ( 2nd `  x
)  =  y  /\  ( 2nd `  x )  e.  B )  -> 
y  e.  B )
1817adantrl 469 . . . . . . . . . . . . 13  |-  ( ( ( 2nd `  x
)  =  y  /\  ( ( 1st `  x
)  e.  { A }  /\  ( 2nd `  x
)  e.  B ) )  ->  y  e.  B )
1918adantrl 469 . . . . . . . . . . . 12  |-  ( ( ( 2nd `  x
)  =  y  /\  ( x  e.  ( _V  X.  _V )  /\  ( ( 1st `  x
)  e.  { A }  /\  ( 2nd `  x
)  e.  B ) ) )  ->  y  e.  B )
20 elsni 3515 . . . . . . . . . . . . . 14  |-  ( ( 1st `  x )  e.  { A }  ->  ( 1st `  x
)  =  A )
21 eqopi 6038 . . . . . . . . . . . . . . . 16  |-  ( ( x  e.  ( _V 
X.  _V )  /\  (
( 1st `  x
)  =  A  /\  ( 2nd `  x )  =  y ) )  ->  x  =  <. A ,  y >. )
2221ancom2s 540 . . . . . . . . . . . . . . 15  |-  ( ( x  e.  ( _V 
X.  _V )  /\  (
( 2nd `  x
)  =  y  /\  ( 1st `  x )  =  A ) )  ->  x  =  <. A ,  y >. )
2322an12s 539 . . . . . . . . . . . . . 14  |-  ( ( ( 2nd `  x
)  =  y  /\  ( x  e.  ( _V  X.  _V )  /\  ( 1st `  x )  =  A ) )  ->  x  =  <. A ,  y >. )
2420, 23sylanr2 402 . . . . . . . . . . . . 13  |-  ( ( ( 2nd `  x
)  =  y  /\  ( x  e.  ( _V  X.  _V )  /\  ( 1st `  x )  e.  { A }
) )  ->  x  =  <. A ,  y
>. )
2524adantrrr 478 . . . . . . . . . . . 12  |-  ( ( ( 2nd `  x
)  =  y  /\  ( x  e.  ( _V  X.  _V )  /\  ( ( 1st `  x
)  e.  { A }  /\  ( 2nd `  x
)  e.  B ) ) )  ->  x  =  <. A ,  y
>. )
2619, 25jca 304 . . . . . . . . . . 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 285 . . . . . . . . . 10  |-  ( ( ( 2nd `  x
)  =  y  /\  x  e.  ( { A }  X.  B
) )  ->  (
y  e.  B  /\  x  =  <. A , 
y >. ) )
2827adantl 275 . . . . . . . . 9  |-  ( ( A  e.  V  /\  ( ( 2nd `  x
)  =  y  /\  x  e.  ( { A }  X.  B
) ) )  -> 
( y  e.  B  /\  x  =  <. A ,  y >. )
)
29 fveq2 5389 . . . . . . . . . . . 12  |-  ( x  =  <. A ,  y
>.  ->  ( 2nd `  x
)  =  ( 2nd `  <. A ,  y
>. ) )
30 op2ndg 6017 . . . . . . . . . . . . 13  |-  ( ( A  e.  V  /\  y  e.  _V )  ->  ( 2nd `  <. A ,  y >. )  =  y )
316, 30mpan2 421 . . . . . . . . . . . 12  |-  ( A  e.  V  ->  ( 2nd `  <. A ,  y
>. )  =  y
)
3229, 31sylan9eqr 2172 . . . . . . . . . . 11  |-  ( ( A  e.  V  /\  x  =  <. A , 
y >. )  ->  ( 2nd `  x )  =  y )
3332adantrl 469 . . . . . . . . . 10  |-  ( ( A  e.  V  /\  ( y  e.  B  /\  x  =  <. A ,  y >. )
)  ->  ( 2nd `  x )  =  y )
34 simprr 506 . . . . . . . . . . 11  |-  ( ( A  e.  V  /\  ( y  e.  B  /\  x  =  <. A ,  y >. )
)  ->  x  =  <. A ,  y >.
)
35 snidg 3524 . . . . . . . . . . . . 13  |-  ( A  e.  V  ->  A  e.  { A } )
3635adantr 274 . . . . . . . . . . . 12  |-  ( ( A  e.  V  /\  ( y  e.  B  /\  x  =  <. A ,  y >. )
)  ->  A  e.  { A } )
37 simprl 505 . . . . . . . . . . . 12  |-  ( ( A  e.  V  /\  ( y  e.  B  /\  x  =  <. A ,  y >. )
)  ->  y  e.  B )
38 opelxpi 4541 . . . . . . . . . . . 12  |-  ( ( A  e.  { A }  /\  y  e.  B
)  ->  <. A , 
y >.  e.  ( { A }  X.  B
) )
3936, 37, 38syl2anc 408 . . . . . . . . . . 11  |-  ( ( A  e.  V  /\  ( y  e.  B  /\  x  =  <. A ,  y >. )
)  ->  <. A , 
y >.  e.  ( { A }  X.  B
) )
4034, 39eqeltrd 2194 . . . . . . . . . 10  |-  ( ( A  e.  V  /\  ( y  e.  B  /\  x  =  <. A ,  y >. )
)  ->  x  e.  ( { A }  X.  B ) )
4133, 40jca 304 . . . . . . . . 9  |-  ( ( A  e.  V  /\  ( y  e.  B  /\  x  =  <. A ,  y >. )
)  ->  ( ( 2nd `  x )  =  y  /\  x  e.  ( { A }  X.  B ) ) )
4228, 41impbida 570 . . . . . . . 8  |-  ( A  e.  V  ->  (
( ( 2nd `  x
)  =  y  /\  x  e.  ( { A }  X.  B
) )  <->  ( y  e.  B  /\  x  =  <. A ,  y
>. ) ) )
4314, 42syl5bbr 193 . . . . . . 7  |-  ( A  e.  V  ->  (
( x 2nd y  /\  x  e.  ( { A }  X.  B
) )  <->  ( y  e.  B  /\  x  =  <. A ,  y
>. ) ) )
447, 43syl5bb 191 . . . . . 6  |-  ( A  e.  V  ->  (
x ( 2nd  |`  ( { A }  X.  B
) ) y  <->  ( y  e.  B  /\  x  =  <. A ,  y
>. ) ) )
4544mobidv 2013 . . . . 5  |-  ( A  e.  V  ->  ( E* x  x ( 2nd  |`  ( { A }  X.  B ) ) y  <->  E* x ( y  e.  B  /\  x  =  <. A ,  y
>. ) ) )
465, 45mpbiri 167 . . . 4  |-  ( A  e.  V  ->  E* x  x ( 2nd  |`  ( { A }  X.  B
) ) y )
4746alrimiv 1830 . . 3  |-  ( A  e.  V  ->  A. y E* x  x ( 2nd  |`  ( { A }  X.  B ) ) y )
48 funcnv2 5153 . . 3  |-  ( Fun  `' ( 2nd  |`  ( { A }  X.  B
) )  <->  A. y E* x  x ( 2nd  |`  ( { A }  X.  B ) ) y )
4947, 48sylibr 133 . 2  |-  ( A  e.  V  ->  Fun  `' ( 2nd  |`  ( { A }  X.  B
) ) )
50 dff1o3 5341 . 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 413 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    /\ wa 103    <-> wb 104   A.wal 1314    = wceq 1316   E.wex 1453    e. wcel 1465   E*wmo 1978   _Vcvv 2660   {csn 3497   <.cop 3500   class class class wbr 3899    X. cxp 4507   `'ccnv 4508    |` cres 4511   Fun wfun 5087    Fn wfn 5088   -onto->wfo 5091   -1-1-onto->wf1o 5092   ` cfv 5093   1stc1st 6004   2ndc2nd 6005
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-rab 2402  df-v 2662  df-sbc 2883  df-csb 2976  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-iun 3785  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-res 4521  df-ima 4522  df-iota 5058  df-fun 5095  df-fn 5096  df-f 5097  df-f1 5098  df-fo 5099  df-f1o 5100  df-fv 5101  df-1st 6006  df-2nd 6007
This theorem is referenced by:  xpfi  6786  fsum2dlemstep  11158
  Copyright terms: Public domain W3C validator