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

Theorem gxid 21251
Description: The identity element of a group to any power remains unchanged. (Contributed by Paul Chapman, 17-Apr-2009.) (New usage is discouraged.)
Hypotheses
Ref Expression
gxid.1  |-  U  =  (GId `  G )
gxid.2  |-  P  =  ( ^g `  G
)
Assertion
Ref Expression
gxid  |-  ( ( G  e.  GrpOp  /\  K  e.  ZZ )  ->  ( U P K )  =  U )

Proof of Theorem gxid
Dummy variables  k  m are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq2 5989 . . . 4  |-  ( m  =  0  ->  ( U P m )  =  ( U P 0 ) )
21eqeq1d 2374 . . 3  |-  ( m  =  0  ->  (
( U P m )  =  U  <->  ( U P 0 )  =  U ) )
3 oveq2 5989 . . . 4  |-  ( m  =  k  ->  ( U P m )  =  ( U P k ) )
43eqeq1d 2374 . . 3  |-  ( m  =  k  ->  (
( U P m )  =  U  <->  ( U P k )  =  U ) )
5 oveq2 5989 . . . 4  |-  ( m  =  ( k  +  1 )  ->  ( U P m )  =  ( U P ( k  +  1 ) ) )
65eqeq1d 2374 . . 3  |-  ( m  =  ( k  +  1 )  ->  (
( U P m )  =  U  <->  ( U P ( k  +  1 ) )  =  U ) )
7 oveq2 5989 . . . 4  |-  ( m  =  -u k  ->  ( U P m )  =  ( U P -u k ) )
87eqeq1d 2374 . . 3  |-  ( m  =  -u k  ->  (
( U P m )  =  U  <->  ( U P -u k )  =  U ) )
9 oveq2 5989 . . . 4  |-  ( m  =  K  ->  ( U P m )  =  ( U P K ) )
109eqeq1d 2374 . . 3  |-  ( m  =  K  ->  (
( U P m )  =  U  <->  ( U P K )  =  U ) )
11 eqid 2366 . . . . 5  |-  ran  G  =  ran  G
12 gxid.1 . . . . 5  |-  U  =  (GId `  G )
1311, 12grpoidcl 21195 . . . 4  |-  ( G  e.  GrpOp  ->  U  e.  ran  G )
14 gxid.2 . . . . 5  |-  P  =  ( ^g `  G
)
1511, 12, 14gx0 21239 . . . 4  |-  ( ( G  e.  GrpOp  /\  U  e.  ran  G )  -> 
( U P 0 )  =  U )
1613, 15mpdan 649 . . 3  |-  ( G  e.  GrpOp  ->  ( U P 0 )  =  U )
17 nn0z 10197 . . . 4  |-  ( k  e.  NN0  ->  k  e.  ZZ )
18 simpl 443 . . . . . . . . 9  |-  ( ( G  e.  GrpOp  /\  k  e.  ZZ )  ->  G  e.  GrpOp )
1913adantr 451 . . . . . . . . 9  |-  ( ( G  e.  GrpOp  /\  k  e.  ZZ )  ->  U  e.  ran  G )
20 simpr 447 . . . . . . . . 9  |-  ( ( G  e.  GrpOp  /\  k  e.  ZZ )  ->  k  e.  ZZ )
2111, 14gxsuc 21250 . . . . . . . . 9  |-  ( ( G  e.  GrpOp  /\  U  e.  ran  G  /\  k  e.  ZZ )  ->  ( U P ( k  +  1 ) )  =  ( ( U P k ) G U ) )
2218, 19, 20, 21syl3anc 1183 . . . . . . . 8  |-  ( ( G  e.  GrpOp  /\  k  e.  ZZ )  ->  ( U P ( k  +  1 ) )  =  ( ( U P k ) G U ) )
2311, 14gxcl 21243 . . . . . . . . . 10  |-  ( ( G  e.  GrpOp  /\  U  e.  ran  G  /\  k  e.  ZZ )  ->  ( U P k )  e. 
ran  G )
2418, 19, 20, 23syl3anc 1183 . . . . . . . . 9  |-  ( ( G  e.  GrpOp  /\  k  e.  ZZ )  ->  ( U P k )  e. 
ran  G )
2511, 12grporid 21198 . . . . . . . . 9  |-  ( ( G  e.  GrpOp  /\  ( U P k )  e. 
ran  G )  -> 
( ( U P k ) G U )  =  ( U P k ) )
2624, 25syldan 456 . . . . . . . 8  |-  ( ( G  e.  GrpOp  /\  k  e.  ZZ )  ->  (
( U P k ) G U )  =  ( U P k ) )
2722, 26eqtr2d 2399 . . . . . . 7  |-  ( ( G  e.  GrpOp  /\  k  e.  ZZ )  ->  ( U P k )  =  ( U P ( k  +  1 ) ) )
2827eqeq1d 2374 . . . . . 6  |-  ( ( G  e.  GrpOp  /\  k  e.  ZZ )  ->  (
( U P k )  =  U  <->  ( U P ( k  +  1 ) )  =  U ) )
2928biimpd 198 . . . . 5  |-  ( ( G  e.  GrpOp  /\  k  e.  ZZ )  ->  (
( U P k )  =  U  -> 
( U P ( k  +  1 ) )  =  U ) )
3029ex 423 . . . 4  |-  ( G  e.  GrpOp  ->  ( k  e.  ZZ  ->  ( ( U P k )  =  U  ->  ( U P ( k  +  1 ) )  =  U ) ) )
3117, 30syl5 28 . . 3  |-  ( G  e.  GrpOp  ->  ( k  e.  NN0  ->  ( ( U P k )  =  U  ->  ( U P ( k  +  1 ) )  =  U ) ) )
32 nnz 10196 . . . 4  |-  ( k  e.  NN  ->  k  e.  ZZ )
33 eqid 2366 . . . . . . . . . 10  |-  ( inv `  G )  =  ( inv `  G )
3411, 33, 14gxneg 21244 . . . . . . . . 9  |-  ( ( G  e.  GrpOp  /\  U  e.  ran  G  /\  k  e.  ZZ )  ->  ( U P -u k )  =  ( ( inv `  G ) `  ( U P k ) ) )
3513, 34syl3an2 1217 . . . . . . . 8  |-  ( ( G  e.  GrpOp  /\  G  e.  GrpOp  /\  k  e.  ZZ )  ->  ( U P -u k )  =  ( ( inv `  G ) `  ( U P k ) ) )
36353anidm12 1240 . . . . . . 7  |-  ( ( G  e.  GrpOp  /\  k  e.  ZZ )  ->  ( U P -u k )  =  ( ( inv `  G ) `  ( U P k ) ) )
37363adant3 976 . . . . . 6  |-  ( ( G  e.  GrpOp  /\  k  e.  ZZ  /\  ( U P k )  =  U )  ->  ( U P -u k )  =  ( ( inv `  G ) `  ( U P k ) ) )
38 fveq2 5632 . . . . . . . 8  |-  ( ( U P k )  =  U  ->  (
( inv `  G
) `  ( U P k ) )  =  ( ( inv `  G ) `  U
) )
3912, 33grpoinvid 21210 . . . . . . . 8  |-  ( G  e.  GrpOp  ->  ( ( inv `  G ) `  U )  =  U )
4038, 39sylan9eqr 2420 . . . . . . 7  |-  ( ( G  e.  GrpOp  /\  ( U P k )  =  U )  ->  (
( inv `  G
) `  ( U P k ) )  =  U )
41403adant2 975 . . . . . 6  |-  ( ( G  e.  GrpOp  /\  k  e.  ZZ  /\  ( U P k )  =  U )  ->  (
( inv `  G
) `  ( U P k ) )  =  U )
4237, 41eqtrd 2398 . . . . 5  |-  ( ( G  e.  GrpOp  /\  k  e.  ZZ  /\  ( U P k )  =  U )  ->  ( U P -u k )  =  U )
43423exp 1151 . . . 4  |-  ( G  e.  GrpOp  ->  ( k  e.  ZZ  ->  ( ( U P k )  =  U  ->  ( U P -u k )  =  U ) ) )
4432, 43syl5 28 . . 3  |-  ( G  e.  GrpOp  ->  ( k  e.  NN  ->  ( ( U P k )  =  U  ->  ( U P -u k )  =  U ) ) )
452, 4, 6, 8, 10, 16, 31, 44zindd 10264 . 2  |-  ( G  e.  GrpOp  ->  ( K  e.  ZZ  ->  ( U P K )  =  U ) )
4645imp 418 1  |-  ( ( G  e.  GrpOp  /\  K  e.  ZZ )  ->  ( U P K )  =  U )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    /\ w3a 935    = wceq 1647    e. wcel 1715   ran crn 4793   ` cfv 5358  (class class class)co 5981   0cc0 8884   1c1 8885    + caddc 8887   -ucneg 9185   NNcn 9893   NN0cn0 10114   ZZcz 10175   GrpOpcgr 21164  GIdcgi 21165   invcgn 21166   ^gcgx 21168
This theorem is referenced by:  gxmodid  21257
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1551  ax-5 1562  ax-17 1621  ax-9 1659  ax-8 1680  ax-13 1717  ax-14 1719  ax-6 1734  ax-7 1739  ax-11 1751  ax-12 1937  ax-ext 2347  ax-rep 4233  ax-sep 4243  ax-nul 4251  ax-pow 4290  ax-pr 4316  ax-un 4615  ax-cnex 8940  ax-resscn 8941  ax-1cn 8942  ax-icn 8943  ax-addcl 8944  ax-addrcl 8945  ax-mulcl 8946  ax-mulrcl 8947  ax-mulcom 8948  ax-addass 8949  ax-mulass 8950  ax-distr 8951  ax-i2m1 8952  ax-1ne0 8953  ax-1rid 8954  ax-rnegex 8955  ax-rrecex 8956  ax-cnre 8957  ax-pre-lttri 8958  ax-pre-lttrn 8959  ax-pre-ltadd 8960  ax-pre-mulgt0 8961
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 936  df-3an 937  df-tru 1324  df-ex 1547  df-nf 1550  df-sb 1654  df-eu 2221  df-mo 2222  df-clab 2353  df-cleq 2359  df-clel 2362  df-nfc 2491  df-ne 2531  df-nel 2532  df-ral 2633  df-rex 2634  df-reu 2635  df-rab 2637  df-v 2875  df-sbc 3078  df-csb 3168  df-dif 3241  df-un 3243  df-in 3245  df-ss 3252  df-pss 3254  df-nul 3544  df-if 3655  df-pw 3716  df-sn 3735  df-pr 3736  df-tp 3737  df-op 3738  df-uni 3930  df-iun 4009  df-br 4126  df-opab 4180  df-mpt 4181  df-tr 4216  df-eprel 4408  df-id 4412  df-po 4417  df-so 4418  df-fr 4455  df-we 4457  df-ord 4498  df-on 4499  df-lim 4500  df-suc 4501  df-om 4760  df-xp 4798  df-rel 4799  df-cnv 4800  df-co 4801  df-dm 4802  df-rn 4803  df-res 4804  df-ima 4805  df-iota 5322  df-fun 5360  df-fn 5361  df-f 5362  df-f1 5363  df-fo 5364  df-f1o 5365  df-fv 5366  df-ov 5984  df-oprab 5985  df-mpt2 5986  df-1st 6249  df-2nd 6250  df-riota 6446  df-recs 6530  df-rdg 6565  df-er 6802  df-en 7007  df-dom 7008  df-sdom 7009  df-pnf 9016  df-mnf 9017  df-xr 9018  df-ltxr 9019  df-le 9020  df-sub 9186  df-neg 9187  df-nn 9894  df-n0 10115  df-z 10176  df-uz 10382  df-seq 11211  df-grpo 21169  df-gid 21170  df-ginv 21171  df-gx 21173
  Copyright terms: Public domain W3C validator