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

Theorem mndissubm 13050
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 13006 . . . . . . 7  |-  ( G  e.  Mnd  ->  G  e. Mgm )
4 mndmgm 13006 . . . . . . 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 12947 . . . . 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 2576 . . 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 2193 . . . . 5  |-  ( +g  `  G )  =  ( +g  `  G )
1710, 15, 16issubm 13047 . . . 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 2164   A.wral 2472    C_ wss 3154    X. cxp 4658    |` cres 4662   ` cfv 5255  (class class class)co 5919   Basecbs 12621   +g cplusg 12698   0gc0g 12870  Mgmcmgm 12940   Mndcmnd 13000  SubMndcsubmnd 13033
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-cnex 7965  ax-resscn 7966  ax-1re 7968  ax-addrcl 7971
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-un 3158  df-in 3160  df-ss 3167  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-iota 5216  df-fun 5257  df-fn 5258  df-fv 5263  df-ov 5922  df-inn 8985  df-2 9043  df-ndx 12624  df-slot 12625  df-base 12627  df-plusg 12711  df-mgm 12942  df-sgrp 12988  df-mnd 13001  df-submnd 13035
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator