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

Theorem fsumcnv 11400
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 3058 . . . 4  |-  ( x  =  <. ( 2nd `  y
) ,  ( 1st `  y ) >.  ->  B  =  [_ <. ( 2nd `  y
) ,  ( 1st `  y ) >.  /  x ]_ B )
2 2ndexg 6147 . . . . . 6  |-  ( y  e.  _V  ->  ( 2nd `  y )  e. 
_V )
32elv 2734 . . . . 5  |-  ( 2nd `  y )  e.  _V
4 1stexg 6146 . . . . . 6  |-  ( y  e.  _V  ->  ( 1st `  y )  e. 
_V )
54elv 2734 . . . . 5  |-  ( 1st `  y )  e.  _V
6 vex 2733 . . . . . . . 8  |-  j  e. 
_V
7 vex 2733 . . . . . . . 8  |-  k  e. 
_V
86, 7opex 4214 . . . . . . 7  |-  <. j ,  k >.  e.  _V
9 fsumcnv.1 . . . . . . 7  |-  ( x  =  <. j ,  k
>.  ->  B  =  D )
108, 9csbie 3094 . . . . . 6  |-  [_ <. j ,  k >.  /  x ]_ B  =  D
11 opeq12 3767 . . . . . . 7  |-  ( ( j  =  ( 2nd `  y )  /\  k  =  ( 1st `  y
) )  ->  <. j ,  k >.  =  <. ( 2nd `  y ) ,  ( 1st `  y
) >. )
1211csbeq1d 3056 . . . . . 6  |-  ( ( j  =  ( 2nd `  y )  /\  k  =  ( 1st `  y
) )  ->  [_ <. j ,  k >.  /  x ]_ B  =  [_ <. ( 2nd `  y ) ,  ( 1st `  y
) >.  /  x ]_ B )
1310, 12eqtr3id 2217 . . . . 5  |-  ( ( j  =  ( 2nd `  y )  /\  k  =  ( 1st `  y
) )  ->  D  =  [_ <. ( 2nd `  y
) ,  ( 1st `  y ) >.  /  x ]_ B )
143, 5, 13csbie2 3098 . . . 4  |-  [_ ( 2nd `  y )  / 
j ]_ [_ ( 1st `  y )  /  k ]_ D  =  [_ <. ( 2nd `  y ) ,  ( 1st `  y
) >.  /  x ]_ B
151, 14eqtr4di 2221 . . 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 6918 . . . 4  |-  ( ( Rel  A  /\  A  e.  Fin )  ->  `' A  e.  Fin )
1916, 17, 18syl2anc 409 . . 3  |-  ( ph  ->  `' A  e.  Fin )
20 relcnv 4989 . . . . 5  |-  Rel  `' A
21 cnvf1o 6204 . . . . 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 5061 . . . . . 6  |-  ( Rel 
A  <->  `' `' A  =  A
)
2416, 23sylib 121 . . . . 5  |-  ( ph  ->  `' `' A  =  A
)
25 f1oeq3 5433 . . . . 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 6160 . . . . . . 7  |-  ( ( Rel  `' A  /\  y  e.  `' A
)  ->  y  =  <. ( 1st `  y
) ,  ( 2nd `  y ) >. )
2920, 28mpan 422 . . . . . 6  |-  ( y  e.  `' A  -> 
y  =  <. ( 1st `  y ) ,  ( 2nd `  y
) >. )
3029fveq2d 5500 . . . . 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 2248 . . . . . 6  |-  ( y  e.  `' A  ->  <. ( 1st `  y
) ,  ( 2nd `  y ) >.  e.  `' A )
33 sneq 3594 . . . . . . . . . 10  |-  ( z  =  <. ( 1st `  y
) ,  ( 2nd `  y ) >.  ->  { z }  =  { <. ( 1st `  y ) ,  ( 2nd `  y
) >. } )
3433cnveqd 4787 . . . . . . . . 9  |-  ( z  =  <. ( 1st `  y
) ,  ( 2nd `  y ) >.  ->  `' { z }  =  `' { <. ( 1st `  y
) ,  ( 2nd `  y ) >. } )
3534unieqd 3807 . . . . . . . 8  |-  ( z  =  <. ( 1st `  y
) ,  ( 2nd `  y ) >.  ->  U. `' { z }  =  U. `' { <. ( 1st `  y
) ,  ( 2nd `  y ) >. } )
36 opswapg 5097 . . . . . . . . 9  |-  ( ( ( 1st `  y
)  e.  _V  /\  ( 2nd `  y )  e.  _V )  ->  U. `' { <. ( 1st `  y
) ,  ( 2nd `  y ) >. }  =  <. ( 2nd `  y
) ,  ( 1st `  y ) >. )
375, 3, 36mp2an 424 . . . . . . . 8  |-  U. `' { <. ( 1st `  y
) ,  ( 2nd `  y ) >. }  =  <. ( 2nd `  y
) ,  ( 1st `  y ) >.
3835, 37eqtrdi 2219 . . . . . . 7  |-  ( z  =  <. ( 1st `  y
) ,  ( 2nd `  y ) >.  ->  U. `' { z }  =  <. ( 2nd `  y
) ,  ( 1st `  y ) >. )
39 eqid 2170 . . . . . . 7  |-  ( z  e.  `' A  |->  U. `' { z } )  =  ( z  e.  `' A  |->  U. `' { z } )
403, 5opex 4214 . . . . . . 7  |-  <. ( 2nd `  y ) ,  ( 1st `  y
) >.  e.  _V
4138, 39, 40fvmpt 5573 . . . . . 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 2203 . . . 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 11353 . 2  |-  ( ph  -> 
sum_ x  e.  A  B  =  sum_ y  e.  `'  A [_ ( 2nd `  y )  /  j ]_ [_ ( 1st `  y
)  /  k ]_ D )
47 csbeq1a 3058 . . . . 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 4214 . . . . . . 7  |-  <. k ,  j >.  e.  _V
50 fsumcnv.2 . . . . . . 7  |-  ( y  =  <. k ,  j
>.  ->  C  =  D )
5149, 50csbie 3094 . . . . . 6  |-  [_ <. k ,  j >.  /  y ]_ C  =  D
52 opeq12 3767 . . . . . . . 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 3056 . . . . . 6  |-  ( ( j  =  ( 2nd `  y )  /\  k  =  ( 1st `  y
) )  ->  [_ <. k ,  j >.  /  y ]_ C  =  [_ <. ( 1st `  y ) ,  ( 2nd `  y
) >.  /  y ]_ C )
5551, 54eqtr3id 2217 . . . . 5  |-  ( ( j  =  ( 2nd `  y )  /\  k  =  ( 1st `  y
) )  ->  D  =  [_ <. ( 1st `  y
) ,  ( 2nd `  y ) >.  /  y ]_ C )
563, 5, 55csbie2 3098 . . . 4  |-  [_ ( 2nd `  y )  / 
j ]_ [_ ( 1st `  y )  /  k ]_ D  =  [_ <. ( 1st `  y ) ,  ( 2nd `  y
) >.  /  y ]_ C
5748, 56eqtr4di 2221 . . 3  |-  ( y  e.  `' A  ->  C  =  [_ ( 2nd `  y )  /  j ]_ [_ ( 1st `  y
)  /  k ]_ D )
5857sumeq2i 11327 . 2  |-  sum_ y  e.  `'  A C  =  sum_ y  e.  `'  A [_ ( 2nd `  y
)  /  j ]_ [_ ( 1st `  y
)  /  k ]_ D
5946, 58eqtr4di 2221 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 1348    e. wcel 2141   _Vcvv 2730   [_csb 3049   {csn 3583   <.cop 3586   U.cuni 3796    |-> cmpt 4050   `'ccnv 4610   Rel wrel 4616   -1-1-onto->wf1o 5197   ` cfv 5198   1stc1st 6117   2ndc2nd 6118   Fincfn 6718   CCcc 7772   sum_csu 11316
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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4104  ax-sep 4107  ax-nul 4115  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-iinf 4572  ax-cnex 7865  ax-resscn 7866  ax-1cn 7867  ax-1re 7868  ax-icn 7869  ax-addcl 7870  ax-addrcl 7871  ax-mulcl 7872  ax-mulrcl 7873  ax-addcom 7874  ax-mulcom 7875  ax-addass 7876  ax-mulass 7877  ax-distr 7878  ax-i2m1 7879  ax-0lt1 7880  ax-1rid 7881  ax-0id 7882  ax-rnegex 7883  ax-precex 7884  ax-cnre 7885  ax-pre-ltirr 7886  ax-pre-ltwlin 7887  ax-pre-lttrn 7888  ax-pre-apti 7889  ax-pre-ltadd 7890  ax-pre-mulgt0 7891  ax-pre-mulext 7892  ax-arch 7893  ax-caucvg 7894
This theorem depends on definitions:  df-bi 116  df-dc 830  df-3or 974  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-reu 2455  df-rmo 2456  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-if 3527  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-int 3832  df-iun 3875  df-br 3990  df-opab 4051  df-mpt 4052  df-tr 4088  df-id 4278  df-po 4281  df-iso 4282  df-iord 4351  df-on 4353  df-ilim 4354  df-suc 4356  df-iom 4575  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-isom 5207  df-riota 5809  df-ov 5856  df-oprab 5857  df-mpo 5858  df-1st 6119  df-2nd 6120  df-recs 6284  df-irdg 6349  df-frec 6370  df-1o 6395  df-oadd 6399  df-er 6513  df-en 6719  df-dom 6720  df-fin 6721  df-pnf 7956  df-mnf 7957  df-xr 7958  df-ltxr 7959  df-le 7960  df-sub 8092  df-neg 8093  df-reap 8494  df-ap 8501  df-div 8590  df-inn 8879  df-2 8937  df-3 8938  df-4 8939  df-n0 9136  df-z 9213  df-uz 9488  df-q 9579  df-rp 9611  df-fz 9966  df-fzo 10099  df-seqfrec 10402  df-exp 10476  df-ihash 10710  df-cj 10806  df-re 10807  df-im 10808  df-rsqrt 10962  df-abs 10963  df-clim 11242  df-sumdc 11317
This theorem is referenced by:  fisumcom2  11401
  Copyright terms: Public domain W3C validator