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

Theorem mndissubm 13177
Description: If the base set of a monoid is contained in the base set of another monoid, and the group operation of the monoid is the restriction of the group operation of the other monoid to its base set, and the identity element of the the other monoid is contained in the base set of the monoid, then the (base set of the) monoid is a submonoid of the other monoid. (Contributed by AV, 17-Feb-2024.)
Hypotheses
Ref Expression
mndissubm.b  |-  B  =  ( Base `  G
)
mndissubm.s  |-  S  =  ( Base `  H
)
mndissubm.z  |-  .0.  =  ( 0g `  G )
Assertion
Ref Expression
mndissubm  |-  ( ( G  e.  Mnd  /\  H  e.  Mnd )  ->  ( ( S  C_  B  /\  .0.  e.  S  /\  ( +g  `  H
)  =  ( ( +g  `  G )  |`  ( S  X.  S
) ) )  ->  S  e.  (SubMnd `  G
) ) )

Proof of Theorem mndissubm
Dummy variables  a  b are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr1 1005 . . 3  |-  ( ( ( G  e.  Mnd  /\  H  e.  Mnd )  /\  ( S  C_  B  /\  .0.  e.  S  /\  ( +g  `  H )  =  ( ( +g  `  G )  |`  ( S  X.  S ) ) ) )  ->  S  C_  B )
2 simpr2 1006 . . 3  |-  ( ( ( G  e.  Mnd  /\  H  e.  Mnd )  /\  ( S  C_  B  /\  .0.  e.  S  /\  ( +g  `  H )  =  ( ( +g  `  G )  |`  ( S  X.  S ) ) ) )  ->  .0.  e.  S )
3 mndmgm 13124 . . . . . . 7  |-  ( G  e.  Mnd  ->  G  e. Mgm )
4 mndmgm 13124 . . . . . . 7  |-  ( H  e.  Mnd  ->  H  e. Mgm )
53, 4anim12i 338 . . . . . 6  |-  ( ( G  e.  Mnd  /\  H  e.  Mnd )  ->  ( G  e. Mgm  /\  H  e. Mgm ) )
65ad2antrr 488 . . . . 5  |-  ( ( ( ( G  e. 
Mnd  /\  H  e.  Mnd )  /\  ( S  C_  B  /\  .0.  e.  S  /\  ( +g  `  H )  =  ( ( +g  `  G
)  |`  ( S  X.  S ) ) ) )  /\  ( a  e.  S  /\  b  e.  S ) )  -> 
( G  e. Mgm  /\  H  e. Mgm ) )
7 3simpb 997 . . . . . 6  |-  ( ( S  C_  B  /\  .0.  e.  S  /\  ( +g  `  H )  =  ( ( +g  `  G
)  |`  ( S  X.  S ) ) )  ->  ( S  C_  B  /\  ( +g  `  H
)  =  ( ( +g  `  G )  |`  ( S  X.  S
) ) ) )
87ad2antlr 489 . . . . 5  |-  ( ( ( ( G  e. 
Mnd  /\  H  e.  Mnd )  /\  ( S  C_  B  /\  .0.  e.  S  /\  ( +g  `  H )  =  ( ( +g  `  G
)  |`  ( S  X.  S ) ) ) )  /\  ( a  e.  S  /\  b  e.  S ) )  -> 
( S  C_  B  /\  ( +g  `  H
)  =  ( ( +g  `  G )  |`  ( S  X.  S
) ) ) )
9 simpr 110 . . . . 5  |-  ( ( ( ( G  e. 
Mnd  /\  H  e.  Mnd )  /\  ( S  C_  B  /\  .0.  e.  S  /\  ( +g  `  H )  =  ( ( +g  `  G
)  |`  ( S  X.  S ) ) ) )  /\  ( a  e.  S  /\  b  e.  S ) )  -> 
( a  e.  S  /\  b  e.  S
) )
10 mndissubm.b . . . . . 6  |-  B  =  ( Base `  G
)
11 mndissubm.s . . . . . 6  |-  S  =  ( Base `  H
)
1210, 11mgmsscl 13063 . . . . 5  |-  ( ( ( G  e. Mgm  /\  H  e. Mgm )  /\  ( S  C_  B  /\  ( +g  `  H )  =  ( ( +g  `  G )  |`  ( S  X.  S ) ) )  /\  ( a  e.  S  /\  b  e.  S ) )  -> 
( a ( +g  `  G ) b )  e.  S )
136, 8, 9, 12syl3anc 1249 . . . 4  |-  ( ( ( ( G  e. 
Mnd  /\  H  e.  Mnd )  /\  ( S  C_  B  /\  .0.  e.  S  /\  ( +g  `  H )  =  ( ( +g  `  G
)  |`  ( S  X.  S ) ) ) )  /\  ( a  e.  S  /\  b  e.  S ) )  -> 
( a ( +g  `  G ) b )  e.  S )
1413ralrimivva 2579 . . 3  |-  ( ( ( G  e.  Mnd  /\  H  e.  Mnd )  /\  ( S  C_  B  /\  .0.  e.  S  /\  ( +g  `  H )  =  ( ( +g  `  G )  |`  ( S  X.  S ) ) ) )  ->  A. a  e.  S  A. b  e.  S  ( a
( +g  `  G ) b )  e.  S
)
15 mndissubm.z . . . . 5  |-  .0.  =  ( 0g `  G )
16 eqid 2196 . . . . 5  |-  ( +g  `  G )  =  ( +g  `  G )
1710, 15, 16issubm 13174 . . . 4  |-  ( G  e.  Mnd  ->  ( S  e.  (SubMnd `  G
)  <->  ( S  C_  B  /\  .0.  e.  S  /\  A. a  e.  S  A. b  e.  S  ( a ( +g  `  G ) b )  e.  S ) ) )
1817ad2antrr 488 . . 3  |-  ( ( ( G  e.  Mnd  /\  H  e.  Mnd )  /\  ( S  C_  B  /\  .0.  e.  S  /\  ( +g  `  H )  =  ( ( +g  `  G )  |`  ( S  X.  S ) ) ) )  ->  ( S  e.  (SubMnd `  G
)  <->  ( S  C_  B  /\  .0.  e.  S  /\  A. a  e.  S  A. b  e.  S  ( a ( +g  `  G ) b )  e.  S ) ) )
191, 2, 14, 18mpbir3and 1182 . 2  |-  ( ( ( G  e.  Mnd  /\  H  e.  Mnd )  /\  ( S  C_  B  /\  .0.  e.  S  /\  ( +g  `  H )  =  ( ( +g  `  G )  |`  ( S  X.  S ) ) ) )  ->  S  e.  (SubMnd `  G )
)
2019ex 115 1  |-  ( ( G  e.  Mnd  /\  H  e.  Mnd )  ->  ( ( S  C_  B  /\  .0.  e.  S  /\  ( +g  `  H
)  =  ( ( +g  `  G )  |`  ( S  X.  S
) ) )  ->  S  e.  (SubMnd `  G
) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 980    = wceq 1364    e. wcel 2167   A.wral 2475    C_ wss 3157    X. cxp 4662    |` cres 4666   ` cfv 5259  (class class class)co 5925   Basecbs 12703   +g cplusg 12780   0gc0g 12958  Mgmcmgm 13056   Mndcmnd 13118  SubMndcsubmnd 13160
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-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-cnex 7987  ax-resscn 7988  ax-1re 7990  ax-addrcl 7993
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-iota 5220  df-fun 5261  df-fn 5262  df-fv 5267  df-ov 5928  df-inn 9008  df-2 9066  df-ndx 12706  df-slot 12707  df-base 12709  df-plusg 12793  df-mgm 13058  df-sgrp 13104  df-mnd 13119  df-submnd 13162
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator