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

Theorem 2ndcof 5811
Description: Composition of the second member function with another function. (Contributed by FL, 15-Oct-2012.)
Assertion
Ref Expression
2ndcof  |-  ( F : A --> ( B  X.  C )  -> 
( 2nd  o.  F
) : A --> C )

Proof of Theorem 2ndcof
StepHypRef Expression
1 fo2nd 5805 . . . 4  |-  2nd : _V -onto-> _V
2 fofn 5128 . . . 4  |-  ( 2nd
: _V -onto-> _V  ->  2nd 
Fn  _V )
31, 2ax-mp 7 . . 3  |-  2nd  Fn  _V
4 ffn 5066 . . . 4  |-  ( F : A --> ( B  X.  C )  ->  F  Fn  A )
5 dffn2 5067 . . . 4  |-  ( F  Fn  A  <->  F : A
--> _V )
64, 5sylib 120 . . 3  |-  ( F : A --> ( B  X.  C )  ->  F : A --> _V )
7 fnfco 5085 . . 3  |-  ( ( 2nd  Fn  _V  /\  F : A --> _V )  ->  ( 2nd  o.  F
)  Fn  A )
83, 6, 7sylancr 405 . 2  |-  ( F : A --> ( B  X.  C )  -> 
( 2nd  o.  F
)  Fn  A )
9 rnco 4847 . . 3  |-  ran  ( 2nd  o.  F )  =  ran  ( 2nd  |`  ran  F
)
10 frn 5072 . . . . 5  |-  ( F : A --> ( B  X.  C )  ->  ran  F  C_  ( B  X.  C ) )
11 ssres2 4656 . . . . 5  |-  ( ran 
F  C_  ( B  X.  C )  ->  ( 2nd  |`  ran  F ) 
C_  ( 2nd  |`  ( B  X.  C ) ) )
12 rnss 4582 . . . . 5  |-  ( ( 2nd  |`  ran  F ) 
C_  ( 2nd  |`  ( B  X.  C ) )  ->  ran  ( 2nd  |` 
ran  F )  C_  ran  ( 2nd  |`  ( B  X.  C ) ) )
1310, 11, 123syl 17 . . . 4  |-  ( F : A --> ( B  X.  C )  ->  ran  ( 2nd  |`  ran  F
)  C_  ran  ( 2nd  |`  ( B  X.  C
) ) )
14 f2ndres 5807 . . . . 5  |-  ( 2nd  |`  ( B  X.  C
) ) : ( B  X.  C ) --> C
15 frn 5072 . . . . 5  |-  ( ( 2nd  |`  ( B  X.  C ) ) : ( B  X.  C
) --> C  ->  ran  ( 2nd  |`  ( B  X.  C ) )  C_  C )
1614, 15ax-mp 7 . . . 4  |-  ran  ( 2nd  |`  ( B  X.  C ) )  C_  C
1713, 16syl6ss 3011 . . 3  |-  ( F : A --> ( B  X.  C )  ->  ran  ( 2nd  |`  ran  F
)  C_  C )
189, 17syl5eqss 3043 . 2  |-  ( F : A --> ( B  X.  C )  ->  ran  ( 2nd  o.  F
)  C_  C )
19 df-f 4926 . 2  |-  ( ( 2nd  o.  F ) : A --> C  <->  ( ( 2nd  o.  F )  Fn  A  /\  ran  ( 2nd  o.  F )  C_  C ) )
208, 18, 19sylanbrc 408 1  |-  ( F : A --> ( B  X.  C )  -> 
( 2nd  o.  F
) : A --> C )
Colors of variables: wff set class
Syntax hints:    -> wi 4   _Vcvv 2601    C_ wss 2973    X. cxp 4361   ran crn 4364    |` cres 4365    o. ccom 4367    Fn wfn 4917   -->wf 4918   -onto->wfo 4920   2ndc2nd 5786
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964  ax-un 4188
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-rab 2357  df-v 2603  df-sbc 2816  df-csb 2909  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-iun 3680  df-br 3786  df-opab 3840  df-mpt 3841  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-fo 4928  df-fv 4930  df-2nd 5788
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator