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

Theorem sumeq2w 14422
Description: Equality theorem for sum, when the class expressions  B and  C are equal everywhere. Proved using only Extensionality. (Contributed by Mario Carneiro, 24-Jun-2014.) (Revised by Mario Carneiro, 13-Jun-2019.)
Assertion
Ref Expression
sumeq2w  |-  ( A. k  B  =  C  -> 
sum_ k  e.  A  B  =  sum_ k  e.  A  C )

Proof of Theorem sumeq2w
Dummy variables  f  m  n  x are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 csbeq2 3537 . . . . . . . . . 10  |-  ( A. k  B  =  C  ->  [_ n  /  k ]_ B  =  [_ n  /  k ]_ C
)
21ifeq1d 4104 . . . . . . . . 9  |-  ( A. k  B  =  C  ->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 )  =  if ( n  e.  A ,  [_ n  /  k ]_ C ,  0 ) )
32mpteq2dv 4745 . . . . . . . 8  |-  ( A. k  B  =  C  ->  ( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) )  =  ( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ C ,  0 ) ) )
43seqeq3d 12809 . . . . . . 7  |-  ( A. k  B  =  C  ->  seq m (  +  ,  ( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) ) )  =  seq m
(  +  ,  ( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ C ,  0 ) ) ) )
54breq1d 4663 . . . . . 6  |-  ( A. k  B  =  C  ->  (  seq m (  +  ,  ( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) ) )  ~~>  x  <->  seq m
(  +  ,  ( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ C ,  0 ) ) )  ~~>  x ) )
65anbi2d 740 . . . . 5  |-  ( A. k  B  =  C  ->  ( ( A  C_  ( ZZ>= `  m )  /\  seq m (  +  ,  ( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) ) )  ~~>  x )  <->  ( A  C_  ( ZZ>= `  m )  /\  seq m (  +  ,  ( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ C ,  0 ) ) )  ~~>  x ) ) )
76rexbidv 3052 . . . 4  |-  ( A. k  B  =  C  ->  ( E. m  e.  ZZ  ( A  C_  ( ZZ>= `  m )  /\  seq m (  +  ,  ( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) ) )  ~~>  x )  <->  E. m  e.  ZZ  ( A  C_  ( ZZ>= `  m )  /\  seq m (  +  ,  ( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ C ,  0 ) ) )  ~~>  x ) ) )
8 csbeq2 3537 . . . . . . . . . . 11  |-  ( A. k  B  =  C  ->  [_ ( f `  n )  /  k ]_ B  =  [_ (
f `  n )  /  k ]_ C
)
98mpteq2dv 4745 . . . . . . . . . 10  |-  ( A. k  B  =  C  ->  ( n  e.  NN  |->  [_ ( f `  n
)  /  k ]_ B )  =  ( n  e.  NN  |->  [_ ( f `  n
)  /  k ]_ C ) )
109seqeq3d 12809 . . . . . . . . 9  |-  ( A. k  B  =  C  ->  seq 1 (  +  ,  ( n  e.  NN  |->  [_ ( f `  n )  /  k ]_ B ) )  =  seq 1 (  +  ,  ( n  e.  NN  |->  [_ ( f `  n )  /  k ]_ C ) ) )
1110fveq1d 6193 . . . . . . . 8  |-  ( A. k  B  =  C  ->  (  seq 1 (  +  ,  ( n  e.  NN  |->  [_ (
f `  n )  /  k ]_ B
) ) `  m
)  =  (  seq 1 (  +  , 
( n  e.  NN  |->  [_ ( f `  n
)  /  k ]_ C ) ) `  m ) )
1211eqeq2d 2632 . . . . . . 7  |-  ( A. k  B  =  C  ->  ( x  =  (  seq 1 (  +  ,  ( n  e.  NN  |->  [_ ( f `  n )  /  k ]_ B ) ) `  m )  <->  x  =  (  seq 1 (  +  ,  ( n  e.  NN  |->  [_ ( f `  n )  /  k ]_ C ) ) `  m ) ) )
1312anbi2d 740 . . . . . 6  |-  ( A. k  B  =  C  ->  ( ( f : ( 1 ... m
)
-1-1-onto-> A  /\  x  =  (  seq 1 (  +  ,  ( n  e.  NN  |->  [_ ( f `  n )  /  k ]_ B ) ) `  m ) )  <->  ( f : ( 1 ... m ) -1-1-onto-> A  /\  x  =  (  seq 1 (  +  ,  ( n  e.  NN  |->  [_ (
f `  n )  /  k ]_ C
) ) `  m
) ) ) )
1413exbidv 1850 . . . . 5  |-  ( A. k  B  =  C  ->  ( E. f ( f : ( 1 ... m ) -1-1-onto-> A  /\  x  =  (  seq 1 (  +  , 
( n  e.  NN  |->  [_ ( f `  n
)  /  k ]_ B ) ) `  m ) )  <->  E. f
( f : ( 1 ... m ) -1-1-onto-> A  /\  x  =  (  seq 1 (  +  ,  ( n  e.  NN  |->  [_ ( f `  n )  /  k ]_ C ) ) `  m ) ) ) )
1514rexbidv 3052 . . . 4  |-  ( A. k  B  =  C  ->  ( E. m  e.  NN  E. f ( f : ( 1 ... m ) -1-1-onto-> A  /\  x  =  (  seq 1 (  +  , 
( n  e.  NN  |->  [_ ( f `  n
)  /  k ]_ B ) ) `  m ) )  <->  E. m  e.  NN  E. f ( f : ( 1 ... m ) -1-1-onto-> A  /\  x  =  (  seq 1 (  +  , 
( n  e.  NN  |->  [_ ( f `  n
)  /  k ]_ C ) ) `  m ) ) ) )
167, 15orbi12d 746 . . 3  |-  ( A. k  B  =  C  ->  ( ( E. m  e.  ZZ  ( A  C_  ( ZZ>= `  m )  /\  seq m (  +  ,  ( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) ) )  ~~>  x )  \/ 
E. m  e.  NN  E. f ( f : ( 1 ... m
)
-1-1-onto-> A  /\  x  =  (  seq 1 (  +  ,  ( n  e.  NN  |->  [_ ( f `  n )  /  k ]_ B ) ) `  m ) ) )  <-> 
( 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 ) ) ) ) )
1716iotabidv 5872 . 2  |-  ( A. k  B  =  C  ->  ( iota x ( E. m  e.  ZZ  ( A  C_  ( ZZ>= `  m )  /\  seq m (  +  , 
( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) ) )  ~~>  x )  \/  E. m  e.  NN  E. f ( f : ( 1 ... m ) -1-1-onto-> A  /\  x  =  (  seq 1 (  +  , 
( n  e.  NN  |->  [_ ( f `  n
)  /  k ]_ B ) ) `  m ) ) ) )  =  ( 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 ) ) ) ) )
18 df-sum 14417 . 2  |-  sum_ k  e.  A  B  =  ( iota x ( E. m  e.  ZZ  ( A  C_  ( ZZ>= `  m
)  /\  seq m
(  +  ,  ( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) ) )  ~~>  x )  \/  E. m  e.  NN  E. f ( f : ( 1 ... m ) -1-1-onto-> A  /\  x  =  (  seq 1 (  +  , 
( n  e.  NN  |->  [_ ( f `  n
)  /  k ]_ B ) ) `  m ) ) ) )
19 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 ) ) ) )
2017, 18, 193eqtr4g 2681 1  |-  ( A. k  B  =  C  -> 
sum_ k  e.  A  B  =  sum_ k  e.  A  C )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    \/ wo 383    /\ wa 384   A.wal 1481    = 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-sbc 3436  df-csb 3534  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-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: (None)
  Copyright terms: Public domain W3C validator