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

Theorem coexg 4912
Description: The composition of two sets is a set. (Contributed by NM, 19-Mar-1998.)
Assertion
Ref Expression
coexg  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( A  o.  B
)  e.  _V )

Proof of Theorem coexg
StepHypRef Expression
1 cossxp 4893 . 2  |-  ( A  o.  B )  C_  ( dom  B  X.  ran  A )
2 dmexg 4644 . . 3  |-  ( B  e.  W  ->  dom  B  e.  _V )
3 rnexg 4645 . . 3  |-  ( A  e.  V  ->  ran  A  e.  _V )
4 xpexg 4500 . . 3  |-  ( ( dom  B  e.  _V  /\ 
ran  A  e.  _V )  ->  ( dom  B  X.  ran  A )  e. 
_V )
52, 3, 4syl2anr 284 . 2  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( dom  B  X.  ran  A )  e.  _V )
6 ssexg 3937 . 2  |-  ( ( ( A  o.  B
)  C_  ( dom  B  X.  ran  A )  /\  ( dom  B  X.  ran  A )  e. 
_V )  ->  ( A  o.  B )  e.  _V )
71, 5, 6sylancr 405 1  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( A  o.  B
)  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    e. wcel 1434   _Vcvv 2610    C_ wss 2982    X. cxp 4389   dom cdm 4391   ran crn 4392    o. ccom 4395
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 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-13 1445  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2065  ax-sep 3916  ax-pow 3968  ax-pr 3992  ax-un 4216
This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-nf 1391  df-sb 1688  df-eu 1946  df-mo 1947  df-clab 2070  df-cleq 2076  df-clel 2079  df-nfc 2212  df-ral 2358  df-rex 2359  df-v 2612  df-un 2986  df-in 2988  df-ss 2995  df-pw 3402  df-sn 3422  df-pr 3423  df-op 3425  df-uni 3622  df-br 3806  df-opab 3860  df-xp 4397  df-rel 4398  df-cnv 4399  df-co 4400  df-dm 4401  df-rn 4402
This theorem is referenced by:  coex  4913
  Copyright terms: Public domain W3C validator