Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mndissubm | Structured version Visualization version GIF version |
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. Analogous to grpissubg 18690. (Contributed by AV, 17-Feb-2024.) |
Ref | Expression |
---|---|
mndissubm.b | ⊢ 𝐵 = (Base‘𝐺) |
mndissubm.s | ⊢ 𝑆 = (Base‘𝐻) |
mndissubm.z | ⊢ 0 = (0g‘𝐺) |
Ref | Expression |
---|---|
mndissubm | ⊢ ((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) → ((𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆 ∧ (+g‘𝐻) = ((+g‘𝐺) ↾ (𝑆 × 𝑆))) → 𝑆 ∈ (SubMnd‘𝐺))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpr1 1192 | . . 3 ⊢ (((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆 ∧ (+g‘𝐻) = ((+g‘𝐺) ↾ (𝑆 × 𝑆)))) → 𝑆 ⊆ 𝐵) | |
2 | simpr2 1193 | . . 3 ⊢ (((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆 ∧ (+g‘𝐻) = ((+g‘𝐺) ↾ (𝑆 × 𝑆)))) → 0 ∈ 𝑆) | |
3 | mndmgm 18307 | . . . . . . 7 ⊢ (𝐺 ∈ Mnd → 𝐺 ∈ Mgm) | |
4 | mndmgm 18307 | . . . . . . 7 ⊢ (𝐻 ∈ Mnd → 𝐻 ∈ Mgm) | |
5 | 3, 4 | anim12i 612 | . . . . . 6 ⊢ ((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) → (𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm)) |
6 | 5 | ad2antrr 722 | . . . . 5 ⊢ ((((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆 ∧ (+g‘𝐻) = ((+g‘𝐺) ↾ (𝑆 × 𝑆)))) ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝑆)) → (𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm)) |
7 | 3simpb 1147 | . . . . . 6 ⊢ ((𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆 ∧ (+g‘𝐻) = ((+g‘𝐺) ↾ (𝑆 × 𝑆))) → (𝑆 ⊆ 𝐵 ∧ (+g‘𝐻) = ((+g‘𝐺) ↾ (𝑆 × 𝑆)))) | |
8 | 7 | ad2antlr 723 | . . . . 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‘𝐻) | |
12 | 10, 11 | mgmsscl 18246 | . . . . 5 ⊢ (((𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm) ∧ (𝑆 ⊆ 𝐵 ∧ (+g‘𝐻) = ((+g‘𝐺) ↾ (𝑆 × 𝑆))) ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝑆)) → (𝑎(+g‘𝐺)𝑏) ∈ 𝑆) |
13 | 6, 8, 9, 12 | syl3anc 1369 | . . . 4 ⊢ ((((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆 ∧ (+g‘𝐻) = ((+g‘𝐺) ↾ (𝑆 × 𝑆)))) ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝑆)) → (𝑎(+g‘𝐺)𝑏) ∈ 𝑆) |
14 | 13 | ralrimivva 3114 | . . 3 ⊢ (((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆 ∧ (+g‘𝐻) = ((+g‘𝐺) ↾ (𝑆 × 𝑆)))) → ∀𝑎 ∈ 𝑆 ∀𝑏 ∈ 𝑆 (𝑎(+g‘𝐺)𝑏) ∈ 𝑆) |
15 | mndissubm.z | . . . . 5 ⊢ 0 = (0g‘𝐺) | |
16 | eqid 2738 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
17 | 10, 15, 16 | issubm 18357 | . . . 4 ⊢ (𝐺 ∈ Mnd → (𝑆 ∈ (SubMnd‘𝐺) ↔ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆 ∧ ∀𝑎 ∈ 𝑆 ∀𝑏 ∈ 𝑆 (𝑎(+g‘𝐺)𝑏) ∈ 𝑆))) |
18 | 17 | ad2antrr 722 | . . 3 ⊢ (((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆 ∧ (+g‘𝐻) = ((+g‘𝐺) ↾ (𝑆 × 𝑆)))) → (𝑆 ∈ (SubMnd‘𝐺) ↔ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆 ∧ ∀𝑎 ∈ 𝑆 ∀𝑏 ∈ 𝑆 (𝑎(+g‘𝐺)𝑏) ∈ 𝑆))) |
19 | 1, 2, 14, 18 | mpbir3and 1340 | . 2 ⊢ (((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆 ∧ (+g‘𝐻) = ((+g‘𝐺) ↾ (𝑆 × 𝑆)))) → 𝑆 ∈ (SubMnd‘𝐺)) |
20 | 19 | ex 412 | 1 ⊢ ((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) → ((𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆 ∧ (+g‘𝐻) = ((+g‘𝐺) ↾ (𝑆 × 𝑆))) → 𝑆 ∈ (SubMnd‘𝐺))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ∀wral 3063 ⊆ wss 3883 × cxp 5578 ↾ cres 5582 ‘cfv 6418 (class class class)co 7255 Basecbs 16840 +gcplusg 16888 0gc0g 17067 Mgmcmgm 18239 Mndcmnd 18300 SubMndcsubmnd 18344 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-sbc 3712 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-res 5592 df-iota 6376 df-fun 6420 df-fv 6426 df-ov 7258 df-mgm 18241 df-sgrp 18290 df-mnd 18301 df-submnd 18346 |
This theorem is referenced by: resmndismnd 18362 submefmnd 18449 |
Copyright terms: Public domain | W3C validator |