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

Theorem cofunexg 6100
Description: Existence of a composition when the first member is a function. (Contributed by NM, 8-Oct-2007.)
Assertion
Ref Expression
cofunexg  |-  ( ( Fun  A  /\  B  e.  C )  ->  ( A  o.  B )  e.  _V )

Proof of Theorem cofunexg
StepHypRef Expression
1 relco 5119 . . 3  |-  Rel  ( A  o.  B )
2 relssdmrn 5141 . . 3  |-  ( Rel  ( A  o.  B
)  ->  ( A  o.  B )  C_  ( dom  ( A  o.  B
)  X.  ran  ( A  o.  B )
) )
31, 2ax-mp 5 . 2  |-  ( A  o.  B )  C_  ( dom  ( A  o.  B )  X.  ran  ( A  o.  B
) )
4 dmcoss 4889 . . . . 5  |-  dom  ( A  o.  B )  C_ 
dom  B
5 dmexg 4884 . . . . 5  |-  ( B  e.  C  ->  dom  B  e.  _V )
6 ssexg 4137 . . . . 5  |-  ( ( dom  ( A  o.  B )  C_  dom  B  /\  dom  B  e. 
_V )  ->  dom  ( A  o.  B
)  e.  _V )
74, 5, 6sylancr 414 . . . 4  |-  ( B  e.  C  ->  dom  ( A  o.  B
)  e.  _V )
87adantl 277 . . 3  |-  ( ( Fun  A  /\  B  e.  C )  ->  dom  ( A  o.  B
)  e.  _V )
9 rnco 5127 . . . 4  |-  ran  ( A  o.  B )  =  ran  ( A  |`  ran  B )
10 rnexg 4885 . . . . . 6  |-  ( B  e.  C  ->  ran  B  e.  _V )
11 resfunexg 5729 . . . . . 6  |-  ( ( Fun  A  /\  ran  B  e.  _V )  -> 
( A  |`  ran  B
)  e.  _V )
1210, 11sylan2 286 . . . . 5  |-  ( ( Fun  A  /\  B  e.  C )  ->  ( A  |`  ran  B )  e.  _V )
13 rnexg 4885 . . . . 5  |-  ( ( A  |`  ran  B )  e.  _V  ->  ran  ( A  |`  ran  B
)  e.  _V )
1412, 13syl 14 . . . 4  |-  ( ( Fun  A  /\  B  e.  C )  ->  ran  ( A  |`  ran  B
)  e.  _V )
159, 14eqeltrid 2262 . . 3  |-  ( ( Fun  A  /\  B  e.  C )  ->  ran  ( A  o.  B
)  e.  _V )
16 xpexg 4734 . . 3  |-  ( ( dom  ( A  o.  B )  e.  _V  /\ 
ran  ( A  o.  B )  e.  _V )  ->  ( dom  ( A  o.  B )  X.  ran  ( A  o.  B ) )  e. 
_V )
178, 15, 16syl2anc 411 . 2  |-  ( ( Fun  A  /\  B  e.  C )  ->  ( dom  ( A  o.  B
)  X.  ran  ( A  o.  B )
)  e.  _V )
18 ssexg 4137 . 2  |-  ( ( ( A  o.  B
)  C_  ( dom  ( A  o.  B
)  X.  ran  ( A  o.  B )
)  /\  ( dom  ( A  o.  B
)  X.  ran  ( A  o.  B )
)  e.  _V )  ->  ( A  o.  B
)  e.  _V )
193, 17, 18sylancr 414 1  |-  ( ( Fun  A  /\  B  e.  C )  ->  ( A  o.  B )  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    e. wcel 2146   _Vcvv 2735    C_ wss 3127    X. cxp 4618   dom cdm 4620   ran crn 4621    |` cres 4622    o. ccom 4624   Rel wrel 4625   Fun wfun 5202
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 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-13 2148  ax-14 2149  ax-ext 2157  ax-coll 4113  ax-sep 4116  ax-pow 4169  ax-pr 4203  ax-un 4427
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1459  df-sb 1761  df-eu 2027  df-mo 2028  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-ral 2458  df-rex 2459  df-reu 2460  df-rab 2462  df-v 2737  df-sbc 2961  df-csb 3056  df-un 3131  df-in 3133  df-ss 3140  df-pw 3574  df-sn 3595  df-pr 3596  df-op 3598  df-uni 3806  df-iun 3884  df-br 3999  df-opab 4060  df-mpt 4061  df-id 4287  df-xp 4626  df-rel 4627  df-cnv 4628  df-co 4629  df-dm 4630  df-rn 4631  df-res 4632  df-ima 4633  df-iota 5170  df-fun 5210  df-fn 5211  df-f 5212  df-f1 5213  df-fo 5214  df-f1o 5215  df-fv 5216
This theorem is referenced by:  cofunex2g  6101  ctm  7098  ctssdclemr  7101
  Copyright terms: Public domain W3C validator