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

Theorem 1stcof 6166
Description: Composition of the first member function with another function. (Contributed by NM, 12-Oct-2007.)
Assertion
Ref Expression
1stcof  |-  ( F : A --> ( B  X.  C )  -> 
( 1st  o.  F
) : A --> B )

Proof of Theorem 1stcof
StepHypRef Expression
1 fo1st 6160 . . . 4  |-  1st : _V -onto-> _V
2 fofn 5442 . . . 4  |-  ( 1st
: _V -onto-> _V  ->  1st 
Fn  _V )
31, 2ax-mp 5 . . 3  |-  1st  Fn  _V
4 ffn 5367 . . . 4  |-  ( F : A --> ( B  X.  C )  ->  F  Fn  A )
5 dffn2 5369 . . . 4  |-  ( F  Fn  A  <->  F : A
--> _V )
64, 5sylib 122 . . 3  |-  ( F : A --> ( B  X.  C )  ->  F : A --> _V )
7 fnfco 5392 . . 3  |-  ( ( 1st  Fn  _V  /\  F : A --> _V )  ->  ( 1st  o.  F
)  Fn  A )
83, 6, 7sylancr 414 . 2  |-  ( F : A --> ( B  X.  C )  -> 
( 1st  o.  F
)  Fn  A )
9 rnco 5137 . . 3  |-  ran  ( 1st  o.  F )  =  ran  ( 1st  |`  ran  F
)
10 frn 5376 . . . . 5  |-  ( F : A --> ( B  X.  C )  ->  ran  F  C_  ( B  X.  C ) )
11 ssres2 4936 . . . . 5  |-  ( ran 
F  C_  ( B  X.  C )  ->  ( 1st  |`  ran  F ) 
C_  ( 1st  |`  ( B  X.  C ) ) )
12 rnss 4859 . . . . 5  |-  ( ( 1st  |`  ran  F ) 
C_  ( 1st  |`  ( B  X.  C ) )  ->  ran  ( 1st  |` 
ran  F )  C_  ran  ( 1st  |`  ( B  X.  C ) ) )
1310, 11, 123syl 17 . . . 4  |-  ( F : A --> ( B  X.  C )  ->  ran  ( 1st  |`  ran  F
)  C_  ran  ( 1st  |`  ( B  X.  C
) ) )
14 f1stres 6162 . . . . 5  |-  ( 1st  |`  ( B  X.  C
) ) : ( B  X.  C ) --> B
15 frn 5376 . . . . 5  |-  ( ( 1st  |`  ( B  X.  C ) ) : ( B  X.  C
) --> B  ->  ran  ( 1st  |`  ( B  X.  C ) )  C_  B )
1614, 15ax-mp 5 . . . 4  |-  ran  ( 1st  |`  ( B  X.  C ) )  C_  B
1713, 16sstrdi 3169 . . 3  |-  ( F : A --> ( B  X.  C )  ->  ran  ( 1st  |`  ran  F
)  C_  B )
189, 17eqsstrid 3203 . 2  |-  ( F : A --> ( B  X.  C )  ->  ran  ( 1st  o.  F
)  C_  B )
19 df-f 5222 . 2  |-  ( ( 1st  o.  F ) : A --> B  <->  ( ( 1st  o.  F )  Fn  A  /\  ran  ( 1st  o.  F )  C_  B ) )
208, 18, 19sylanbrc 417 1  |-  ( F : A --> ( B  X.  C )  -> 
( 1st  o.  F
) : A --> B )
Colors of variables: wff set class
Syntax hints:    -> wi 4   _Vcvv 2739    C_ wss 3131    X. cxp 4626   ran crn 4629    |` cres 4630    o. ccom 4632    Fn wfn 5213   -->wf 5214   -onto->wfo 5216   1stc1st 6141
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-fo 5224  df-fv 5226  df-1st 6143
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator