Theorem subcmnd 14137

Description: A submonoid of a commutative monoid is also commutative. (Contributed by Mario Carneiro, 10-Jan-2015.)

Hypotheses

Ref	Expression
subcmnd.h	|- ( ph -> H = ( G ↾s S ) )
subcmnd.g	|- ( ph -> G e. CMnd )
subcmnd.m	|- ( ph -> H e. Mnd )
subcmnd.s	|- ( ph -> S e. V )

Assertion

Ref	Expression
subcmnd	|- ( ph -> H e. CMnd )

Proof of Theorem subcmnd

Dummy variables x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqidd 2239	. 2 |- ( ph -> ( Base ` H ) = ( Base ` H ) )
2		subcmnd.h	. . 3 |- ( ph -> H = ( G ↾s S ) )
3		eqidd 2239	. . 3 |- ( ph -> ( +g ` G ) = ( +g ` G ) )
4		subcmnd.s	. . 3 |- ( ph -> S e. V )
5		subcmnd.g	. . 3 |- ( ph -> G e. CMnd )
6	2, 3, 4, 5	ressplusgd 13483	. 2 |- ( ph -> ( +g ` G ) = ( +g ` H ) )
7		subcmnd.m	. 2 |- ( ph -> H e. Mnd )
8	5	3ad2ant1 1049	. . 3 |- ( ( ph /\ x e. ( Base ` H ) /\ y e. ( Base ` H ) ) -> G e. CMnd )
9		eqidd 2239	. . . . . 6 |- ( ph -> ( Base ` G ) = ( Base ` G ) )
10	2, 9, 5, 4	ressbasssd 13423	. . . . 5 |- ( ph -> ( Base ` H ) C_ ( Base ` G ) )
11	10	sselda 3248	. . . 4 |- ( ( ph /\ x e. ( Base ` H ) ) -> x e. ( Base ` G ) )
12	11	3adant3 1048	. . 3 |- ( ( ph /\ x e. ( Base ` H ) /\ y e. ( Base ` H ) ) -> x e. ( Base ` G ) )
13	10	sselda 3248	. . . 4 |- ( ( ph /\ y e. ( Base ` H ) ) -> y e. ( Base ` G ) )
14	13	3adant2 1047	. . 3 |- ( ( ph /\ x e. ( Base ` H ) /\ y e. ( Base ` H ) ) -> y e. ( Base ` G ) )
15		eqid 2238	. . . 4 |- ( Base ` G ) = ( Base ` G )
16		eqid 2238	. . . 4 |- ( +g ` G ) = ( +g ` G )
17	15, 16	cmncom 14105	. . 3 |- ( ( G e. CMnd /\ x e. ( Base ` G ) /\ y e. ( Base ` G ) ) -> ( x ( +g ` G ) y ) = ( y ( +g ` G ) x ) )
18	8, 12, 14, 17	syl3anc 1278	. 2 |- ( ( ph /\ x e. ( Base ` H ) /\ y e. ( Base ` H ) ) -> ( x ( +g ` G ) y ) = ( y ( +g ` G ) x ) )
19	1, 6, 7, 18	iscmnd 14101	1 |- ( ph -> H e. CMnd )

This proof depends on syntax axioms:   -> wi 4   /\ w3a 1009   = wceq 1402   e. wcel 2209   ` cfv 5377  (class class class)co 6085   Basecbs 13352   ↾_s cress 13353   +g cplusg 13431   Mndcmnd 13729  CMndccmn 14087

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-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-pre-ltirr 8291  ax-pre-ltadd 8295

This proof depends on definitions:  df-bi 117  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-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9305  df-2 9363  df-ndx 13355  df-slot 13356  df-base 13358  df-sets 13359  df-iress 13360  df-plusg 13444  df-cmn 14089

This theorem is used by:  unitabl  14424  subrgcrng  14533