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

Theorem cofunexg 6342
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 5289 . . 3  |-  Rel  ( A  o.  B )
2 relssdmrn 5311 . . 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 5054 . . . . 5  |-  dom  ( A  o.  B )  C_ 
dom  B
5 dmexg 5048 . . . . 5  |-  ( B  e.  C  ->  dom  B  e.  _V )
6 ssexg 4274 . . . . 5  |-  ( ( dom  ( A  o.  B )  C_  dom  B  /\  dom  B  e. 
_V )  ->  dom  ( A  o.  B
)  e.  _V )
74, 5, 6sylancr 418 . . . 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 5297 . . . 4  |-  ran  ( A  o.  B )  =  ran  ( A  |`  ran  B )
10 rnexg 5049 . . . . . 6  |-  ( B  e.  C  ->  ran  B  e.  _V )
11 resfunexg 5939 . . . . . 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 5049 . . . . 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 2325 . . 3  |-  ( ( Fun  A  /\  B  e.  C )  ->  ran  ( A  o.  B
)  e.  _V )
16 xpexg 4891 . . 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 415 . 2  |-  ( ( Fun  A  /\  B  e.  C )  ->  ( dom  ( A  o.  B
)  X.  ran  ( A  o.  B )
)  e.  _V )
18 ssexg 4274 . 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 418 1  |-  ( ( Fun  A  /\  B  e.  C )  ->  ( A  o.  B )  e.  _V )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    e. wcel 2209   _Vcvv 2821    C_ wss 3220    X. cxp 4774   dom cdm 4776   ran crn 4777    |` cres 4778    o. ccom 4780   Rel wrel 4781   Fun wfun 5374
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388
This theorem is used by:  cofunex2g  6343  ctm  7455  ctssdclemr  7458  prdsex  14279  prdsval  14280  prdsbaslemss  14281
  Copyright terms: Public domain W3C validator