| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > submnd0 | 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. (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 | simpll 527 | . 2 ⊢ (((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆)) → 𝐺 ∈ Mnd) | |
| 2 | simprr 533 | . 2 ⊢ (((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆)) → 0 ∈ 𝑆) | |
| 3 | simprl 531 | . 2 ⊢ (((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆)) → 𝑆 ⊆ 𝐵) | |
| 4 | submnd0.h | . . 3 ⊢ 𝐻 = (𝐺 ↾s 𝑆) | |
| 5 | submnd0.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
| 6 | submnd0.z | . . 3 ⊢ 0 = (0g‘𝐺) | |
| 7 | 4, 5, 6 | ress0g 13525 | . 2 ⊢ ((𝐺 ∈ Mnd ∧ 0 ∈ 𝑆 ∧ 𝑆 ⊆ 𝐵) → 0 = (0g‘𝐻)) |
| 8 | 1, 2, 3, 7 | syl3anc 1273 | 1 ⊢ (((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝑆 ⊆ 𝐵 ∧ 0 ∈ 𝑆)) → 0 = (0g‘𝐻)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∈ wcel 2202 ⊆ wss 3200 ‘cfv 5326 (class class class)co 6017 Basecbs 13081 ↾s cress 13082 0gc0g 13338 Mndcmnd 13498 |
| 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-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8122 ax-resscn 8123 ax-1cn 8124 ax-1re 8125 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-addcom 8131 ax-addass 8133 ax-i2m1 8136 ax-0lt1 8137 ax-0id 8139 ax-rnegex 8140 ax-pre-ltirr 8143 ax-pre-ltadd 8147 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-iota 5286 df-fun 5328 df-fn 5329 df-fv 5334 df-riota 5970 df-ov 6020 df-oprab 6021 df-mpo 6022 df-pnf 8215 df-mnf 8216 df-ltxr 8218 df-inn 9143 df-2 9201 df-ndx 13084 df-slot 13085 df-base 13087 df-sets 13088 df-iress 13089 df-plusg 13172 df-0g 13340 df-mgm 13438 df-sgrp 13484 df-mnd 13499 |
| This theorem is referenced by: subm0 13564 |
| Copyright terms: Public domain | W3C validator |