Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > submnd0 | Structured version Visualization version GIF version |
Description: The zero of a submonoid is the same as the zero in the parent monoid. (Note that we must add the condition that the zero of the parent monoid is actually contained in the submonoid, because it is possible to have "subsets that are monoids" which are not submonoids because they have a different identity element. See, for example, smndex1mnd 18549 and smndex1n0mnd 18551). (Contributed by Mario Carneiro, 10-Jan-2015.) |
Ref | Expression |
---|---|
submnd0.b | ⊢ 𝐵 = (Base‘𝐺) |
submnd0.z | ⊢ 0 = (0g‘𝐺) |
submnd0.h | ⊢ 𝐻 = (𝐺 ↾s 𝑆) |
Ref | Expression |
---|---|
submnd0 | ⊢ (((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆)) → 0 = (0g‘𝐻)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2738 | . 2 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
2 | eqid 2738 | . 2 ⊢ (0g‘𝐻) = (0g‘𝐻) | |
3 | eqid 2738 | . 2 ⊢ (+g‘𝐻) = (+g‘𝐻) | |
4 | simprr 770 | . . 3 ⊢ (((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆)) → 0 ∈ 𝑆) | |
5 | submnd0.h | . . . . 5 ⊢ 𝐻 = (𝐺 ↾s 𝑆) | |
6 | submnd0.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
7 | 5, 6 | ressbas2 16949 | . . . 4 ⊢ (𝑆 ⊆ 𝐵 → 𝑆 = (Base‘𝐻)) |
8 | 7 | ad2antrl 725 | . . 3 ⊢ (((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆)) → 𝑆 = (Base‘𝐻)) |
9 | 4, 8 | eleqtrd 2841 | . 2 ⊢ (((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆)) → 0 ∈ (Base‘𝐻)) |
10 | fvex 6787 | . . . . . . 7 ⊢ (Base‘𝐻) ∈ V | |
11 | 8, 10 | eqeltrdi 2847 | . . . . . 6 ⊢ (((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆)) → 𝑆 ∈ V) |
12 | 11 | adantr 481 | . . . . 5 ⊢ ((((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆)) ∧ 𝑥 ∈ (Base‘𝐻)) → 𝑆 ∈ V) |
13 | eqid 2738 | . . . . . 6 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
14 | 5, 13 | ressplusg 17000 | . . . . 5 ⊢ (𝑆 ∈ V → (+g‘𝐺) = (+g‘𝐻)) |
15 | 12, 14 | syl 17 | . . . 4 ⊢ ((((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆)) ∧ 𝑥 ∈ (Base‘𝐻)) → (+g‘𝐺) = (+g‘𝐻)) |
16 | 15 | oveqd 7292 | . . 3 ⊢ ((((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆)) ∧ 𝑥 ∈ (Base‘𝐻)) → ( 0 (+g‘𝐺)𝑥) = ( 0 (+g‘𝐻)𝑥)) |
17 | simpll 764 | . . . 4 ⊢ (((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆)) → 𝐺 ∈ Mnd) | |
18 | 5, 6 | ressbasss 16950 | . . . . 5 ⊢ (Base‘𝐻) ⊆ 𝐵 |
19 | 18 | sseli 3917 | . . . 4 ⊢ (𝑥 ∈ (Base‘𝐻) → 𝑥 ∈ 𝐵) |
20 | submnd0.z | . . . . 5 ⊢ 0 = (0g‘𝐺) | |
21 | 6, 13, 20 | mndlid 18405 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → ( 0 (+g‘𝐺)𝑥) = 𝑥) |
22 | 17, 19, 21 | syl2an 596 | . . 3 ⊢ ((((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆)) ∧ 𝑥 ∈ (Base‘𝐻)) → ( 0 (+g‘𝐺)𝑥) = 𝑥) |
23 | 16, 22 | eqtr3d 2780 | . 2 ⊢ ((((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆)) ∧ 𝑥 ∈ (Base‘𝐻)) → ( 0 (+g‘𝐻)𝑥) = 𝑥) |
24 | 15 | oveqd 7292 | . . 3 ⊢ ((((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆)) ∧ 𝑥 ∈ (Base‘𝐻)) → (𝑥(+g‘𝐺) 0 ) = (𝑥(+g‘𝐻) 0 )) |
25 | 6, 13, 20 | mndrid 18406 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → (𝑥(+g‘𝐺) 0 ) = 𝑥) |
26 | 17, 19, 25 | syl2an 596 | . . 3 ⊢ ((((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆)) ∧ 𝑥 ∈ (Base‘𝐻)) → (𝑥(+g‘𝐺) 0 ) = 𝑥) |
27 | 24, 26 | eqtr3d 2780 | . 2 ⊢ ((((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆)) ∧ 𝑥 ∈ (Base‘𝐻)) → (𝑥(+g‘𝐻) 0 ) = 𝑥) |
28 | 1, 2, 3, 9, 23, 27 | ismgmid2 18352 | 1 ⊢ (((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆)) → 0 = (0g‘𝐻)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 Vcvv 3432 ⊆ wss 3887 ‘cfv 6433 (class class class)co 7275 Basecbs 16912 ↾s cress 16941 +gcplusg 16962 0gc0g 17150 Mndcmnd 18385 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-er 8498 df-en 8734 df-dom 8735 df-sdom 8736 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-nn 11974 df-2 12036 df-sets 16865 df-slot 16883 df-ndx 16895 df-base 16913 df-ress 16942 df-plusg 16975 df-0g 17152 df-mgm 18326 df-sgrp 18375 df-mnd 18386 |
This theorem is referenced by: subm0 18454 xrge00 31295 gsumge0cl 43909 |
Copyright terms: Public domain | W3C validator |