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

Theorem dfco2a 5202
Description: Generalization of dfco2 5201, where  C can have any value between  dom  A  i^i  ran 
B and  _V. (Contributed by NM, 21-Dec-2008.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
Assertion
Ref Expression
dfco2a  |-  ( ( dom  A  i^i  ran  B )  C_  C  ->  ( A  o.  B )  =  U_ x  e.  C  ( ( `' B " { x } )  X.  ( A " { x }
) ) )
Distinct variable groups:    x, A    x, B    x, C

Proof of Theorem dfco2a
Dummy variables  w  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dfco2 5201 . 2  |-  ( A  o.  B )  = 
U_ x  e.  _V  ( ( `' B " { x } )  X.  ( A " { x } ) )
2 vex 2779 . . . . . . . . . . . . . 14  |-  x  e. 
_V
3 vex 2779 . . . . . . . . . . . . . . 15  |-  z  e. 
_V
43eliniseg 5071 . . . . . . . . . . . . . 14  |-  ( x  e.  _V  ->  (
z  e.  ( `' B " { x } )  <->  z B x ) )
52, 4ax-mp 5 . . . . . . . . . . . . 13  |-  ( z  e.  ( `' B " { x } )  <-> 
z B x )
63, 2brelrn 4930 . . . . . . . . . . . . 13  |-  ( z B x  ->  x  e.  ran  B )
75, 6sylbi 121 . . . . . . . . . . . 12  |-  ( z  e.  ( `' B " { x } )  ->  x  e.  ran  B )
8 vex 2779 . . . . . . . . . . . . . 14  |-  w  e. 
_V
92, 8elimasn 5068 . . . . . . . . . . . . 13  |-  ( w  e.  ( A " { x } )  <->  <. x ,  w >.  e.  A )
102, 8opeldm 4900 . . . . . . . . . . . . 13  |-  ( <.
x ,  w >.  e.  A  ->  x  e.  dom  A )
119, 10sylbi 121 . . . . . . . . . . . 12  |-  ( w  e.  ( A " { x } )  ->  x  e.  dom  A )
127, 11anim12ci 339 . . . . . . . . . . 11  |-  ( ( z  e.  ( `' B " { x } )  /\  w  e.  ( A " {
x } ) )  ->  ( x  e. 
dom  A  /\  x  e.  ran  B ) )
1312adantl 277 . . . . . . . . . 10  |-  ( ( y  =  <. z ,  w >.  /\  (
z  e.  ( `' B " { x } )  /\  w  e.  ( A " {
x } ) ) )  ->  ( x  e.  dom  A  /\  x  e.  ran  B ) )
1413exlimivv 1921 . . . . . . . . 9  |-  ( E. z E. w ( y  =  <. z ,  w >.  /\  (
z  e.  ( `' B " { x } )  /\  w  e.  ( A " {
x } ) ) )  ->  ( x  e.  dom  A  /\  x  e.  ran  B ) )
15 elxp 4710 . . . . . . . . 9  |-  ( y  e.  ( ( `' B " { x } )  X.  ( A " { x }
) )  <->  E. z E. w ( y  = 
<. z ,  w >.  /\  ( z  e.  ( `' B " { x } )  /\  w  e.  ( A " {
x } ) ) ) )
16 elin 3364 . . . . . . . . 9  |-  ( x  e.  ( dom  A  i^i  ran  B )  <->  ( x  e.  dom  A  /\  x  e.  ran  B ) )
1714, 15, 163imtr4i 201 . . . . . . . 8  |-  ( y  e.  ( ( `' B " { x } )  X.  ( A " { x }
) )  ->  x  e.  ( dom  A  i^i  ran 
B ) )
18 ssel 3195 . . . . . . . 8  |-  ( ( dom  A  i^i  ran  B )  C_  C  ->  ( x  e.  ( dom 
A  i^i  ran  B )  ->  x  e.  C
) )
1917, 18syl5 32 . . . . . . 7  |-  ( ( dom  A  i^i  ran  B )  C_  C  ->  ( y  e.  ( ( `' B " { x } )  X.  ( A " { x }
) )  ->  x  e.  C ) )
2019pm4.71rd 394 . . . . . 6  |-  ( ( dom  A  i^i  ran  B )  C_  C  ->  ( y  e.  ( ( `' B " { x } )  X.  ( A " { x }
) )  <->  ( x  e.  C  /\  y  e.  ( ( `' B " { x } )  X.  ( A " { x } ) ) ) ) )
2120exbidv 1849 . . . . 5  |-  ( ( dom  A  i^i  ran  B )  C_  C  ->  ( E. x  y  e.  ( ( `' B " { x } )  X.  ( A " { x } ) )  <->  E. x ( x  e.  C  /\  y  e.  ( ( `' B " { x } )  X.  ( A " { x } ) ) ) ) )
22 rexv 2795 . . . . 5  |-  ( E. x  e.  _V  y  e.  ( ( `' B " { x } )  X.  ( A " { x } ) )  <->  E. x  y  e.  ( ( `' B " { x } )  X.  ( A " { x } ) ) )
23 df-rex 2492 . . . . 5  |-  ( E. x  e.  C  y  e.  ( ( `' B " { x } )  X.  ( A " { x }
) )  <->  E. x
( x  e.  C  /\  y  e.  (
( `' B " { x } )  X.  ( A " { x } ) ) ) )
2421, 22, 233bitr4g 223 . . . 4  |-  ( ( dom  A  i^i  ran  B )  C_  C  ->  ( E. x  e.  _V  y  e.  ( ( `' B " { x } )  X.  ( A " { x }
) )  <->  E. x  e.  C  y  e.  ( ( `' B " { x } )  X.  ( A " { x } ) ) ) )
25 eliun 3945 . . . 4  |-  ( y  e.  U_ x  e. 
_V  ( ( `' B " { x } )  X.  ( A " { x }
) )  <->  E. x  e.  _V  y  e.  ( ( `' B " { x } )  X.  ( A " { x } ) ) )
26 eliun 3945 . . . 4  |-  ( y  e.  U_ x  e.  C  ( ( `' B " { x } )  X.  ( A " { x }
) )  <->  E. x  e.  C  y  e.  ( ( `' B " { x } )  X.  ( A " { x } ) ) )
2724, 25, 263bitr4g 223 . . 3  |-  ( ( dom  A  i^i  ran  B )  C_  C  ->  ( y  e.  U_ x  e.  _V  ( ( `' B " { x } )  X.  ( A " { x }
) )  <->  y  e.  U_ x  e.  C  ( ( `' B " { x } )  X.  ( A " { x } ) ) ) )
2827eqrdv 2205 . 2  |-  ( ( dom  A  i^i  ran  B )  C_  C  ->  U_ x  e.  _V  (
( `' B " { x } )  X.  ( A " { x } ) )  =  U_ x  e.  C  ( ( `' B " { x } )  X.  ( A " { x }
) ) )
291, 28eqtrid 2252 1  |-  ( ( dom  A  i^i  ran  B )  C_  C  ->  ( A  o.  B )  =  U_ x  e.  C  ( ( `' B " { x } )  X.  ( A " { x }
) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1373   E.wex 1516    e. wcel 2178   E.wrex 2487   _Vcvv 2776    i^i cin 3173    C_ wss 3174   {csn 3643   <.cop 3646   U_ciun 3941   class class class wbr 4059    X. cxp 4691   `'ccnv 4692   dom cdm 4693   ran crn 4694   "cima 4696    o. ccom 4697
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-v 2778  df-sbc 3006  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-iun 3943  df-br 4060  df-opab 4122  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator