Theorem subcmnd 14086

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 2235	. 2 |- ( ph -> ( Base ` H ) = ( Base ` H ) )
2		subcmnd.h	. . 3 |- ( ph -> H = ( G ↾s S ) )
3		eqidd 2235	. . 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 13426	. 2 |- ( ph -> ( +g ` G ) = ( +g ` H ) )
7		subcmnd.m	. 2 |- ( ph -> H e. Mnd )
8	5	3ad2ant1 1045	. . 3 |- ( ( ph /\ x e. ( Base ` H ) /\ y e. ( Base ` H ) ) -> G e. CMnd )
9		eqidd 2235	. . . . . 6 |- ( ph -> ( Base ` G ) = ( Base ` G ) )
10	2, 9, 5, 4	ressbasssd 13366	. . . . 5 |- ( ph -> ( Base ` H ) C_ ( Base ` G ) )
11	10	sselda 3242	. . . 4 |- ( ( ph /\ x e. ( Base ` H ) ) -> x e. ( Base ` G ) )
12	11	3adant3 1044	. . 3 |- ( ( ph /\ x e. ( Base ` H ) /\ y e. ( Base ` H ) ) -> x e. ( Base ` G ) )
13	10	sselda 3242	. . . 4 |- ( ( ph /\ y e. ( Base ` H ) ) -> y e. ( Base ` G ) )
14	13	3adant2 1043	. . 3 |- ( ( ph /\ x e. ( Base ` H ) /\ y e. ( Base ` H ) ) -> y e. ( Base ` G ) )
15		eqid 2234	. . . 4 |- ( Base ` G ) = ( Base ` G )
16		eqid 2234	. . . 4 |- ( +g ` G ) = ( +g ` G )
17	15, 16	cmncom 14055	. . 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 1274	. 2 |- ( ( ph /\ x e. ( Base ` H ) /\ y e. ( Base ` H ) ) -> ( x ( +g ` G ) y ) = ( y ( +g ` G ) x ) )
19	1, 6, 7, 18	iscmnd 14051	1 |- ( ph -> H e. CMnd )

Syntax hints:   -> wi 4   /\ w3a 1005   = wceq 1398   e. wcel 2205   ` cfv 5357  (class class class)co 6058   Basecbs 13296   ↾_s cress 13297   +g cplusg 13374   Mndcmnd 13677  CMndccmn 14037

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-pre-ltirr 8255  ax-pre-ltadd 8259

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-iota 5317  df-fun 5359  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-pnf 8326  df-mnf 8327  df-ltxr 8329  df-inn 9255  df-2 9313  df-ndx 13299  df-slot 13300  df-base 13302  df-sets 13303  df-iress 13304  df-plusg 13387  df-cmn 14039

This theorem is referenced by:  unitabl  14362  subrgcrng  14471