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

Theorem dfco2 5504
Description: Alternate definition of a class composition, using only one bound variable. (Contributed by NM, 19-Dec-2008.)
Assertion
Ref Expression
dfco2  |-  ( A  o.  B )  = 
U_ x  e.  _V  ( ( `' B " { x } )  X.  ( A " { x } ) )
Distinct variable groups:    x, A    x, B

Proof of Theorem dfco2
Dummy variables  y 
z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relco 5503 . 2  |-  Rel  ( A  o.  B )
2 reliun 5121 . . 3  |-  ( Rel  U_ x  e.  _V  ( ( `' B " { x } )  X.  ( A " { x } ) )  <->  A. x  e.  _V  Rel  ( ( `' B " { x } )  X.  ( A " { x } ) ) )
3 relxp 5108 . . . 4  |-  Rel  (
( `' B " { x } )  X.  ( A " { x } ) )
43a1i 11 . . 3  |-  ( x  e.  _V  ->  Rel  ( ( `' B " { x } )  X.  ( A " { x } ) ) )
52, 4mprgbir 2828 . 2  |-  Rel  U_ x  e.  _V  ( ( `' B " { x } )  X.  ( A " { x }
) )
6 vex 3116 . . . 4  |-  y  e. 
_V
7 vex 3116 . . . 4  |-  z  e. 
_V
8 opelco2g 5168 . . . 4  |-  ( ( y  e.  _V  /\  z  e.  _V )  ->  ( <. y ,  z
>.  e.  ( A  o.  B )  <->  E. x
( <. y ,  x >.  e.  B  /\  <. x ,  z >.  e.  A
) ) )
96, 7, 8mp2an 672 . . 3  |-  ( <.
y ,  z >.  e.  ( A  o.  B
)  <->  E. x ( <.
y ,  x >.  e.  B  /\  <. x ,  z >.  e.  A
) )
10 eliun 4330 . . . 4  |-  ( <.
y ,  z >.  e.  U_ x  e.  _V  ( ( `' B " { x } )  X.  ( A " { x } ) )  <->  E. x  e.  _V  <.
y ,  z >.  e.  ( ( `' B " { x } )  X.  ( A " { x } ) ) )
11 rexv 3128 . . . 4  |-  ( E. x  e.  _V  <. y ,  z >.  e.  ( ( `' B " { x } )  X.  ( A " { x } ) )  <->  E. x <. y ,  z >.  e.  ( ( `' B " { x } )  X.  ( A " { x } ) ) )
12 opelxp 5028 . . . . . 6  |-  ( <.
y ,  z >.  e.  ( ( `' B " { x } )  X.  ( A " { x } ) )  <->  ( y  e.  ( `' B " { x } )  /\  z  e.  ( A " { x } ) ) )
13 vex 3116 . . . . . . . . 9  |-  x  e. 
_V
1413, 6elimasn 5360 . . . . . . . 8  |-  ( y  e.  ( `' B " { x } )  <->  <. x ,  y >.  e.  `' B )
1513, 6opelcnv 5182 . . . . . . . 8  |-  ( <.
x ,  y >.  e.  `' B  <->  <. y ,  x >.  e.  B )
1614, 15bitri 249 . . . . . . 7  |-  ( y  e.  ( `' B " { x } )  <->  <. y ,  x >.  e.  B )
1713, 7elimasn 5360 . . . . . . 7  |-  ( z  e.  ( A " { x } )  <->  <. x ,  z >.  e.  A )
1816, 17anbi12i 697 . . . . . 6  |-  ( ( y  e.  ( `' B " { x } )  /\  z  e.  ( A " {
x } ) )  <-> 
( <. y ,  x >.  e.  B  /\  <. x ,  z >.  e.  A
) )
1912, 18bitri 249 . . . . 5  |-  ( <.
y ,  z >.  e.  ( ( `' B " { x } )  X.  ( A " { x } ) )  <->  ( <. y ,  x >.  e.  B  /\  <. x ,  z
>.  e.  A ) )
2019exbii 1644 . . . 4  |-  ( E. x <. y ,  z
>.  e.  ( ( `' B " { x } )  X.  ( A " { x }
) )  <->  E. x
( <. y ,  x >.  e.  B  /\  <. x ,  z >.  e.  A
) )
2110, 11, 203bitrri 272 . . 3  |-  ( E. x ( <. y ,  x >.  e.  B  /\  <. x ,  z
>.  e.  A )  <->  <. y ,  z >.  e.  U_ x  e.  _V  ( ( `' B " { x } )  X.  ( A " { x }
) ) )
229, 21bitri 249 . 2  |-  ( <.
y ,  z >.  e.  ( A  o.  B
)  <->  <. y ,  z
>.  e.  U_ x  e. 
_V  ( ( `' B " { x } )  X.  ( A " { x }
) ) )
231, 5, 22eqrelriiv 5095 1  |-  ( A  o.  B )  = 
U_ x  e.  _V  ( ( `' B " { x } )  X.  ( A " { x } ) )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 184    /\ wa 369    = wceq 1379   E.wex 1596    e. wcel 1767   E.wrex 2815   _Vcvv 3113   {csn 4027   <.cop 4033   U_ciun 4325    X. cxp 4997   `'ccnv 4998   "cima 5002    o. ccom 5003   Rel wrel 5004
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-9 1771  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-sep 4568  ax-nul 4576  ax-pr 4686
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-eu 2279  df-mo 2280  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-ral 2819  df-rex 2820  df-rab 2823  df-v 3115  df-sbc 3332  df-dif 3479  df-un 3481  df-in 3483  df-ss 3490  df-nul 3786  df-if 3940  df-sn 4028  df-pr 4030  df-op 4034  df-iun 4327  df-br 4448  df-opab 4506  df-xp 5005  df-rel 5006  df-cnv 5007  df-co 5008  df-dm 5009  df-rn 5010  df-res 5011  df-ima 5012
This theorem is referenced by:  dfco2a  5505
  Copyright terms: Public domain W3C validator