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

Theorem 1stconst 6189
Description: The mapping of a restriction of the  1st function to a constant function. (Contributed by NM, 14-Dec-2008.)
Assertion
Ref Expression
1stconst  |-  ( B  e.  V  ->  ( 1st  |`  ( A  X.  { B } ) ) : ( A  X.  { B } ) -1-1-onto-> A )

Proof of Theorem 1stconst
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 snmg 3694 . . 3  |-  ( B  e.  V  ->  E. x  x  e.  { B } )
2 fo1stresm 6129 . . 3  |-  ( E. x  x  e.  { B }  ->  ( 1st  |`  ( A  X.  { B } ) ) : ( A  X.  { B } ) -onto-> A )
31, 2syl 14 . 2  |-  ( B  e.  V  ->  ( 1st  |`  ( A  X.  { B } ) ) : ( A  X.  { B } ) -onto-> A )
4 moeq 2901 . . . . . 6  |-  E* x  x  =  <. y ,  B >.
54moani 2084 . . . . 5  |-  E* x
( y  e.  A  /\  x  =  <. y ,  B >. )
6 vex 2729 . . . . . . . 8  |-  y  e. 
_V
76brres 4890 . . . . . . 7  |-  ( x ( 1st  |`  ( A  X.  { B }
) ) y  <->  ( x 1st y  /\  x  e.  ( A  X.  { B } ) ) )
8 fo1st 6125 . . . . . . . . . . 11  |-  1st : _V -onto-> _V
9 fofn 5412 . . . . . . . . . . 11  |-  ( 1st
: _V -onto-> _V  ->  1st 
Fn  _V )
108, 9ax-mp 5 . . . . . . . . . 10  |-  1st  Fn  _V
11 vex 2729 . . . . . . . . . 10  |-  x  e. 
_V
12 fnbrfvb 5527 . . . . . . . . . 10  |-  ( ( 1st  Fn  _V  /\  x  e.  _V )  ->  ( ( 1st `  x
)  =  y  <->  x 1st y ) )
1310, 11, 12mp2an 423 . . . . . . . . 9  |-  ( ( 1st `  x )  =  y  <->  x 1st y )
1413anbi1i 454 . . . . . . . 8  |-  ( ( ( 1st `  x
)  =  y  /\  x  e.  ( A  X.  { B } ) )  <->  ( x 1st y  /\  x  e.  ( A  X.  { B } ) ) )
15 elxp7 6138 . . . . . . . . . . 11  |-  ( x  e.  ( A  X.  { B } )  <->  ( x  e.  ( _V  X.  _V )  /\  ( ( 1st `  x )  e.  A  /\  ( 2nd `  x
)  e.  { B } ) ) )
16 eleq1 2229 . . . . . . . . . . . . . . 15  |-  ( ( 1st `  x )  =  y  ->  (
( 1st `  x
)  e.  A  <->  y  e.  A ) )
1716biimpa 294 . . . . . . . . . . . . . 14  |-  ( ( ( 1st `  x
)  =  y  /\  ( 1st `  x )  e.  A )  -> 
y  e.  A )
1817adantrr 471 . . . . . . . . . . . . 13  |-  ( ( ( 1st `  x
)  =  y  /\  ( ( 1st `  x
)  e.  A  /\  ( 2nd `  x )  e.  { B }
) )  ->  y  e.  A )
1918adantrl 470 . . . . . . . . . . . 12  |-  ( ( ( 1st `  x
)  =  y  /\  ( x  e.  ( _V  X.  _V )  /\  ( ( 1st `  x
)  e.  A  /\  ( 2nd `  x )  e.  { B }
) ) )  -> 
y  e.  A )
20 elsni 3594 . . . . . . . . . . . . . 14  |-  ( ( 2nd `  x )  e.  { B }  ->  ( 2nd `  x
)  =  B )
21 eqopi 6140 . . . . . . . . . . . . . . 15  |-  ( ( x  e.  ( _V 
X.  _V )  /\  (
( 1st `  x
)  =  y  /\  ( 2nd `  x )  =  B ) )  ->  x  =  <. y ,  B >. )
2221an12s 555 . . . . . . . . . . . . . 14  |-  ( ( ( 1st `  x
)  =  y  /\  ( x  e.  ( _V  X.  _V )  /\  ( 2nd `  x )  =  B ) )  ->  x  =  <. y ,  B >. )
2320, 22sylanr2 403 . . . . . . . . . . . . 13  |-  ( ( ( 1st `  x
)  =  y  /\  ( x  e.  ( _V  X.  _V )  /\  ( 2nd `  x )  e.  { B }
) )  ->  x  =  <. y ,  B >. )
2423adantrrl 478 . . . . . . . . . . . 12  |-  ( ( ( 1st `  x
)  =  y  /\  ( x  e.  ( _V  X.  _V )  /\  ( ( 1st `  x
)  e.  A  /\  ( 2nd `  x )  e.  { B }
) ) )  ->  x  =  <. y ,  B >. )
2519, 24jca 304 . . . . . . . . . . 11  |-  ( ( ( 1st `  x
)  =  y  /\  ( x  e.  ( _V  X.  _V )  /\  ( ( 1st `  x
)  e.  A  /\  ( 2nd `  x )  e.  { B }
) ) )  -> 
( y  e.  A  /\  x  =  <. y ,  B >. )
)
2615, 25sylan2b 285 . . . . . . . . . 10  |-  ( ( ( 1st `  x
)  =  y  /\  x  e.  ( A  X.  { B } ) )  ->  ( y  e.  A  /\  x  =  <. y ,  B >. ) )
2726adantl 275 . . . . . . . . 9  |-  ( ( B  e.  V  /\  ( ( 1st `  x
)  =  y  /\  x  e.  ( A  X.  { B } ) ) )  ->  (
y  e.  A  /\  x  =  <. y ,  B >. ) )
28 simprr 522 . . . . . . . . . . . 12  |-  ( ( B  e.  V  /\  ( y  e.  A  /\  x  =  <. y ,  B >. )
)  ->  x  =  <. y ,  B >. )
2928fveq2d 5490 . . . . . . . . . . 11  |-  ( ( B  e.  V  /\  ( y  e.  A  /\  x  =  <. y ,  B >. )
)  ->  ( 1st `  x )  =  ( 1st `  <. y ,  B >. ) )
30 simprl 521 . . . . . . . . . . . 12  |-  ( ( B  e.  V  /\  ( y  e.  A  /\  x  =  <. y ,  B >. )
)  ->  y  e.  A )
31 simpl 108 . . . . . . . . . . . 12  |-  ( ( B  e.  V  /\  ( y  e.  A  /\  x  =  <. y ,  B >. )
)  ->  B  e.  V )
32 op1stg 6118 . . . . . . . . . . . 12  |-  ( ( y  e.  A  /\  B  e.  V )  ->  ( 1st `  <. y ,  B >. )  =  y )
3330, 31, 32syl2anc 409 . . . . . . . . . . 11  |-  ( ( B  e.  V  /\  ( y  e.  A  /\  x  =  <. y ,  B >. )
)  ->  ( 1st ` 
<. y ,  B >. )  =  y )
3429, 33eqtrd 2198 . . . . . . . . . 10  |-  ( ( B  e.  V  /\  ( y  e.  A  /\  x  =  <. y ,  B >. )
)  ->  ( 1st `  x )  =  y )
35 snidg 3605 . . . . . . . . . . . . 13  |-  ( B  e.  V  ->  B  e.  { B } )
3635adantr 274 . . . . . . . . . . . 12  |-  ( ( B  e.  V  /\  ( y  e.  A  /\  x  =  <. y ,  B >. )
)  ->  B  e.  { B } )
37 opelxpi 4636 . . . . . . . . . . . 12  |-  ( ( y  e.  A  /\  B  e.  { B } )  ->  <. y ,  B >.  e.  ( A  X.  { B }
) )
3830, 36, 37syl2anc 409 . . . . . . . . . . 11  |-  ( ( B  e.  V  /\  ( y  e.  A  /\  x  =  <. y ,  B >. )
)  ->  <. y ,  B >.  e.  ( A  X.  { B }
) )
3928, 38eqeltrd 2243 . . . . . . . . . 10  |-  ( ( B  e.  V  /\  ( y  e.  A  /\  x  =  <. y ,  B >. )
)  ->  x  e.  ( A  X.  { B } ) )
4034, 39jca 304 . . . . . . . . 9  |-  ( ( B  e.  V  /\  ( y  e.  A  /\  x  =  <. y ,  B >. )
)  ->  ( ( 1st `  x )  =  y  /\  x  e.  ( A  X.  { B } ) ) )
4127, 40impbida 586 . . . . . . . 8  |-  ( B  e.  V  ->  (
( ( 1st `  x
)  =  y  /\  x  e.  ( A  X.  { B } ) )  <->  ( y  e.  A  /\  x  = 
<. y ,  B >. ) ) )
4214, 41bitr3id 193 . . . . . . 7  |-  ( B  e.  V  ->  (
( x 1st y  /\  x  e.  ( A  X.  { B }
) )  <->  ( y  e.  A  /\  x  =  <. y ,  B >. ) ) )
437, 42syl5bb 191 . . . . . 6  |-  ( B  e.  V  ->  (
x ( 1st  |`  ( A  X.  { B }
) ) y  <->  ( y  e.  A  /\  x  =  <. y ,  B >. ) ) )
4443mobidv 2050 . . . . 5  |-  ( B  e.  V  ->  ( E* x  x ( 1st  |`  ( A  X.  { B } ) ) y  <->  E* x ( y  e.  A  /\  x  =  <. y ,  B >. ) ) )
455, 44mpbiri 167 . . . 4  |-  ( B  e.  V  ->  E* x  x ( 1st  |`  ( A  X.  { B }
) ) y )
4645alrimiv 1862 . . 3  |-  ( B  e.  V  ->  A. y E* x  x ( 1st  |`  ( A  X.  { B } ) ) y )
47 funcnv2 5248 . . 3  |-  ( Fun  `' ( 1st  |`  ( A  X.  { B }
) )  <->  A. y E* x  x ( 1st  |`  ( A  X.  { B } ) ) y )
4846, 47sylibr 133 . 2  |-  ( B  e.  V  ->  Fun  `' ( 1st  |`  ( A  X.  { B }
) ) )
49 dff1o3 5438 . 2  |-  ( ( 1st  |`  ( A  X.  { B } ) ) : ( A  X.  { B }
)
-1-1-onto-> A 
<->  ( ( 1st  |`  ( A  X.  { B }
) ) : ( A  X.  { B } ) -onto-> A  /\  Fun  `' ( 1st  |`  ( A  X.  { B }
) ) ) )
503, 48, 49sylanbrc 414 1  |-  ( B  e.  V  ->  ( 1st  |`  ( A  X.  { B } ) ) : ( A  X.  { B } ) -1-1-onto-> A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104   A.wal 1341    = wceq 1343   E.wex 1480   E*wmo 2015    e. wcel 2136   _Vcvv 2726   {csn 3576   <.cop 3579   class class class wbr 3982    X. cxp 4602   `'ccnv 4603    |` cres 4606   Fun wfun 5182    Fn wfn 5183   -onto->wfo 5186   -1-1-onto->wf1o 5187   ` cfv 5188   1stc1st 6106   2ndc2nd 6107
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 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187  ax-un 4411
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fo 5194  df-f1o 5195  df-fv 5196  df-1st 6108  df-2nd 6109
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator