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

Theorem gsumpropd 13605
Description: The group sum depends only on the base set and additive operation. (Contributed by Stefan O'Rear, 1-Feb-2015.) (Proof shortened by Mario Carneiro, 18-Sep-2015.)
Hypotheses
Ref Expression
gsumpropd.f  |-  ( ph  ->  F  e.  V )
gsumpropd.g  |-  ( ph  ->  G  e.  W )
gsumpropd.h  |-  ( ph  ->  H  e.  X )
gsumpropd.b  |-  ( ph  ->  ( Base `  G
)  =  ( Base `  H ) )
gsumpropd.p  |-  ( ph  ->  ( +g  `  G
)  =  ( +g  `  H ) )
Assertion
Ref Expression
gsumpropd  |-  ( ph  ->  ( G  gsumg  F )  =  ( H  gsumg  F ) )

Proof of Theorem gsumpropd
Dummy variables  a  b  m  n  x are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqidd 2233 . . . . . . 7  |-  ( ph  ->  ( Base `  G
)  =  ( Base `  G ) )
2 gsumpropd.b . . . . . . 7  |-  ( ph  ->  ( Base `  G
)  =  ( Base `  H ) )
3 gsumpropd.g . . . . . . 7  |-  ( ph  ->  G  e.  W )
4 gsumpropd.h . . . . . . 7  |-  ( ph  ->  H  e.  X )
5 gsumpropd.p . . . . . . . 8  |-  ( ph  ->  ( +g  `  G
)  =  ( +g  `  H ) )
65oveqdr 6078 . . . . . . 7  |-  ( (
ph  /\  ( a  e.  ( Base `  G
)  /\  b  e.  ( Base `  G )
) )  ->  (
a ( +g  `  G
) b )  =  ( a ( +g  `  H ) b ) )
71, 2, 3, 4, 6grpidpropdg 13587 . . . . . 6  |-  ( ph  ->  ( 0g `  G
)  =  ( 0g
`  H ) )
87eqeq2d 2244 . . . . 5  |-  ( ph  ->  ( x  =  ( 0g `  G )  <-> 
x  =  ( 0g
`  H ) ) )
98anbi2d 464 . . . 4  |-  ( ph  ->  ( ( dom  F  =  (/)  /\  x  =  ( 0g `  G
) )  <->  ( dom  F  =  (/)  /\  x  =  ( 0g `  H ) ) ) )
105seqeq2d 10816 . . . . . . . . 9  |-  ( ph  ->  seq m ( ( +g  `  G ) ,  F )  =  seq m ( ( +g  `  H ) ,  F ) )
1110fveq1d 5672 . . . . . . . 8  |-  ( ph  ->  (  seq m ( ( +g  `  G
) ,  F ) `
 n )  =  (  seq m ( ( +g  `  H
) ,  F ) `
 n ) )
1211eqeq2d 2244 . . . . . . 7  |-  ( ph  ->  ( x  =  (  seq m ( ( +g  `  G ) ,  F ) `  n )  <->  x  =  (  seq m ( ( +g  `  H ) ,  F ) `  n ) ) )
1312anbi2d 464 . . . . . 6  |-  ( ph  ->  ( ( dom  F  =  ( m ... n )  /\  x  =  (  seq m
( ( +g  `  G
) ,  F ) `
 n ) )  <-> 
( dom  F  =  ( m ... n
)  /\  x  =  (  seq m ( ( +g  `  H ) ,  F ) `  n ) ) ) )
1413rexbidv 2543 . . . . 5  |-  ( ph  ->  ( E. n  e.  ( ZZ>= `  m )
( dom  F  =  ( m ... n
)  /\  x  =  (  seq m ( ( +g  `  G ) ,  F ) `  n ) )  <->  E. n  e.  ( ZZ>= `  m )
( dom  F  =  ( m ... n
)  /\  x  =  (  seq m ( ( +g  `  H ) ,  F ) `  n ) ) ) )
1514exbidv 1874 . . . 4  |-  ( ph  ->  ( E. m E. n  e.  ( ZZ>= `  m ) ( dom 
F  =  ( m ... n )  /\  x  =  (  seq m ( ( +g  `  G ) ,  F
) `  n )
)  <->  E. m E. n  e.  ( ZZ>= `  m )
( dom  F  =  ( m ... n
)  /\  x  =  (  seq m ( ( +g  `  H ) ,  F ) `  n ) ) ) )
169, 15orbi12d 801 . . 3  |-  ( ph  ->  ( ( ( dom 
F  =  (/)  /\  x  =  ( 0g `  G ) )  \/ 
E. m E. n  e.  ( ZZ>= `  m )
( dom  F  =  ( m ... n
)  /\  x  =  (  seq m ( ( +g  `  G ) ,  F ) `  n ) ) )  <-> 
( ( dom  F  =  (/)  /\  x  =  ( 0g `  H
) )  \/  E. m E. n  e.  (
ZZ>= `  m ) ( dom  F  =  ( m ... n )  /\  x  =  (  seq m ( ( +g  `  H ) ,  F ) `  n ) ) ) ) )
1716iotabidv 5335 . 2  |-  ( ph  ->  ( iota x ( ( dom  F  =  (/)  /\  x  =  ( 0g `  G ) )  \/  E. m E. n  e.  ( ZZ>=
`  m ) ( dom  F  =  ( m ... n )  /\  x  =  (  seq m ( ( +g  `  G ) ,  F ) `  n ) ) ) )  =  ( iota
x ( ( dom 
F  =  (/)  /\  x  =  ( 0g `  H ) )  \/ 
E. m E. n  e.  ( ZZ>= `  m )
( dom  F  =  ( m ... n
)  /\  x  =  (  seq m ( ( +g  `  H ) ,  F ) `  n ) ) ) ) )
18 eqid 2232 . . 3  |-  ( Base `  G )  =  (
Base `  G )
19 eqid 2232 . . 3  |-  ( 0g
`  G )  =  ( 0g `  G
)
20 eqid 2232 . . 3  |-  ( +g  `  G )  =  ( +g  `  G )
21 gsumpropd.f . . 3  |-  ( ph  ->  F  e.  V )
22 eqidd 2233 . . 3  |-  ( ph  ->  dom  F  =  dom  F )
2318, 19, 20, 3, 21, 22igsumvalx 13602 . 2  |-  ( ph  ->  ( G  gsumg  F )  =  ( iota x ( ( dom  F  =  (/)  /\  x  =  ( 0g
`  G ) )  \/  E. m E. n  e.  ( ZZ>= `  m ) ( dom 
F  =  ( m ... n )  /\  x  =  (  seq m ( ( +g  `  G ) ,  F
) `  n )
) ) ) )
24 eqid 2232 . . 3  |-  ( Base `  H )  =  (
Base `  H )
25 eqid 2232 . . 3  |-  ( 0g
`  H )  =  ( 0g `  H
)
26 eqid 2232 . . 3  |-  ( +g  `  H )  =  ( +g  `  H )
2724, 25, 26, 4, 21, 22igsumvalx 13602 . 2  |-  ( ph  ->  ( H  gsumg  F )  =  ( iota x ( ( dom  F  =  (/)  /\  x  =  ( 0g
`  H ) )  \/  E. m E. n  e.  ( ZZ>= `  m ) ( dom 
F  =  ( m ... n )  /\  x  =  (  seq m ( ( +g  `  H ) ,  F
) `  n )
) ) ) )
2817, 23, 273eqtr4d 2275 1  |-  ( ph  ->  ( G  gsumg  F )  =  ( H  gsumg  F ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    \/ wo 716    = wceq 1398   E.wex 1541    e. wcel 2203   E.wrex 2521   (/)c0 3508   dom cdm 4749   iotacio 5310   ` cfv 5352  (class class class)co 6050   ZZ>=cuz 9853   ...cfz 10342    seqcseq 10809   Basecbs 13212   +g cplusg 13290   0gc0g 13469    gsumg cgsu 13470
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-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1re 8221  ax-addrcl 8224
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-recs 6536  df-frec 6622  df-neg 8447  df-inn 9238  df-z 9578  df-uz 9854  df-seqfrec 10810  df-ndx 13215  df-slot 13216  df-base 13218  df-0g 13471  df-igsum 13472
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator