Theorem mulgnn0subcl 13991

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 13990	. . . . 5 |- ( ( ph /\ N e. NN /\ X e. S ) -> ( N .x. X ) e. S )
8	7	3expa 1234	. . . 4 |- ( ( ( ph /\ N e. NN ) /\ X e. S ) -> ( N .x. X ) e. S )
9	8	an32s 574	. . 3 |- ( ( ( ph /\ X e. S ) /\ N e. NN ) -> ( N .x. X ) e. S )
10	9	3adantl2 1185	. 2 |- ( ( ( ph /\ N e. NN0 /\ X e. S ) /\ N e. NN ) -> ( N .x. X ) e. S )
11		oveq1 6092	. . . 4 |- ( N = 0 -> ( N .x. X ) = ( 0 .x. X ) )
12	5	3ad2ant1 1049	. . . . . 6 |- ( ( ph /\ N e. NN0 /\ X e. S ) -> S C_ B )
13		simp3 1030	. . . . . 6 |- ( ( ph /\ N e. NN0 /\ X e. S ) -> X e. S )
14	12, 13	sseldd 3249	. . . . 5 |- ( ( ph /\ N e. NN0 /\ X e. S ) -> X e. B )
15		mulgnn0subcl.z	. . . . . 6 |- .0. = ( 0g ` G )
16	1, 15, 2	mulg0 13981	. . . . 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 2293	. . 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 1049	. . . 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 2315	. 2 |- ( ( ( ph /\ N e. NN0 /\ X e. S ) /\ N = 0 ) -> ( N .x. X ) e. S )
23		simp2 1029	. . 3 |- ( ( ph /\ N e. NN0 /\ X e. S ) -> N e. NN0 )
24		elnn0 9570	. . 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 810	1 |- ( ( ph /\ N e. NN0 /\ X e. S ) -> ( N .x. X ) e. S )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   \/ wo 720   /\ w3a 1009   = wceq 1402   e. wcel 2209   C_ wss 3220   ` cfv 5377  (class class class)co 6085   0cc0 8180   NNcn 9307   NN0cn0 9568   Basecbs 13404   +g cplusg 13484   0gc0g 13663  ._gcmg 13975

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 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-addcom 8280  ax-addass 8282  ax-distr 8284  ax-i2m1 8285  ax-0lt1 8286  ax-0id 8288  ax-rnegex 8289  ax-cnre 8291  ax-pre-ltirr 8292  ax-pre-ltwlin 8293  ax-pre-lttrn 8294  ax-pre-ltadd 8296

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 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-pnf 8363  df-mnf 8364  df-xr 8365  df-ltxr 8366  df-le 8367  df-sub 8501  df-neg 8502  df-inn 9308  df-2 9366  df-n0 9569  df-z 9650  df-uz 9932  df-seqfrec 10900  df-ndx 13407  df-slot 13408  df-base 13410  df-plusg 13497  df-0g 13665  df-minusg 13862  df-mulg 13976

This theorem is used by:  mulgsubcl  13992  mulgnn0cl  13994  submmulgcl  14021