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

Theorem rnco 5294
Description: The range of the composition of two classes. (Contributed by NM, 12-Dec-2006.)
Assertion
Ref Expression
rnco  |-  ran  ( A  o.  B )  =  ran  ( A  |`  ran  B )

Proof of Theorem rnco
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 2824 . . . . . 6  |-  x  e. 
_V
2 vex 2824 . . . . . 6  |-  y  e. 
_V
31, 2brco 4951 . . . . 5  |-  ( x ( A  o.  B
) y  <->  E. z
( x B z  /\  z A y ) )
43exbii 1658 . . . 4  |-  ( E. x  x ( A  o.  B ) y  <->  E. x E. z ( x B z  /\  z A y ) )
5 excom 1716 . . . 4  |-  ( E. x E. z ( x B z  /\  z A y )  <->  E. z E. x ( x B z  /\  z A y ) )
6 ancom 266 . . . . . . 7  |-  ( ( E. x  x B z  /\  z A y )  <->  ( z A y  /\  E. x  x B z ) )
7 19.41v 1958 . . . . . . 7  |-  ( E. x ( x B z  /\  z A y )  <->  ( E. x  x B z  /\  z A y ) )
8 vex 2824 . . . . . . . . 9  |-  z  e. 
_V
98elrn 5025 . . . . . . . 8  |-  ( z  e.  ran  B  <->  E. x  x B z )
109anbi2i 461 . . . . . . 7  |-  ( ( z A y  /\  z  e.  ran  B )  <-> 
( z A y  /\  E. x  x B z ) )
116, 7, 103bitr4i 212 . . . . . 6  |-  ( E. x ( x B z  /\  z A y )  <->  ( z A y  /\  z  e.  ran  B ) )
122brres 5069 . . . . . 6  |-  ( z ( A  |`  ran  B
) y  <->  ( z A y  /\  z  e.  ran  B ) )
1311, 12bitr4i 187 . . . . 5  |-  ( E. x ( x B z  /\  z A y )  <->  z ( A  |`  ran  B ) y )
1413exbii 1658 . . . 4  |-  ( E. z E. x ( x B z  /\  z A y )  <->  E. z 
z ( A  |`  ran  B ) y )
154, 5, 143bitri 206 . . 3  |-  ( E. x  x ( A  o.  B ) y  <->  E. z  z ( A  |`  ran  B ) y )
162elrn 5025 . . 3  |-  ( y  e.  ran  ( A  o.  B )  <->  E. x  x ( A  o.  B ) y )
172elrn 5025 . . 3  |-  ( y  e.  ran  ( A  |`  ran  B )  <->  E. z 
z ( A  |`  ran  B ) y )
1815, 16, 173bitr4i 212 . 2  |-  ( y  e.  ran  ( A  o.  B )  <->  y  e.  ran  ( A  |`  ran  B
) )
1918eqriv 2235 1  |-  ran  ( A  o.  B )  =  ran  ( A  |`  ran  B )
Colors of variables:    wff set class
This proof depends on syntax axioms:    /\ wa 104    = wceq 1402   E.wex 1545    e. wcel 2209   class class class wbr 4130   ran crn 4775    |` cres 4776    o. ccom 4778
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-sep 4249  ax-pow 4311  ax-pr 4346
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-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-xp 4780  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786
This theorem is used by:  rnco2  5295  cofunexg  6338  1stcof  6397  2ndcof  6398  djudom  7433
  Copyright terms: Public domain W3C validator