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

Theorem subcmnd 14114
Description: A submonoid of a commutative monoid is also commutative. (Contributed by Mario Carneiro, 10-Jan-2015.)
Hypotheses
Ref Expression
subcmnd.h  |-  ( ph  ->  H  =  ( Gs  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.
StepHypRef Expression
1 eqidd 2239 . 2  |-  ( ph  ->  ( Base `  H
)  =  ( Base `  H ) )
2 subcmnd.h . . 3  |-  ( ph  ->  H  =  ( Gs  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 )
62, 3, 4, 5ressplusgd 13460 . 2  |-  ( ph  ->  ( +g  `  G
)  =  ( +g  `  H ) )
7 subcmnd.m . 2  |-  ( ph  ->  H  e.  Mnd )
853ad2ant1 1049 . . 3  |-  ( (
ph  /\  x  e.  ( Base `  H )  /\  y  e.  ( Base `  H ) )  ->  G  e. CMnd )
9 eqidd 2239 . . . . . 6  |-  ( ph  ->  ( Base `  G
)  =  ( Base `  G ) )
102, 9, 5, 4ressbasssd 13400 . . . . 5  |-  ( ph  ->  ( Base `  H
)  C_  ( Base `  G ) )
1110sselda 3248 . . . 4  |-  ( (
ph  /\  x  e.  ( Base `  H )
)  ->  x  e.  ( Base `  G )
)
12113adant3 1048 . . 3  |-  ( (
ph  /\  x  e.  ( Base `  H )  /\  y  e.  ( Base `  H ) )  ->  x  e.  (
Base `  G )
)
1310sselda 3248 . . . 4  |-  ( (
ph  /\  y  e.  ( Base `  H )
)  ->  y  e.  ( Base `  G )
)
14133adant2 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 )
1715, 16cmncom 14082 . . 3  |-  ( ( G  e. CMnd  /\  x  e.  ( Base `  G
)  /\  y  e.  ( Base `  G )
)  ->  ( x
( +g  `  G ) y )  =  ( y ( +g  `  G
) x ) )
188, 12, 14, 17syl3anc 1278 . 2  |-  ( (
ph  /\  x  e.  ( Base `  H )  /\  y  e.  ( Base `  H ) )  ->  ( x ( +g  `  G ) y )  =  ( y ( +g  `  G
) x ) )
191, 6, 7, 18iscmnd 14078 1  |-  ( ph  ->  H  e. CMnd )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ w3a 1009    = wceq 1402    e. wcel 2209   ` cfv 5372  (class class class)co 6075   Basecbs 13330   ↾s cress 13331   +g cplusg 13408   Mndcmnd 13706  CMndccmn 14064
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 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 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-pre-ltirr 8281  ax-pre-ltadd 8285
This theorem 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 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-iota 5332  df-fun 5374  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-ltxr 8355  df-inn 9284  df-2 9342  df-ndx 13333  df-slot 13334  df-base 13336  df-sets 13337  df-iress 13338  df-plusg 13421  df-cmn 14066
This theorem is referenced by:  unitabl  14397  subrgcrng  14506
  Copyright terms: Public domain W3C validator