Theorem sumeq1 14419

Description: Equality theorem for a sum. (Contributed by NM, 11-Dec-2005.) (Revised by Mario Carneiro, 13-Jun-2019.)

Assertion

Ref	Expression
sumeq1	|- ( A = B -> sum_ k e. A C = sum_ k e. B C )

Proof of Theorem sumeq1

Dummy variables f m n x are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		sseq1 3626	. . . . . 6 |- ( A = B -> ( A C_ ( ZZ>= ` m ) <-> B C_ ( ZZ>= ` m ) ) )
2		simpl 473	. . . . . . . . . . 11 |- ( ( A = B /\ n e. ZZ ) -> A = B )
3	2	eleq2d 2687	. . . . . . . . . 10 |- ( ( A = B /\ n e. ZZ ) -> ( n e. A <-> n e. B ) )
4	3	ifbid 4108	. . . . . . . . 9 |- ( ( A = B /\ n e. ZZ ) -> if ( n e. A , [_ n / k ]_ C , 0 ) = if ( n e. B , [_ n / k ]_ C , 0 ) )
5	4	mpteq2dva 4744	. . . . . . . 8 |- ( A = B -> ( n e. ZZ |-> if ( n e. A , [_ n / k ]_ C , 0 ) ) = ( n e. ZZ |-> if ( n e. B , [_ n / k ]_ C , 0 ) ) )
6	5	seqeq3d 12809	. . . . . . 7 |- ( A = B -> seq m ( + , ( n e. ZZ |-> if ( n e. A , [_ n / k ]_ C , 0 ) ) ) = seq m ( + , ( n e. ZZ |-> if ( n e. B , [_ n / k ]_ C , 0 ) ) ) )
7	6	breq1d 4663	. . . . . 6 |- ( A = B -> ( seq m ( + , ( n e. ZZ |-> if ( n e. A , [_ n / k ]_ C , 0 ) ) ) ~~> x <-> seq m ( + , ( n e. ZZ |-> if ( n e. B , [_ n / k ]_ C , 0 ) ) ) ~~> x ) )
8	1, 7	anbi12d 747	. . . . 5 |- ( A = B -> ( ( A C_ ( ZZ>= ` m ) /\ seq m ( + , ( n e. ZZ |-> if ( n e. A , [_ n / k ]_ C , 0 ) ) ) ~~> x ) <-> ( B C_ ( ZZ>= ` m ) /\ seq m ( + , ( n e. ZZ |-> if ( n e. B , [_ n / k ]_ C , 0 ) ) ) ~~> x ) ) )
9	8	rexbidv 3052	. . . 4 |- ( A = B -> ( E. m e. ZZ ( A C_ ( ZZ>= ` m ) /\ seq m ( + , ( n e. ZZ |-> if ( n e. A , [_ n / k ]_ C , 0 ) ) ) ~~> x ) <-> E. m e. ZZ ( B C_ ( ZZ>= ` m ) /\ seq m ( + , ( n e. ZZ |-> if ( n e. B , [_ n / k ]_ C , 0 ) ) ) ~~> x ) ) )
10		f1oeq3 6129	. . . . . . 7 |- ( A = B -> ( f : ( 1 ... m ) -1-1-onto-> A <-> f : ( 1 ... m ) -1-1-onto-> B ) )
11	10	anbi1d 741	. . . . . 6 |- ( A = B -> ( ( f : ( 1 ... m ) -1-1-onto-> A /\ x = ( seq 1 ( + , ( n e. NN |-> [_ ( f ` n ) / k ]_ C ) ) ` m ) ) <-> ( f : ( 1 ... m ) -1-1-onto-> B /\ x = ( seq 1 ( + , ( n e. NN |-> [_ ( f ` n ) / k ]_ C ) ) ` m ) ) ) )
12	11	exbidv 1850	. . . . 5 |- ( A = B -> ( E. f ( f : ( 1 ... m ) -1-1-onto-> A /\ x = ( seq 1 ( + , ( n e. NN |-> [_ ( f ` n ) / k ]_ C ) ) ` m ) ) <-> E. f ( f : ( 1 ... m ) -1-1-onto-> B /\ x = ( seq 1 ( + , ( n e. NN |-> [_ ( f ` n ) / k ]_ C ) ) ` m ) ) ) )
13	12	rexbidv 3052	. . . 4 |- ( A = B -> ( E. m e. NN E. f ( f : ( 1 ... m ) -1-1-onto-> A /\ x = ( seq 1 ( + , ( n e. NN |-> [_ ( f ` n ) / k ]_ C ) ) ` m ) ) <-> E. m e. NN E. f ( f : ( 1 ... m ) -1-1-onto-> B /\ x = ( seq 1 ( + , ( n e. NN |-> [_ ( f ` n ) / k ]_ C ) ) ` m ) ) ) )
14	9, 13	orbi12d 746	. . 3 |- ( A = B -> ( ( E. m e. ZZ ( A C_ ( ZZ>= ` m ) /\ seq m ( + , ( n e. ZZ |-> if ( n e. A , [_ n / k ]_ C , 0 ) ) ) ~~> x ) \/ E. m e. NN E. f ( f : ( 1 ... m ) -1-1-onto-> A /\ x = ( seq 1 ( + , ( n e. NN |-> [_ ( f ` n ) / k ]_ C ) ) ` m ) ) ) <-> ( E. m e. ZZ ( B C_ ( ZZ>= ` m ) /\ seq m ( + , ( n e. ZZ |-> if ( n e. B , [_ n / k ]_ C , 0 ) ) ) ~~> x ) \/ E. m e. NN E. f ( f : ( 1 ... m ) -1-1-onto-> B /\ x = ( seq 1 ( + , ( n e. NN |-> [_ ( f ` n ) / k ]_ C ) ) ` m ) ) ) ) )
15	14	iotabidv 5872	. 2 |- ( A = B -> ( iota x ( E. m e. ZZ ( A C_ ( ZZ>= ` m ) /\ seq m ( + , ( n e. ZZ |-> if ( n e. A , [_ n / k ]_ C , 0 ) ) ) ~~> x ) \/ E. m e. NN E. f ( f : ( 1 ... m ) -1-1-onto-> A /\ x = ( seq 1 ( + , ( n e. NN |-> [_ ( f ` n ) / k ]_ C ) ) ` m ) ) ) ) = ( iota x ( E. m e. ZZ ( B C_ ( ZZ>= ` m ) /\ seq m ( + , ( n e. ZZ |-> if ( n e. B , [_ n / k ]_ C , 0 ) ) ) ~~> x ) \/ E. m e. NN E. f ( f : ( 1 ... m ) -1-1-onto-> B /\ x = ( seq 1 ( + , ( n e. NN |-> [_ ( f ` n ) / k ]_ C ) ) ` m ) ) ) ) )
16		df-sum 14417	. 2 |- sum_ k e. A C = ( iota x ( E. m e. ZZ ( A C_ ( ZZ>= ` m ) /\ seq m ( + , ( n e. ZZ |-> if ( n e. A , [_ n / k ]_ C , 0 ) ) ) ~~> x ) \/ E. m e. NN E. f ( f : ( 1 ... m ) -1-1-onto-> A /\ x = ( seq 1 ( + , ( n e. NN |-> [_ ( f ` n ) / k ]_ C ) ) ` m ) ) ) )
17		df-sum 14417	. 2 |- sum_ k e. B C = ( iota x ( E. m e. ZZ ( B C_ ( ZZ>= ` m ) /\ seq m ( + , ( n e. ZZ |-> if ( n e. B , [_ n / k ]_ C , 0 ) ) ) ~~> x ) \/ E. m e. NN E. f ( f : ( 1 ... m ) -1-1-onto-> B /\ x = ( seq 1 ( + , ( n e. NN |-> [_ ( f ` n ) / k ]_ C ) ) ` m ) ) ) )
18	15, 16, 17	3eqtr4g 2681	1 |- ( A = B -> sum_ k e. A C = sum_ k e. B C )

Syntax hints:   -> wi 4   \/ wo 383   /\ wa 384   = wceq 1483   E.wex 1704   e. wcel 1990   E.wrex 2913   [_csb 3533   C_ wss 3574   ifcif 4086   class class class wbr 4653   |-> cmpt 4729   iotacio 5849   -1-1-onto->wf1o 5887   ` cfv 5888  (class class class)co 6650   0cc0 9936   1c1 9937   + caddc 9939   NNcn 11020   ZZcz 11377   ZZ>=cuz 11687   ...cfz 12326   seqcseq 12801   ~~> cli 14215   sum_csu 14416

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

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-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-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-xp 5120  df-cnv 5122  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-iota 5851  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-seq 12802  df-sum 14417

This theorem is referenced by:  sumeq1i  14428  sumeq1d  14431  sumz  14453  fsumadd  14470  fsum2d  14502  fsumrev2  14514  fsummulc2  14516  fsumconst  14522  modfsummods  14525  modfsummod  14526  fsumabs  14533  fsumrelem  14539  fsumrlim  14543  fsumo1  14544  fsumiun  14553  sumeven  15110  sumodd  15111  bitsinv2  15165  bitsf1ocnv  15166  bitsinv  15170  prmreclem5  15624  gsumfsum  19813  fsumcn  22673  ovolfiniun  23269  volfiniun  23315  itgfsum  23593  dvmptfsum  23738  pntrsumbnd2  25256  finsumvtxdg2size  26446  esumpcvgval  30140  esumcvg  30148  rrnval  33626  mccl  39830  dvmptfprod  40160  dvnprodlem1  40161  dvnprodlem2  40162  dvnprodlem3  40163  dvnprod  40164  sge0rnn0  40585  sge00  40593  fsumlesge0  40594  sge0sn  40596  sge0cl  40598  sge0f1o  40599  sge0resplit  40623  sge0xaddlem1  40650  sge0xaddlem2  40651  sge0reuz  40664