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

Theorem rnco 5269
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 2816 . . . . . 6  |-  x  e. 
_V
2 vex 2816 . . . . . 6  |-  y  e. 
_V
31, 2brco 4926 . . . . 5  |-  ( x ( A  o.  B
) y  <->  E. z
( x B z  /\  z A y ) )
43exbii 1654 . . . 4  |-  ( E. x  x ( A  o.  B ) y  <->  E. x E. z ( x B z  /\  z A y ) )
5 excom 1712 . . . 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 1952 . . . . . . 7  |-  ( E. x ( x B z  /\  z A y )  <->  ( E. x  x B z  /\  z A y ) )
8 vex 2816 . . . . . . . . 9  |-  z  e. 
_V
98elrn 5000 . . . . . . . 8  |-  ( z  e.  ran  B  <->  E. x  x B z )
109anbi2i 457 . . . . . . 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 5044 . . . . . 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 1654 . . . 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 5000 . . 3  |-  ( y  e.  ran  ( A  o.  B )  <->  E. x  x ( A  o.  B ) y )
172elrn 5000 . . 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 2229 1  |-  ran  ( A  o.  B )  =  ran  ( A  |`  ran  B )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1398   E.wex 1541    e. wcel 2203   class class class wbr 4109   ran crn 4750    |` cres 4751    o. ccom 4753
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2815  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-br 4110  df-opab 4172  df-xp 4755  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761
This theorem is referenced by:  rnco2  5270  cofunexg  6302  1stcof  6357  2ndcof  6358  djudom  7384
  Copyright terms: Public domain W3C validator