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

Theorem gsumpropd 13538
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 2232 . . . . . . 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 6056 . . . . . . 7  |-  ( (
ph  /\  ( a  e.  ( Base `  G
)  /\  b  e.  ( Base `  G )
) )  ->  (
a ( +g  `  G
) b )  =  ( a ( +g  `  H ) b ) )
71, 2, 3, 4, 6grpidpropdg 13520 . . . . . 6  |-  ( ph  ->  ( 0g `  G
)  =  ( 0g
`  H ) )
87eqeq2d 2243 . . . . 5  |-  ( ph  ->  ( x  =  ( 0g `  G )  <-> 
x  =  ( 0g
`  H ) ) )
98anbi2d 464 . . . 4  |-  ( ph  ->  ( ( dom  F  =  (/)  /\  x  =  ( 0g `  G
) )  <->  ( dom  F  =  (/)  /\  x  =  ( 0g `  H ) ) ) )
105seqeq2d 10762 . . . . . . . . 9  |-  ( ph  ->  seq m ( ( +g  `  G ) ,  F )  =  seq m ( ( +g  `  H ) ,  F ) )
1110fveq1d 5650 . . . . . . . 8  |-  ( ph  ->  (  seq m ( ( +g  `  G
) ,  F ) `
 n )  =  (  seq m ( ( +g  `  H
) ,  F ) `
 n ) )
1211eqeq2d 2243 . . . . . . 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 2534 . . . . 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 1873 . . . 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 5316 . 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 2231 . . 3  |-  ( Base `  G )  =  (
Base `  G )
19 eqid 2231 . . 3  |-  ( 0g
`  G )  =  ( 0g `  G
)
20 eqid 2231 . . 3  |-  ( +g  `  G )  =  ( +g  `  G )
21 gsumpropd.f . . 3  |-  ( ph  ->  F  e.  V )
22 eqidd 2232 . . 3  |-  ( ph  ->  dom  F  =  dom  F )
2318, 19, 20, 3, 21, 22igsumvalx 13535 . 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 2231 . . 3  |-  ( Base `  H )  =  (
Base `  H )
25 eqid 2231 . . 3  |-  ( 0g
`  H )  =  ( 0g `  H
)
26 eqid 2231 . . 3  |-  ( +g  `  H )  =  ( +g  `  H )
2724, 25, 26, 4, 21, 22igsumvalx 13535 . 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 2274 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 2202   E.wrex 2512   (/)c0 3496   dom cdm 4731   iotacio 5291   ` cfv 5333  (class class class)co 6028   ZZ>=cuz 9799   ...cfz 10288    seqcseq 10755   Basecbs 13145   +g cplusg 13223   0gc0g 13402    gsumg cgsu 13403
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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1re 8169  ax-addrcl 8172
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 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-recs 6514  df-frec 6600  df-neg 8395  df-inn 9186  df-z 9524  df-uz 9800  df-seqfrec 10756  df-ndx 13148  df-slot 13149  df-base 13151  df-0g 13404  df-igsum 13405
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator