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

Theorem 1stconst 6314
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 3752 . . 3  |-  ( B  e.  V  ->  E. x  x  e.  { B } )
2 fo1stresm 6254 . . 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 2949 . . . . . 6  |-  E* x  x  =  <. y ,  B >.
54moani 2125 . . . . 5  |-  E* x
( y  e.  A  /\  x  =  <. y ,  B >. )
6 vex 2776 . . . . . . . 8  |-  y  e. 
_V
76brres 4970 . . . . . . 7  |-  ( x ( 1st  |`  ( A  X.  { B }
) ) y  <->  ( x 1st y  /\  x  e.  ( A  X.  { B } ) ) )
8 fo1st 6250 . . . . . . . . . . 11  |-  1st : _V -onto-> _V
9 fofn 5507 . . . . . . . . . . 11  |-  ( 1st
: _V -onto-> _V  ->  1st 
Fn  _V )
108, 9ax-mp 5 . . . . . . . . . 10  |-  1st  Fn  _V
11 vex 2776 . . . . . . . . . 10  |-  x  e. 
_V
12 fnbrfvb 5626 . . . . . . . . . 10  |-  ( ( 1st  Fn  _V  /\  x  e.  _V )  ->  ( ( 1st `  x
)  =  y  <->  x 1st y ) )
1310, 11, 12mp2an 426 . . . . . . . . 9  |-  ( ( 1st `  x )  =  y  <->  x 1st y )
1413anbi1i 458 . . . . . . . 8  |-  ( ( ( 1st `  x
)  =  y  /\  x  e.  ( A  X.  { B } ) )  <->  ( x 1st y  /\  x  e.  ( A  X.  { B } ) ) )
15 elxp7 6263 . . . . . . . . . . 11  |-  ( x  e.  ( A  X.  { B } )  <->  ( x  e.  ( _V  X.  _V )  /\  ( ( 1st `  x )  e.  A  /\  ( 2nd `  x
)  e.  { B } ) ) )
16 eleq1 2269 . . . . . . . . . . . . . . 15  |-  ( ( 1st `  x )  =  y  ->  (
( 1st `  x
)  e.  A  <->  y  e.  A ) )
1716biimpa 296 . . . . . . . . . . . . . 14  |-  ( ( ( 1st `  x
)  =  y  /\  ( 1st `  x )  e.  A )  -> 
y  e.  A )
1817adantrr 479 . . . . . . . . . . . . 13  |-  ( ( ( 1st `  x
)  =  y  /\  ( ( 1st `  x
)  e.  A  /\  ( 2nd `  x )  e.  { B }
) )  ->  y  e.  A )
1918adantrl 478 . . . . . . . . . . . 12  |-  ( ( ( 1st `  x
)  =  y  /\  ( x  e.  ( _V  X.  _V )  /\  ( ( 1st `  x
)  e.  A  /\  ( 2nd `  x )  e.  { B }
) ) )  -> 
y  e.  A )
20 elsni 3652 . . . . . . . . . . . . . 14  |-  ( ( 2nd `  x )  e.  { B }  ->  ( 2nd `  x
)  =  B )
21 eqopi 6265 . . . . . . . . . . . . . . 15  |-  ( ( x  e.  ( _V 
X.  _V )  /\  (
( 1st `  x
)  =  y  /\  ( 2nd `  x )  =  B ) )  ->  x  =  <. y ,  B >. )
2221an12s 565 . . . . . . . . . . . . . 14  |-  ( ( ( 1st `  x
)  =  y  /\  ( x  e.  ( _V  X.  _V )  /\  ( 2nd `  x )  =  B ) )  ->  x  =  <. y ,  B >. )
2320, 22sylanr2 405 . . . . . . . . . . . . 13  |-  ( ( ( 1st `  x
)  =  y  /\  ( x  e.  ( _V  X.  _V )  /\  ( 2nd `  x )  e.  { B }
) )  ->  x  =  <. y ,  B >. )
2423adantrrl 486 . . . . . . . . . . . 12  |-  ( ( ( 1st `  x
)  =  y  /\  ( x  e.  ( _V  X.  _V )  /\  ( ( 1st `  x
)  e.  A  /\  ( 2nd `  x )  e.  { B }
) ) )  ->  x  =  <. y ,  B >. )
2519, 24jca 306 . . . . . . . . . . 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 287 . . . . . . . . . 10  |-  ( ( ( 1st `  x
)  =  y  /\  x  e.  ( A  X.  { B } ) )  ->  ( y  e.  A  /\  x  =  <. y ,  B >. ) )
2726adantl 277 . . . . . . . . 9  |-  ( ( B  e.  V  /\  ( ( 1st `  x
)  =  y  /\  x  e.  ( A  X.  { B } ) ) )  ->  (
y  e.  A  /\  x  =  <. y ,  B >. ) )
28 simprr 531 . . . . . . . . . . . 12  |-  ( ( B  e.  V  /\  ( y  e.  A  /\  x  =  <. y ,  B >. )
)  ->  x  =  <. y ,  B >. )
2928fveq2d 5587 . . . . . . . . . . 11  |-  ( ( B  e.  V  /\  ( y  e.  A  /\  x  =  <. y ,  B >. )
)  ->  ( 1st `  x )  =  ( 1st `  <. y ,  B >. ) )
30 simprl 529 . . . . . . . . . . . 12  |-  ( ( B  e.  V  /\  ( y  e.  A  /\  x  =  <. y ,  B >. )
)  ->  y  e.  A )
31 simpl 109 . . . . . . . . . . . 12  |-  ( ( B  e.  V  /\  ( y  e.  A  /\  x  =  <. y ,  B >. )
)  ->  B  e.  V )
32 op1stg 6243 . . . . . . . . . . . 12  |-  ( ( y  e.  A  /\  B  e.  V )  ->  ( 1st `  <. y ,  B >. )  =  y )
3330, 31, 32syl2anc 411 . . . . . . . . . . 11  |-  ( ( B  e.  V  /\  ( y  e.  A  /\  x  =  <. y ,  B >. )
)  ->  ( 1st ` 
<. y ,  B >. )  =  y )
3429, 33eqtrd 2239 . . . . . . . . . 10  |-  ( ( B  e.  V  /\  ( y  e.  A  /\  x  =  <. y ,  B >. )
)  ->  ( 1st `  x )  =  y )
35 snidg 3663 . . . . . . . . . . . . 13  |-  ( B  e.  V  ->  B  e.  { B } )
3635adantr 276 . . . . . . . . . . . 12  |-  ( ( B  e.  V  /\  ( y  e.  A  /\  x  =  <. y ,  B >. )
)  ->  B  e.  { B } )
37 opelxpi 4711 . . . . . . . . . . . 12  |-  ( ( y  e.  A  /\  B  e.  { B } )  ->  <. y ,  B >.  e.  ( A  X.  { B }
) )
3830, 36, 37syl2anc 411 . . . . . . . . . . 11  |-  ( ( B  e.  V  /\  ( y  e.  A  /\  x  =  <. y ,  B >. )
)  ->  <. y ,  B >.  e.  ( A  X.  { B }
) )
3928, 38eqeltrd 2283 . . . . . . . . . 10  |-  ( ( B  e.  V  /\  ( y  e.  A  /\  x  =  <. y ,  B >. )
)  ->  x  e.  ( A  X.  { B } ) )
4034, 39jca 306 . . . . . . . . 9  |-  ( ( B  e.  V  /\  ( y  e.  A  /\  x  =  <. y ,  B >. )
)  ->  ( ( 1st `  x )  =  y  /\  x  e.  ( A  X.  { B } ) ) )
4127, 40impbida 596 . . . . . . . 8  |-  ( B  e.  V  ->  (
( ( 1st `  x
)  =  y  /\  x  e.  ( A  X.  { B } ) )  <->  ( y  e.  A  /\  x  = 
<. y ,  B >. ) ) )
4214, 41bitr3id 194 . . . . . . 7  |-  ( B  e.  V  ->  (
( x 1st y  /\  x  e.  ( A  X.  { B }
) )  <->  ( y  e.  A  /\  x  =  <. y ,  B >. ) ) )
437, 42bitrid 192 . . . . . 6  |-  ( B  e.  V  ->  (
x ( 1st  |`  ( A  X.  { B }
) ) y  <->  ( y  e.  A  /\  x  =  <. y ,  B >. ) ) )
4443mobidv 2091 . . . . 5  |-  ( B  e.  V  ->  ( E* x  x ( 1st  |`  ( A  X.  { B } ) ) y  <->  E* x ( y  e.  A  /\  x  =  <. y ,  B >. ) ) )
455, 44mpbiri 168 . . . 4  |-  ( B  e.  V  ->  E* x  x ( 1st  |`  ( A  X.  { B }
) ) y )
4645alrimiv 1898 . . 3  |-  ( B  e.  V  ->  A. y E* x  x ( 1st  |`  ( A  X.  { B } ) ) y )
47 funcnv2 5339 . . 3  |-  ( Fun  `' ( 1st  |`  ( A  X.  { B }
) )  <->  A. y E* x  x ( 1st  |`  ( A  X.  { B } ) ) y )
4846, 47sylibr 134 . 2  |-  ( B  e.  V  ->  Fun  `' ( 1st  |`  ( A  X.  { B }
) ) )
49 dff1o3 5535 . 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 417 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 104    <-> wb 105   A.wal 1371    = wceq 1373   E.wex 1516   E*wmo 2056    e. wcel 2177   _Vcvv 2773   {csn 3634   <.cop 3637   class class class wbr 4047    X. cxp 4677   `'ccnv 4678    |` cres 4681   Fun wfun 5270    Fn wfn 5271   -onto->wfo 5274   -1-1-onto->wf1o 5275   ` cfv 5276   1stc1st 6231   2ndc2nd 6232
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-sep 4166  ax-pow 4222  ax-pr 4257  ax-un 4484
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ral 2490  df-rex 2491  df-rab 2494  df-v 2775  df-sbc 3000  df-csb 3095  df-un 3171  df-in 3173  df-ss 3180  df-pw 3619  df-sn 3640  df-pr 3641  df-op 3643  df-uni 3853  df-iun 3931  df-br 4048  df-opab 4110  df-mpt 4111  df-id 4344  df-xp 4685  df-rel 4686  df-cnv 4687  df-co 4688  df-dm 4689  df-rn 4690  df-res 4691  df-ima 4692  df-iota 5237  df-fun 5278  df-fn 5279  df-f 5280  df-f1 5281  df-fo 5282  df-f1o 5283  df-fv 5284  df-1st 6233  df-2nd 6234
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator