Theorem mulgnn0subcl 12852

Description: Closure of the group multiple (exponentiation) operation in a submonoid. (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 )

Assertion

Ref	Expression
mulgnn0subcl	|- ( ( ph /\ N e. NN0 /\ X e. S ) -> ( N .x. X ) e. S )

Distinct variable groups:   x, y, .+   x, B, y   x, G, y   x, N, y   x, S, y   ph, x, y   x, .x.   x, X, y

Allowed substitution hints:   .x. ( y)   V( x, y)   .0. ( x, y)

Proof of Theorem mulgnn0subcl

Step	Hyp	Ref	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	1, 2, 3, 4, 5, 6	mulgnnsubcl 12851	. . . . 5 |- ( ( ph /\ N e. NN /\ X e. S ) -> ( N .x. X ) e. S )
8	7	3expa 1201	. . . 4 |- ( ( ( ph /\ N e. NN ) /\ X e. S ) -> ( N .x. X ) e. S )
9	8	an32s 566	. . 3 |- ( ( ( ph /\ X e. S ) /\ N e. NN ) -> ( N .x. X ) e. S )
10	9	3adantl2 1152	. 2 |- ( ( ( ph /\ N e. NN0 /\ X e. S ) /\ N e. NN ) -> ( N .x. X ) e. S )
11		oveq1 5869	. . . 4 |- ( N = 0 -> ( N .x. X ) = ( 0 .x. X ) )
12	5	3ad2ant1 1016	. . . . . 6 |- ( ( ph /\ N e. NN0 /\ X e. S ) -> S C_ B )
13		simp3 997	. . . . . 6 |- ( ( ph /\ N e. NN0 /\ X e. S ) -> X e. S )
14	12, 13	sseldd 3151	. . . . 5 |- ( ( ph /\ N e. NN0 /\ X e. S ) -> X e. B )
15		mulgnn0subcl.z	. . . . . 6 |- .0. = ( 0g ` G )
16	1, 15, 2	mulg0 12844	. . . . 5 |- ( X e. B -> ( 0 .x. X ) = .0. )
17	14, 16	syl 14	. . . 4 |- ( ( ph /\ N e. NN0 /\ X e. S ) -> ( 0 .x. X ) = .0. )
18	11, 17	sylan9eqr 2228	. . 3 |- ( ( ( ph /\ N e. NN0 /\ X e. S ) /\ N = 0 ) -> ( N .x. X ) = .0. )
19		mulgnn0subcl.c	. . . . 5 |- ( ph -> .0. e. S )
20	19	3ad2ant1 1016	. . . 4 |- ( ( ph /\ N e. NN0 /\ X e. S ) -> .0. e. S )
21	20	adantr 276	. . 3 |- ( ( ( ph /\ N e. NN0 /\ X e. S ) /\ N = 0 ) -> .0. e. S )
22	18, 21	eqeltrd 2250	. 2 |- ( ( ( ph /\ N e. NN0 /\ X e. S ) /\ N = 0 ) -> ( N .x. X ) e. S )
23		simp2 996	. . 3 |- ( ( ph /\ N e. NN0 /\ X e. S ) -> N e. NN0 )
24		elnn0 9146	. . 3 |- ( N e. NN0 <-> ( N e. NN \/ N = 0 ) )
25	23, 24	sylib 122	. 2 |- ( ( ph /\ N e. NN0 /\ X e. S ) -> ( N e. NN \/ N = 0 ) )
26	10, 22, 25	mpjaodan 796	1 |- ( ( ph /\ N e. NN0 /\ X e. S ) -> ( N .x. X ) e. S )

Syntax hints:   -> wi 4   /\ wa 104   \/ wo 706   /\ w3a 976   = wceq 1351   e. wcel 2144   C_ wss 3124   ` cfv 5205  (class class class)co 5862   0cc0 7783   NNcn 8887   NN0cn0 9144   Basecbs 12425   +g cplusg 12489   0gc0g 12623  ._gcmg 12839

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 612  ax-in2 613  ax-io 707  ax-5 1443  ax-7 1444  ax-gen 1445  ax-ie1 1489  ax-ie2 1490  ax-8 1500  ax-10 1501  ax-11 1502  ax-i12 1503  ax-bndl 1505  ax-4 1506  ax-17 1522  ax-i9 1526  ax-ial 1530  ax-i5r 1531  ax-13 2146  ax-14 2147  ax-ext 2155  ax-coll 4110  ax-sep 4113  ax-nul 4121  ax-pow 4166  ax-pr 4200  ax-un 4424  ax-setind 4527  ax-iinf 4578  ax-cnex 7874  ax-resscn 7875  ax-1cn 7876  ax-1re 7877  ax-icn 7878  ax-addcl 7879  ax-addrcl 7880  ax-mulcl 7881  ax-addcom 7883  ax-addass 7885  ax-distr 7887  ax-i2m1 7888  ax-0lt1 7889  ax-0id 7891  ax-rnegex 7892  ax-cnre 7894  ax-pre-ltirr 7895  ax-pre-ltwlin 7896  ax-pre-lttrn 7897  ax-pre-ltadd 7899

This theorem depends on definitions:  df-bi 117  df-dc 833  df-3or 977  df-3an 978  df-tru 1354  df-fal 1357  df-nf 1457  df-sb 1759  df-eu 2025  df-mo 2026  df-clab 2160  df-cleq 2166  df-clel 2169  df-nfc 2304  df-ne 2344  df-nel 2439  df-ral 2456  df-rex 2457  df-reu 2458  df-rab 2460  df-v 2735  df-sbc 2959  df-csb 3053  df-dif 3126  df-un 3128  df-in 3130  df-ss 3137  df-nul 3418  df-if 3530  df-pw 3571  df-sn 3592  df-pr 3593  df-op 3595  df-uni 3803  df-int 3838  df-iun 3881  df-br 3996  df-opab 4057  df-mpt 4058  df-tr 4094  df-id 4284  df-iord 4357  df-on 4359  df-ilim 4360  df-suc 4362  df-iom 4581  df-xp 4623  df-rel 4624  df-cnv 4625  df-co 4626  df-dm 4627  df-rn 4628  df-res 4629  df-ima 4630  df-iota 5167  df-fun 5207  df-fn 5208  df-f 5209  df-f1 5210  df-fo 5211  df-f1o 5212  df-fv 5213  df-riota 5818  df-ov 5865  df-oprab 5866  df-mpo 5867  df-1st 6128  df-2nd 6129  df-recs 6293  df-frec 6379  df-pnf 7965  df-mnf 7966  df-xr 7967  df-ltxr 7968  df-le 7969  df-sub 8101  df-neg 8102  df-inn 8888  df-2 8946  df-n0 9145  df-z 9222  df-uz 9497  df-seqfrec 10411  df-ndx 12428  df-slot 12429  df-base 12431  df-plusg 12502  df-0g 12625  df-minusg 12739  df-mulg 12840

This theorem is referenced by:  mulgsubcl  12853  mulgnn0cl  12855  submmulgcl  12880