| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > subrgsubm | GIF version | ||
| Description: A subring is a submonoid of the multiplicative monoid. (Contributed by Mario Carneiro, 15-Jun-2015.) |
| Ref | Expression |
|---|---|
| subrgsubm.1 | ⊢ 𝑀 = (mulGrp‘𝑅) |
| Ref | Expression |
|---|---|
| subrgsubm | ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ∈ (SubMnd‘𝑀)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2231 | . . 3 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 2 | 1 | subrgss 14235 | . 2 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ⊆ (Base‘𝑅)) |
| 3 | eqid 2231 | . . 3 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 4 | 3 | subrg1cl 14242 | . 2 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑅) ∈ 𝐴) |
| 5 | subrgrcl 14239 | . . . 4 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring) | |
| 6 | eqid 2231 | . . . . 5 ⊢ (𝑅 ↾s 𝐴) = (𝑅 ↾s 𝐴) | |
| 7 | subrgsubm.1 | . . . . 5 ⊢ 𝑀 = (mulGrp‘𝑅) | |
| 8 | 6, 7 | mgpress 13943 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ∈ (SubRing‘𝑅)) → (𝑀 ↾s 𝐴) = (mulGrp‘(𝑅 ↾s 𝐴))) |
| 9 | 5, 8 | mpancom 422 | . . 3 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑀 ↾s 𝐴) = (mulGrp‘(𝑅 ↾s 𝐴))) |
| 10 | 6 | subrgring 14237 | . . . 4 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑅 ↾s 𝐴) ∈ Ring) |
| 11 | eqid 2231 | . . . . 5 ⊢ (mulGrp‘(𝑅 ↾s 𝐴)) = (mulGrp‘(𝑅 ↾s 𝐴)) | |
| 12 | 11 | ringmgp 14014 | . . . 4 ⊢ ((𝑅 ↾s 𝐴) ∈ Ring → (mulGrp‘(𝑅 ↾s 𝐴)) ∈ Mnd) |
| 13 | 10, 12 | syl 14 | . . 3 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (mulGrp‘(𝑅 ↾s 𝐴)) ∈ Mnd) |
| 14 | 9, 13 | eqeltrd 2308 | . 2 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑀 ↾s 𝐴) ∈ Mnd) |
| 15 | 7 | ringmgp 14014 | . . . . 5 ⊢ (𝑅 ∈ Ring → 𝑀 ∈ Mnd) |
| 16 | eqid 2231 | . . . . . 6 ⊢ (Base‘𝑀) = (Base‘𝑀) | |
| 17 | eqid 2231 | . . . . . 6 ⊢ (0g‘𝑀) = (0g‘𝑀) | |
| 18 | eqid 2231 | . . . . . 6 ⊢ (𝑀 ↾s 𝐴) = (𝑀 ↾s 𝐴) | |
| 19 | 16, 17, 18 | issubm2 13555 | . . . . 5 ⊢ (𝑀 ∈ Mnd → (𝐴 ∈ (SubMnd‘𝑀) ↔ (𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ (𝑀 ↾s 𝐴) ∈ Mnd))) |
| 20 | 15, 19 | syl 14 | . . . 4 ⊢ (𝑅 ∈ Ring → (𝐴 ∈ (SubMnd‘𝑀) ↔ (𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ (𝑀 ↾s 𝐴) ∈ Mnd))) |
| 21 | 5, 20 | syl 14 | . . 3 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝐴 ∈ (SubMnd‘𝑀) ↔ (𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ (𝑀 ↾s 𝐴) ∈ Mnd))) |
| 22 | 7, 1 | mgpbasg 13938 | . . . . . . 7 ⊢ (𝑅 ∈ Ring → (Base‘𝑅) = (Base‘𝑀)) |
| 23 | 22 | sseq2d 3257 | . . . . . 6 ⊢ (𝑅 ∈ Ring → (𝐴 ⊆ (Base‘𝑅) ↔ 𝐴 ⊆ (Base‘𝑀))) |
| 24 | 7, 3 | ringidvalg 13973 | . . . . . . 7 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) = (0g‘𝑀)) |
| 25 | 24 | eleq1d 2300 | . . . . . 6 ⊢ (𝑅 ∈ Ring → ((1r‘𝑅) ∈ 𝐴 ↔ (0g‘𝑀) ∈ 𝐴)) |
| 26 | 23, 25 | 3anbi12d 1349 | . . . . 5 ⊢ (𝑅 ∈ Ring → ((𝐴 ⊆ (Base‘𝑅) ∧ (1r‘𝑅) ∈ 𝐴 ∧ (𝑀 ↾s 𝐴) ∈ Mnd) ↔ (𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ (𝑀 ↾s 𝐴) ∈ Mnd))) |
| 27 | 26 | bibi2d 232 | . . . 4 ⊢ (𝑅 ∈ Ring → ((𝐴 ∈ (SubMnd‘𝑀) ↔ (𝐴 ⊆ (Base‘𝑅) ∧ (1r‘𝑅) ∈ 𝐴 ∧ (𝑀 ↾s 𝐴) ∈ Mnd)) ↔ (𝐴 ∈ (SubMnd‘𝑀) ↔ (𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ (𝑀 ↾s 𝐴) ∈ Mnd)))) |
| 28 | 5, 27 | syl 14 | . . 3 ⊢ (𝐴 ∈ (SubRing‘𝑅) → ((𝐴 ∈ (SubMnd‘𝑀) ↔ (𝐴 ⊆ (Base‘𝑅) ∧ (1r‘𝑅) ∈ 𝐴 ∧ (𝑀 ↾s 𝐴) ∈ Mnd)) ↔ (𝐴 ∈ (SubMnd‘𝑀) ↔ (𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ (𝑀 ↾s 𝐴) ∈ Mnd)))) |
| 29 | 21, 28 | mpbird 167 | . 2 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝐴 ∈ (SubMnd‘𝑀) ↔ (𝐴 ⊆ (Base‘𝑅) ∧ (1r‘𝑅) ∈ 𝐴 ∧ (𝑀 ↾s 𝐴) ∈ Mnd))) |
| 30 | 2, 4, 14, 29 | mpbir3and 1206 | 1 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ∈ (SubMnd‘𝑀)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∧ w3a 1004 = wceq 1397 ∈ wcel 2202 ⊆ wss 3200 ‘cfv 5326 (class class class)co 6017 Basecbs 13081 ↾s cress 13082 0gc0g 13338 Mndcmnd 13498 SubMndcsubmnd 13540 mulGrpcmgp 13932 1rcur 13971 Ringcrg 14008 SubRingcsubrg 14230 |
| 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-lttrn 8145 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-ima 4738 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-3 9202 df-ndx 13084 df-slot 13085 df-base 13087 df-sets 13088 df-iress 13089 df-plusg 13172 df-mulr 13173 df-0g 13340 df-mgm 13438 df-sgrp 13484 df-mnd 13499 df-submnd 13542 df-mgp 13933 df-ur 13972 df-ring 14010 df-subrg 14232 |
| This theorem is referenced by: resrhm 14261 resrhm2b 14262 rhmima 14264 lgseisenlem4 15801 |
| Copyright terms: Public domain | W3C validator |