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

Theorem fsumcnv 11378
Description: Transform a region of summation by using the converse operation. (Contributed by Mario Carneiro, 23-Apr-2014.)
Hypotheses
Ref Expression
fsumcnv.1  |-  ( x  =  <. j ,  k
>.  ->  B  =  D )
fsumcnv.2  |-  ( y  =  <. k ,  j
>.  ->  C  =  D )
fsumcnv.3  |-  ( ph  ->  A  e.  Fin )
fsumcnv.4  |-  ( ph  ->  Rel  A )
fsumcnv.5  |-  ( (
ph  /\  x  e.  A )  ->  B  e.  CC )
Assertion
Ref Expression
fsumcnv  |-  ( ph  -> 
sum_ x  e.  A  B  =  sum_ y  e.  `'  A C )
Distinct variable groups:    x, y, A   
j, k, y, B   
x, j, C, k    ph, x, y    x, D, y
Allowed substitution hints:    ph( j, k)    A( j, k)    B( x)    C( y)    D( j, k)

Proof of Theorem fsumcnv
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 csbeq1a 3054 . . . 4  |-  ( x  =  <. ( 2nd `  y
) ,  ( 1st `  y ) >.  ->  B  =  [_ <. ( 2nd `  y
) ,  ( 1st `  y ) >.  /  x ]_ B )
2 2ndexg 6136 . . . . . 6  |-  ( y  e.  _V  ->  ( 2nd `  y )  e. 
_V )
32elv 2730 . . . . 5  |-  ( 2nd `  y )  e.  _V
4 1stexg 6135 . . . . . 6  |-  ( y  e.  _V  ->  ( 1st `  y )  e. 
_V )
54elv 2730 . . . . 5  |-  ( 1st `  y )  e.  _V
6 vex 2729 . . . . . . . 8  |-  j  e. 
_V
7 vex 2729 . . . . . . . 8  |-  k  e. 
_V
86, 7opex 4207 . . . . . . 7  |-  <. j ,  k >.  e.  _V
9 fsumcnv.1 . . . . . . 7  |-  ( x  =  <. j ,  k
>.  ->  B  =  D )
108, 9csbie 3090 . . . . . 6  |-  [_ <. j ,  k >.  /  x ]_ B  =  D
11 opeq12 3760 . . . . . . 7  |-  ( ( j  =  ( 2nd `  y )  /\  k  =  ( 1st `  y
) )  ->  <. j ,  k >.  =  <. ( 2nd `  y ) ,  ( 1st `  y
) >. )
1211csbeq1d 3052 . . . . . 6  |-  ( ( j  =  ( 2nd `  y )  /\  k  =  ( 1st `  y
) )  ->  [_ <. j ,  k >.  /  x ]_ B  =  [_ <. ( 2nd `  y ) ,  ( 1st `  y
) >.  /  x ]_ B )
1310, 12eqtr3id 2213 . . . . 5  |-  ( ( j  =  ( 2nd `  y )  /\  k  =  ( 1st `  y
) )  ->  D  =  [_ <. ( 2nd `  y
) ,  ( 1st `  y ) >.  /  x ]_ B )
143, 5, 13csbie2 3094 . . . 4  |-  [_ ( 2nd `  y )  / 
j ]_ [_ ( 1st `  y )  /  k ]_ D  =  [_ <. ( 2nd `  y ) ,  ( 1st `  y
) >.  /  x ]_ B
151, 14eqtr4di 2217 . . 3  |-  ( x  =  <. ( 2nd `  y
) ,  ( 1st `  y ) >.  ->  B  =  [_ ( 2nd `  y
)  /  j ]_ [_ ( 1st `  y
)  /  k ]_ D )
16 fsumcnv.4 . . . 4  |-  ( ph  ->  Rel  A )
17 fsumcnv.3 . . . 4  |-  ( ph  ->  A  e.  Fin )
18 relcnvfi 6906 . . . 4  |-  ( ( Rel  A  /\  A  e.  Fin )  ->  `' A  e.  Fin )
1916, 17, 18syl2anc 409 . . 3  |-  ( ph  ->  `' A  e.  Fin )
20 relcnv 4982 . . . . 5  |-  Rel  `' A
21 cnvf1o 6193 . . . . 5  |-  ( Rel  `' A  ->  ( z  e.  `' A  |->  U. `' { z } ) : `' A -1-1-onto-> `' `' A )
2220, 21ax-mp 5 . . . 4  |-  ( z  e.  `' A  |->  U. `' { z } ) : `' A -1-1-onto-> `' `' A
23 dfrel2 5054 . . . . . 6  |-  ( Rel 
A  <->  `' `' A  =  A
)
2416, 23sylib 121 . . . . 5  |-  ( ph  ->  `' `' A  =  A
)
25 f1oeq3 5423 . . . . 5  |-  ( `' `' A  =  A  ->  ( ( z  e.  `' A  |->  U. `' { z } ) : `' A -1-1-onto-> `' `' A 
<->  ( z  e.  `' A  |->  U. `' { z } ) : `' A
-1-1-onto-> A ) )
2624, 25syl 14 . . . 4  |-  ( ph  ->  ( ( z  e.  `' A  |->  U. `' { z } ) : `' A -1-1-onto-> `' `' A 
<->  ( z  e.  `' A  |->  U. `' { z } ) : `' A
-1-1-onto-> A ) )
2722, 26mpbii 147 . . 3  |-  ( ph  ->  ( z  e.  `' A  |->  U. `' { z } ) : `' A
-1-1-onto-> A )
28 1st2nd 6149 . . . . . . 7  |-  ( ( Rel  `' A  /\  y  e.  `' A
)  ->  y  =  <. ( 1st `  y
) ,  ( 2nd `  y ) >. )
2920, 28mpan 421 . . . . . 6  |-  ( y  e.  `' A  -> 
y  =  <. ( 1st `  y ) ,  ( 2nd `  y
) >. )
3029fveq2d 5490 . . . . 5  |-  ( y  e.  `' A  -> 
( ( z  e.  `' A  |->  U. `' { z } ) `
 y )  =  ( ( z  e.  `' A  |->  U. `' { z } ) `
 <. ( 1st `  y
) ,  ( 2nd `  y ) >. )
)
31 id 19 . . . . . . 7  |-  ( y  e.  `' A  -> 
y  e.  `' A
)
3229, 31eqeltrrd 2244 . . . . . 6  |-  ( y  e.  `' A  ->  <. ( 1st `  y
) ,  ( 2nd `  y ) >.  e.  `' A )
33 sneq 3587 . . . . . . . . . 10  |-  ( z  =  <. ( 1st `  y
) ,  ( 2nd `  y ) >.  ->  { z }  =  { <. ( 1st `  y ) ,  ( 2nd `  y
) >. } )
3433cnveqd 4780 . . . . . . . . 9  |-  ( z  =  <. ( 1st `  y
) ,  ( 2nd `  y ) >.  ->  `' { z }  =  `' { <. ( 1st `  y
) ,  ( 2nd `  y ) >. } )
3534unieqd 3800 . . . . . . . 8  |-  ( z  =  <. ( 1st `  y
) ,  ( 2nd `  y ) >.  ->  U. `' { z }  =  U. `' { <. ( 1st `  y
) ,  ( 2nd `  y ) >. } )
36 opswapg 5090 . . . . . . . . 9  |-  ( ( ( 1st `  y
)  e.  _V  /\  ( 2nd `  y )  e.  _V )  ->  U. `' { <. ( 1st `  y
) ,  ( 2nd `  y ) >. }  =  <. ( 2nd `  y
) ,  ( 1st `  y ) >. )
375, 3, 36mp2an 423 . . . . . . . 8  |-  U. `' { <. ( 1st `  y
) ,  ( 2nd `  y ) >. }  =  <. ( 2nd `  y
) ,  ( 1st `  y ) >.
3835, 37eqtrdi 2215 . . . . . . 7  |-  ( z  =  <. ( 1st `  y
) ,  ( 2nd `  y ) >.  ->  U. `' { z }  =  <. ( 2nd `  y
) ,  ( 1st `  y ) >. )
39 eqid 2165 . . . . . . 7  |-  ( z  e.  `' A  |->  U. `' { z } )  =  ( z  e.  `' A  |->  U. `' { z } )
403, 5opex 4207 . . . . . . 7  |-  <. ( 2nd `  y ) ,  ( 1st `  y
) >.  e.  _V
4138, 39, 40fvmpt 5563 . . . . . 6  |-  ( <.
( 1st `  y
) ,  ( 2nd `  y ) >.  e.  `' A  ->  ( ( z  e.  `' A  |->  U. `' { z } ) `
 <. ( 1st `  y
) ,  ( 2nd `  y ) >. )  =  <. ( 2nd `  y
) ,  ( 1st `  y ) >. )
4232, 41syl 14 . . . . 5  |-  ( y  e.  `' A  -> 
( ( z  e.  `' A  |->  U. `' { z } ) `
 <. ( 1st `  y
) ,  ( 2nd `  y ) >. )  =  <. ( 2nd `  y
) ,  ( 1st `  y ) >. )
4330, 42eqtrd 2198 . . . 4  |-  ( y  e.  `' A  -> 
( ( z  e.  `' A  |->  U. `' { z } ) `
 y )  = 
<. ( 2nd `  y
) ,  ( 1st `  y ) >. )
4443adantl 275 . . 3  |-  ( (
ph  /\  y  e.  `' A )  ->  (
( z  e.  `' A  |->  U. `' { z } ) `  y
)  =  <. ( 2nd `  y ) ,  ( 1st `  y
) >. )
45 fsumcnv.5 . . 3  |-  ( (
ph  /\  x  e.  A )  ->  B  e.  CC )
4615, 19, 27, 44, 45fsumf1o 11331 . 2  |-  ( ph  -> 
sum_ x  e.  A  B  =  sum_ y  e.  `'  A [_ ( 2nd `  y )  /  j ]_ [_ ( 1st `  y
)  /  k ]_ D )
47 csbeq1a 3054 . . . . 5  |-  ( y  =  <. ( 1st `  y
) ,  ( 2nd `  y ) >.  ->  C  =  [_ <. ( 1st `  y
) ,  ( 2nd `  y ) >.  /  y ]_ C )
4829, 47syl 14 . . . 4  |-  ( y  e.  `' A  ->  C  =  [_ <. ( 1st `  y ) ,  ( 2nd `  y
) >.  /  y ]_ C )
497, 6opex 4207 . . . . . . 7  |-  <. k ,  j >.  e.  _V
50 fsumcnv.2 . . . . . . 7  |-  ( y  =  <. k ,  j
>.  ->  C  =  D )
5149, 50csbie 3090 . . . . . 6  |-  [_ <. k ,  j >.  /  y ]_ C  =  D
52 opeq12 3760 . . . . . . . 8  |-  ( ( k  =  ( 1st `  y )  /\  j  =  ( 2nd `  y
) )  ->  <. k ,  j >.  =  <. ( 1st `  y ) ,  ( 2nd `  y
) >. )
5352ancoms 266 . . . . . . 7  |-  ( ( j  =  ( 2nd `  y )  /\  k  =  ( 1st `  y
) )  ->  <. k ,  j >.  =  <. ( 1st `  y ) ,  ( 2nd `  y
) >. )
5453csbeq1d 3052 . . . . . 6  |-  ( ( j  =  ( 2nd `  y )  /\  k  =  ( 1st `  y
) )  ->  [_ <. k ,  j >.  /  y ]_ C  =  [_ <. ( 1st `  y ) ,  ( 2nd `  y
) >.  /  y ]_ C )
5551, 54eqtr3id 2213 . . . . 5  |-  ( ( j  =  ( 2nd `  y )  /\  k  =  ( 1st `  y
) )  ->  D  =  [_ <. ( 1st `  y
) ,  ( 2nd `  y ) >.  /  y ]_ C )
563, 5, 55csbie2 3094 . . . 4  |-  [_ ( 2nd `  y )  / 
j ]_ [_ ( 1st `  y )  /  k ]_ D  =  [_ <. ( 1st `  y ) ,  ( 2nd `  y
) >.  /  y ]_ C
5748, 56eqtr4di 2217 . . 3  |-  ( y  e.  `' A  ->  C  =  [_ ( 2nd `  y )  /  j ]_ [_ ( 1st `  y
)  /  k ]_ D )
5857sumeq2i 11305 . 2  |-  sum_ y  e.  `'  A C  =  sum_ y  e.  `'  A [_ ( 2nd `  y
)  /  j ]_ [_ ( 1st `  y
)  /  k ]_ D
5946, 58eqtr4di 2217 1  |-  ( ph  -> 
sum_ x  e.  A  B  =  sum_ y  e.  `'  A C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1343    e. wcel 2136   _Vcvv 2726   [_csb 3045   {csn 3576   <.cop 3579   U.cuni 3789    |-> cmpt 4043   `'ccnv 4603   Rel wrel 4609   -1-1-onto->wf1o 5187   ` cfv 5188   1stc1st 6106   2ndc2nd 6107   Fincfn 6706   CCcc 7751   sum_csu 11294
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-coll 4097  ax-sep 4100  ax-nul 4108  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-iinf 4565  ax-cnex 7844  ax-resscn 7845  ax-1cn 7846  ax-1re 7847  ax-icn 7848  ax-addcl 7849  ax-addrcl 7850  ax-mulcl 7851  ax-mulrcl 7852  ax-addcom 7853  ax-mulcom 7854  ax-addass 7855  ax-mulass 7856  ax-distr 7857  ax-i2m1 7858  ax-0lt1 7859  ax-1rid 7860  ax-0id 7861  ax-rnegex 7862  ax-precex 7863  ax-cnre 7864  ax-pre-ltirr 7865  ax-pre-ltwlin 7866  ax-pre-lttrn 7867  ax-pre-apti 7868  ax-pre-ltadd 7869  ax-pre-mulgt0 7870  ax-pre-mulext 7871  ax-arch 7872  ax-caucvg 7873
This theorem depends on definitions:  df-bi 116  df-dc 825  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-nel 2432  df-ral 2449  df-rex 2450  df-reu 2451  df-rmo 2452  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-if 3521  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-int 3825  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-tr 4081  df-id 4271  df-po 4274  df-iso 4275  df-iord 4344  df-on 4346  df-ilim 4347  df-suc 4349  df-iom 4568  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fo 5194  df-f1o 5195  df-fv 5196  df-isom 5197  df-riota 5798  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-recs 6273  df-irdg 6338  df-frec 6359  df-1o 6384  df-oadd 6388  df-er 6501  df-en 6707  df-dom 6708  df-fin 6709  df-pnf 7935  df-mnf 7936  df-xr 7937  df-ltxr 7938  df-le 7939  df-sub 8071  df-neg 8072  df-reap 8473  df-ap 8480  df-div 8569  df-inn 8858  df-2 8916  df-3 8917  df-4 8918  df-n0 9115  df-z 9192  df-uz 9467  df-q 9558  df-rp 9590  df-fz 9945  df-fzo 10078  df-seqfrec 10381  df-exp 10455  df-ihash 10689  df-cj 10784  df-re 10785  df-im 10786  df-rsqrt 10940  df-abs 10941  df-clim 11220  df-sumdc 11295
This theorem is referenced by:  fisumcom2  11379
  Copyright terms: Public domain W3C validator