MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cores Structured version   Visualization version   Unicode version

Theorem cores 5638
Description: Restricted first member of a class composition. (Contributed by NM, 12-Oct-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
Assertion
Ref Expression
cores  |-  ( ran 
B  C_  C  ->  ( ( A  |`  C )  o.  B )  =  ( A  o.  B
) )

Proof of Theorem cores
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 3203 . . . . . . 7  |-  z  e. 
_V
2 vex 3203 . . . . . . 7  |-  y  e. 
_V
31, 2brelrn 5356 . . . . . 6  |-  ( z B y  ->  y  e.  ran  B )
4 ssel 3597 . . . . . 6  |-  ( ran 
B  C_  C  ->  ( y  e.  ran  B  ->  y  e.  C ) )
5 vex 3203 . . . . . . . 8  |-  x  e. 
_V
65brres 5402 . . . . . . 7  |-  ( y ( A  |`  C ) x  <->  ( y A x  /\  y  e.  C ) )
76rbaib 947 . . . . . 6  |-  ( y  e.  C  ->  (
y ( A  |`  C ) x  <->  y A x ) )
83, 4, 7syl56 36 . . . . 5  |-  ( ran 
B  C_  C  ->  ( z B y  -> 
( y ( A  |`  C ) x  <->  y A x ) ) )
98pm5.32d 671 . . . 4  |-  ( ran 
B  C_  C  ->  ( ( z B y  /\  y ( A  |`  C ) x )  <-> 
( z B y  /\  y A x ) ) )
109exbidv 1850 . . 3  |-  ( ran 
B  C_  C  ->  ( E. y ( z B y  /\  y
( A  |`  C ) x )  <->  E. y
( z B y  /\  y A x ) ) )
1110opabbidv 4716 . 2  |-  ( ran 
B  C_  C  ->  {
<. z ,  x >.  |  E. y ( z B y  /\  y
( A  |`  C ) x ) }  =  { <. z ,  x >.  |  E. y ( z B y  /\  y A x ) } )
12 df-co 5123 . 2  |-  ( ( A  |`  C )  o.  B )  =  { <. z ,  x >.  |  E. y ( z B y  /\  y
( A  |`  C ) x ) }
13 df-co 5123 . 2  |-  ( A  o.  B )  =  { <. z ,  x >.  |  E. y ( z B y  /\  y A x ) }
1411, 12, 133eqtr4g 2681 1  |-  ( ran 
B  C_  C  ->  ( ( A  |`  C )  o.  B )  =  ( A  o.  B
) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    /\ wa 384    = wceq 1483   E.wex 1704    e. wcel 1990    C_ wss 3574   class class class wbr 4653   {copab 4712   ran crn 5115    |` cres 5116    o. ccom 5118
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713  df-xp 5120  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126
This theorem is referenced by:  cocnvcnv1  5646  cores2  5648  relcoi2  5663  fco2  6059  fcoi2  6079  domss2  8119  canthp1lem2  9475  imasdsval2  16176  frmdss2  17400  gsumval3lem1  18306  gsumzres  18310  gsumzaddlem  18321  dprdf1  18432  kgencn2  21360  tsmsf1o  21948  lgamcvg2  24781  hhssims  28132  eulerpartgbij  30434  cvmlift2lem9a  31285  poimirlem9  33418  fourierdlem53  40376  funresfunco  41205
  Copyright terms: Public domain W3C validator