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

Theorem mulgsubcl 13209
Description: Closure of the group multiple (exponentiation) operation in a subgroup. (Contributed by Mario Carneiro, 10-Jan-2015.)
Hypotheses
Ref Expression
mulgnnsubcl.b  |-  B  =  ( Base `  G
)
mulgnnsubcl.t  |-  .x.  =  (.g
`  G )
mulgnnsubcl.p  |-  .+  =  ( +g  `  G )
mulgnnsubcl.g  |-  ( ph  ->  G  e.  V )
mulgnnsubcl.s  |-  ( ph  ->  S  C_  B )
mulgnnsubcl.c  |-  ( (
ph  /\  x  e.  S  /\  y  e.  S
)  ->  ( x  .+  y )  e.  S
)
mulgnn0subcl.z  |-  .0.  =  ( 0g `  G )
mulgnn0subcl.c  |-  ( ph  ->  .0.  e.  S )
mulgsubcl.i  |-  I  =  ( invg `  G )
mulgsubcl.c  |-  ( (
ph  /\  x  e.  S )  ->  (
I `  x )  e.  S )
Assertion
Ref Expression
mulgsubcl  |-  ( (
ph  /\  N  e.  ZZ  /\  X  e.  S
)  ->  ( N  .x.  X )  e.  S
)
Distinct variable groups:    x, y,  .+    x, B, y    x, G, y    x, I    x, N, y    x, S, y    ph, x, y    x,  .x.    x, X, y
Allowed substitution hints:    .x. ( y)    I( y)    V( x, y)    .0. ( x, y)

Proof of Theorem mulgsubcl
StepHypRef Expression
1 mulgnnsubcl.b . . . . . 6  |-  B  =  ( Base `  G
)
2 mulgnnsubcl.t . . . . . 6  |-  .x.  =  (.g
`  G )
3 mulgnnsubcl.p . . . . . 6  |-  .+  =  ( +g  `  G )
4 mulgnnsubcl.g . . . . . 6  |-  ( ph  ->  G  e.  V )
5 mulgnnsubcl.s . . . . . 6  |-  ( ph  ->  S  C_  B )
6 mulgnnsubcl.c . . . . . 6  |-  ( (
ph  /\  x  e.  S  /\  y  e.  S
)  ->  ( x  .+  y )  e.  S
)
7 mulgnn0subcl.z . . . . . 6  |-  .0.  =  ( 0g `  G )
8 mulgnn0subcl.c . . . . . 6  |-  ( ph  ->  .0.  e.  S )
91, 2, 3, 4, 5, 6, 7, 8mulgnn0subcl 13208 . . . . 5  |-  ( (
ph  /\  N  e.  NN0 
/\  X  e.  S
)  ->  ( N  .x.  X )  e.  S
)
1093expa 1205 . . . 4  |-  ( ( ( ph  /\  N  e.  NN0 )  /\  X  e.  S )  ->  ( N  .x.  X )  e.  S )
1110an32s 568 . . 3  |-  ( ( ( ph  /\  X  e.  S )  /\  N  e.  NN0 )  ->  ( N  .x.  X )  e.  S )
12113adantl2 1156 . 2  |-  ( ( ( ph  /\  N  e.  ZZ  /\  X  e.  S )  /\  N  e.  NN0 )  ->  ( N  .x.  X )  e.  S )
13 simp2 1000 . . . . . . . . 9  |-  ( (
ph  /\  N  e.  ZZ  /\  X  e.  S
)  ->  N  e.  ZZ )
1413adantr 276 . . . . . . . 8  |-  ( ( ( ph  /\  N  e.  ZZ  /\  X  e.  S )  /\  -u N  e.  NN )  ->  N  e.  ZZ )
1514zcnd 9443 . . . . . . 7  |-  ( ( ( ph  /\  N  e.  ZZ  /\  X  e.  S )  /\  -u N  e.  NN )  ->  N  e.  CC )
1615negnegd 8323 . . . . . 6  |-  ( ( ( ph  /\  N  e.  ZZ  /\  X  e.  S )  /\  -u N  e.  NN )  ->  -u -u N  =  N )
1716oveq1d 5934 . . . . 5  |-  ( ( ( ph  /\  N  e.  ZZ  /\  X  e.  S )  /\  -u N  e.  NN )  ->  ( -u -u N  .x.  X )  =  ( N  .x.  X ) )
18 id 19 . . . . . 6  |-  ( -u N  e.  NN  ->  -u N  e.  NN )
1953ad2ant1 1020 . . . . . . 7  |-  ( (
ph  /\  N  e.  ZZ  /\  X  e.  S
)  ->  S  C_  B
)
20 simp3 1001 . . . . . . 7  |-  ( (
ph  /\  N  e.  ZZ  /\  X  e.  S
)  ->  X  e.  S )
2119, 20sseldd 3181 . . . . . 6  |-  ( (
ph  /\  N  e.  ZZ  /\  X  e.  S
)  ->  X  e.  B )
22 mulgsubcl.i . . . . . . 7  |-  I  =  ( invg `  G )
231, 2, 22mulgnegnn 13205 . . . . . 6  |-  ( (
-u N  e.  NN  /\  X  e.  B )  ->  ( -u -u N  .x.  X )  =  ( I `  ( -u N  .x.  X ) ) )
2418, 21, 23syl2anr 290 . . . . 5  |-  ( ( ( ph  /\  N  e.  ZZ  /\  X  e.  S )  /\  -u N  e.  NN )  ->  ( -u -u N  .x.  X )  =  ( I `  ( -u N  .x.  X
) ) )
2517, 24eqtr3d 2228 . . . 4  |-  ( ( ( ph  /\  N  e.  ZZ  /\  X  e.  S )  /\  -u N  e.  NN )  ->  ( N  .x.  X )  =  ( I `  ( -u N  .x.  X ) ) )
26 fveq2 5555 . . . . . 6  |-  ( x  =  ( -u N  .x.  X )  ->  (
I `  x )  =  ( I `  ( -u N  .x.  X
) ) )
2726eleq1d 2262 . . . . 5  |-  ( x  =  ( -u N  .x.  X )  ->  (
( I `  x
)  e.  S  <->  ( I `  ( -u N  .x.  X ) )  e.  S ) )
28 mulgsubcl.c . . . . . . . 8  |-  ( (
ph  /\  x  e.  S )  ->  (
I `  x )  e.  S )
2928ralrimiva 2567 . . . . . . 7  |-  ( ph  ->  A. x  e.  S  ( I `  x
)  e.  S )
30293ad2ant1 1020 . . . . . 6  |-  ( (
ph  /\  N  e.  ZZ  /\  X  e.  S
)  ->  A. x  e.  S  ( I `  x )  e.  S
)
3130adantr 276 . . . . 5  |-  ( ( ( ph  /\  N  e.  ZZ  /\  X  e.  S )  /\  -u N  e.  NN )  ->  A. x  e.  S  ( I `  x )  e.  S
)
321, 2, 3, 4, 5, 6mulgnnsubcl 13207 . . . . . . . 8  |-  ( (
ph  /\  -u N  e.  NN  /\  X  e.  S )  ->  ( -u N  .x.  X )  e.  S )
33323expa 1205 . . . . . . 7  |-  ( ( ( ph  /\  -u N  e.  NN )  /\  X  e.  S )  ->  ( -u N  .x.  X )  e.  S )
3433an32s 568 . . . . . 6  |-  ( ( ( ph  /\  X  e.  S )  /\  -u N  e.  NN )  ->  ( -u N  .x.  X )  e.  S )
35343adantl2 1156 . . . . 5  |-  ( ( ( ph  /\  N  e.  ZZ  /\  X  e.  S )  /\  -u N  e.  NN )  ->  ( -u N  .x.  X )  e.  S )
3627, 31, 35rspcdva 2870 . . . 4  |-  ( ( ( ph  /\  N  e.  ZZ  /\  X  e.  S )  /\  -u N  e.  NN )  ->  (
I `  ( -u N  .x.  X ) )  e.  S )
3725, 36eqeltrd 2270 . . 3  |-  ( ( ( ph  /\  N  e.  ZZ  /\  X  e.  S )  /\  -u N  e.  NN )  ->  ( N  .x.  X )  e.  S )
3837adantrl 478 . 2  |-  ( ( ( ph  /\  N  e.  ZZ  /\  X  e.  S )  /\  ( N  e.  RR  /\  -u N  e.  NN ) )  -> 
( N  .x.  X
)  e.  S )
39 elznn0nn 9334 . . 3  |-  ( N  e.  ZZ  <->  ( N  e.  NN0  \/  ( N  e.  RR  /\  -u N  e.  NN ) ) )
4013, 39sylib 122 . 2  |-  ( (
ph  /\  N  e.  ZZ  /\  X  e.  S
)  ->  ( N  e.  NN0  \/  ( N  e.  RR  /\  -u N  e.  NN ) ) )
4112, 38, 40mpjaodan 799 1  |-  ( (
ph  /\  N  e.  ZZ  /\  X  e.  S
)  ->  ( N  .x.  X )  e.  S
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    \/ wo 709    /\ w3a 980    = wceq 1364    e. wcel 2164   A.wral 2472    C_ wss 3154   ` cfv 5255  (class class class)co 5919   RRcr 7873   -ucneg 8193   NNcn 8984   NN0cn0 9243   ZZcz 9320   Basecbs 12621   +g cplusg 12698   0gc0g 12870   invgcminusg 13076  .gcmg 13192
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-nul 4156  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-iinf 4621  ax-cnex 7965  ax-resscn 7966  ax-1cn 7967  ax-1re 7968  ax-icn 7969  ax-addcl 7970  ax-addrcl 7971  ax-mulcl 7972  ax-addcom 7974  ax-addass 7976  ax-distr 7978  ax-i2m1 7979  ax-0lt1 7980  ax-0id 7982  ax-rnegex 7983  ax-cnre 7985  ax-pre-ltirr 7986  ax-pre-ltwlin 7987  ax-pre-lttrn 7988  ax-pre-ltadd 7990
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-if 3559  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-tr 4129  df-id 4325  df-iord 4398  df-on 4400  df-ilim 4401  df-suc 4403  df-iom 4624  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-riota 5874  df-ov 5922  df-oprab 5923  df-mpo 5924  df-1st 6195  df-2nd 6196  df-recs 6360  df-frec 6446  df-pnf 8058  df-mnf 8059  df-xr 8060  df-ltxr 8061  df-le 8062  df-sub 8194  df-neg 8195  df-inn 8985  df-2 9043  df-n0 9244  df-z 9321  df-uz 9596  df-seqfrec 10522  df-ndx 12624  df-slot 12625  df-base 12627  df-plusg 12711  df-0g 12872  df-minusg 13079  df-mulg 13193
This theorem is referenced by:  mulgcl  13212  subgmulgcl  13260
  Copyright terms: Public domain W3C validator