MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mndissubm Structured version   Visualization version   GIF version

Theorem mndissubm 18734
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 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. Analogous to grpissubg 19078. (Contributed by AV, 17-Feb-2024.)
Hypotheses
Ref Expression
mndissubm.b 𝐵 = (Base‘𝐺)
mndissubm.s 𝑆 = (Base‘𝐻)
mndissubm.z 0 = (0g𝐺)
Assertion
Ref Expression
mndissubm ((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) → ((𝑆𝐵0𝑆 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) → 𝑆 ∈ (SubMnd‘𝐺)))

Proof of Theorem mndissubm
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr1 1196 . . 3 (((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆𝐵0𝑆 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → 𝑆𝐵)
2 simpr2 1197 . . 3 (((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆𝐵0𝑆 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → 0𝑆)
3 mndmgm 18668 . . . . . . 7 (𝐺 ∈ Mnd → 𝐺 ∈ Mgm)
4 mndmgm 18668 . . . . . . 7 (𝐻 ∈ Mnd → 𝐻 ∈ Mgm)
53, 4anim12i 614 . . . . . 6 ((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) → (𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm))
65ad2antrr 727 . . . . 5 ((((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆𝐵0𝑆 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ (𝑎𝑆𝑏𝑆)) → (𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm))
7 3simpb 1150 . . . . . 6 ((𝑆𝐵0𝑆 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) → (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))))
87ad2antlr 728 . . . . 5 ((((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆𝐵0𝑆 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ (𝑎𝑆𝑏𝑆)) → (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))))
9 simpr 484 . . . . 5 ((((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆𝐵0𝑆 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ (𝑎𝑆𝑏𝑆)) → (𝑎𝑆𝑏𝑆))
10 mndissubm.b . . . . . 6 𝐵 = (Base‘𝐺)
11 mndissubm.s . . . . . 6 𝑆 = (Base‘𝐻)
1210, 11mgmsscl 18572 . . . . 5 (((𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) ∧ (𝑎𝑆𝑏𝑆)) → (𝑎(+g𝐺)𝑏) ∈ 𝑆)
136, 8, 9, 12syl3anc 1374 . . . 4 ((((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆𝐵0𝑆 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ (𝑎𝑆𝑏𝑆)) → (𝑎(+g𝐺)𝑏) ∈ 𝑆)
1413ralrimivva 3178 . . 3 (((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆𝐵0𝑆 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → ∀𝑎𝑆𝑏𝑆 (𝑎(+g𝐺)𝑏) ∈ 𝑆)
15 mndissubm.z . . . . 5 0 = (0g𝐺)
16 eqid 2735 . . . . 5 (+g𝐺) = (+g𝐺)
1710, 15, 16issubm 18730 . . . 4 (𝐺 ∈ Mnd → (𝑆 ∈ (SubMnd‘𝐺) ↔ (𝑆𝐵0𝑆 ∧ ∀𝑎𝑆𝑏𝑆 (𝑎(+g𝐺)𝑏) ∈ 𝑆)))
1817ad2antrr 727 . . 3 (((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆𝐵0𝑆 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → (𝑆 ∈ (SubMnd‘𝐺) ↔ (𝑆𝐵0𝑆 ∧ ∀𝑎𝑆𝑏𝑆 (𝑎(+g𝐺)𝑏) ∈ 𝑆)))
191, 2, 14, 18mpbir3and 1344 . 2 (((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆𝐵0𝑆 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → 𝑆 ∈ (SubMnd‘𝐺))
2019ex 412 1 ((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) → ((𝑆𝐵0𝑆 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) → 𝑆 ∈ (SubMnd‘𝐺)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wcel 2114  wral 3050  wss 3900   × cxp 5621  cres 5625  cfv 6491  (class class class)co 7358  Basecbs 17138  +gcplusg 17179  0gc0g 17361  Mgmcmgm 18565  Mndcmnd 18661  SubMndcsubmnd 18709
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2183  ax-ext 2707  ax-sep 5240  ax-nul 5250  ax-pow 5309  ax-pr 5376
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-rab 3399  df-v 3441  df-sbc 3740  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-nul 4285  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-res 5635  df-iota 6447  df-fun 6493  df-fv 6499  df-ov 7361  df-mgm 18567  df-sgrp 18646  df-mnd 18662  df-submnd 18711
This theorem is referenced by:  resmndismnd  18735  submefmnd  18822
  Copyright terms: Public domain W3C validator