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

Theorem mulgsubcl 13998
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 13997 . . . . 5  |-  ( (
ph  /\  N  e.  NN0 
/\  X  e.  S
)  ->  ( N  .x.  X )  e.  S
)
1093expa 1234 . . . 4  |-  ( ( ( ph  /\  N  e.  NN0 )  /\  X  e.  S )  ->  ( N  .x.  X )  e.  S )
1110an32s 574 . . 3  |-  ( ( ( ph  /\  X  e.  S )  /\  N  e.  NN0 )  ->  ( N  .x.  X )  e.  S )
12113adantl2 1185 . 2  |-  ( ( ( ph  /\  N  e.  ZZ  /\  X  e.  S )  /\  N  e.  NN0 )  ->  ( N  .x.  X )  e.  S )
13 simp2 1029 . . . . . . . . 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 9780 . . . . . . 7  |-  ( ( ( ph  /\  N  e.  ZZ  /\  X  e.  S )  /\  -u N  e.  NN )  ->  N  e.  CC )
1615negnegd 8635 . . . . . 6  |-  ( ( ( ph  /\  N  e.  ZZ  /\  X  e.  S )  /\  -u N  e.  NN )  ->  -u  -u N  =  N )
1716oveq1d 6103 . . . . 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 1049 . . . . . . 7  |-  ( (
ph  /\  N  e.  ZZ  /\  X  e.  S
)  ->  S  C_  B
)
20 simp3 1030 . . . . . . 7  |-  ( (
ph  /\  N  e.  ZZ  /\  X  e.  S
)  ->  X  e.  S )
2119, 20sseldd 3249 . . . . . 6  |-  ( (
ph  /\  N  e.  ZZ  /\  X  e.  S
)  ->  X  e.  B )
22 mulgsubcl.i . . . . . . 7  |-  I  =  ( invg `  G )
231, 2, 22mulgnegnn 13994 . . . . . 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 2273 . . . 4  |-  ( ( ( ph  /\  N  e.  ZZ  /\  X  e.  S )  /\  -u N  e.  NN )  ->  ( N  .x.  X )  =  ( I `  (  -u N  .x.  X ) ) )
26 fveq2 5698 . . . . . 6  |-  ( x  =  (  -u N  .x.  X )  ->  (
I `  x )  =  ( I `  (  -u N  .x.  X
) ) )
2726eleq1d 2307 . . . . 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 2623 . . . . . . 7  |-  ( ph  ->  A. x  e.  S  ( I `  x
)  e.  S )
30293ad2ant1 1049 . . . . . 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 13996 . . . . . . . 8  |-  ( (
ph  /\  -u N  e.  NN  /\  X  e.  S )  ->  (  -u N  .x.  X )  e.  S )
33323expa 1234 . . . . . . 7  |-  ( ( ( ph  /\  -u N  e.  NN )  /\  X  e.  S )  ->  (  -u N  .x.  X )  e.  S )
3433an32s 574 . . . . . 6  |-  ( ( ( ph  /\  X  e.  S )  /\  -u N  e.  NN )  ->  (  -u N  .x.  X )  e.  S )
35343adantl2 1185 . . . . 5  |-  ( ( ( ph  /\  N  e.  ZZ  /\  X  e.  S )  /\  -u N  e.  NN )  ->  (  -u N  .x.  X )  e.  S )
3627, 31, 35rspcdva 2934 . . . 4  |-  ( ( ( ph  /\  N  e.  ZZ  /\  X  e.  S )  /\  -u N  e.  NN )  ->  (
I `  (  -u N  .x.  X ) )  e.  S )
3725, 36eqeltrd 2315 . . 3  |-  ( ( ( ph  /\  N  e.  ZZ  /\  X  e.  S )  /\  -u N  e.  NN )  ->  ( N  .x.  X )  e.  S )
3837adantrl 482 . 2  |-  ( ( ( ph  /\  N  e.  ZZ  /\  X  e.  S )  /\  ( N  e.  RR  /\  -u N  e.  NN ) )  -> 
( N  .x.  X
)  e.  S )
39 elznn0nn 9669 . . 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 810 1  |-  ( (
ph  /\  N  e.  ZZ  /\  X  e.  S
)  ->  ( N  .x.  X )  e.  S
)
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    \/ wo 720    /\ w3a 1009    = wceq 1402    e. wcel 2209   A.wral 2528    C_ wss 3220   ` cfv 5380  (class class class)co 6088   RRcr 8184    -ucneg 8505   NNcn 9313   NN0cn0 9574   ZZcz 9655   Basecbs 13410   +g cplusg 13490   0gc0g 13669   invgcminusg 13865  .gcmg 13981
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-ltadd 8301
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-frec 6666  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-inn 9314  df-2 9372  df-n0 9575  df-z 9656  df-uz 9938  df-seqfrec 10906  df-ndx 13413  df-slot 13414  df-base 13416  df-plusg 13503  df-0g 13671  df-minusg 13868  df-mulg 13982
This theorem is used by:  mulgcl  14001  subgmulgcl  14049
  Copyright terms: Public domain W3C validator