| 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 2206 | . . 3 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 2 | 1 | subrgss 14069 | . 2 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ⊆ (Base‘𝑅)) |
| 3 | eqid 2206 | . . 3 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 4 | 3 | subrg1cl 14076 | . 2 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑅) ∈ 𝐴) |
| 5 | subrgrcl 14073 | . . . 4 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring) | |
| 6 | eqid 2206 | . . . . 5 ⊢ (𝑅 ↾s 𝐴) = (𝑅 ↾s 𝐴) | |
| 7 | subrgsubm.1 | . . . . 5 ⊢ 𝑀 = (mulGrp‘𝑅) | |
| 8 | 6, 7 | mgpress 13778 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ∈ (SubRing‘𝑅)) → (𝑀 ↾s 𝐴) = (mulGrp‘(𝑅 ↾s 𝐴))) |
| 9 | 5, 8 | mpancom 422 | . . 3 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑀 ↾s 𝐴) = (mulGrp‘(𝑅 ↾s 𝐴))) |
| 10 | 6 | subrgring 14071 | . . . 4 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑅 ↾s 𝐴) ∈ Ring) |
| 11 | eqid 2206 | . . . . 5 ⊢ (mulGrp‘(𝑅 ↾s 𝐴)) = (mulGrp‘(𝑅 ↾s 𝐴)) | |
| 12 | 11 | ringmgp 13849 | . . . 4 ⊢ ((𝑅 ↾s 𝐴) ∈ Ring → (mulGrp‘(𝑅 ↾s 𝐴)) ∈ Mnd) |
| 13 | 10, 12 | syl 14 | . . 3 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (mulGrp‘(𝑅 ↾s 𝐴)) ∈ Mnd) |
| 14 | 9, 13 | eqeltrd 2283 | . 2 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑀 ↾s 𝐴) ∈ Mnd) |
| 15 | 7 | ringmgp 13849 | . . . . 5 ⊢ (𝑅 ∈ Ring → 𝑀 ∈ Mnd) |
| 16 | eqid 2206 | . . . . . 6 ⊢ (Base‘𝑀) = (Base‘𝑀) | |
| 17 | eqid 2206 | . . . . . 6 ⊢ (0g‘𝑀) = (0g‘𝑀) | |
| 18 | eqid 2206 | . . . . . 6 ⊢ (𝑀 ↾s 𝐴) = (𝑀 ↾s 𝐴) | |
| 19 | 16, 17, 18 | issubm2 13390 | . . . . 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 13773 | . . . . . . 7 ⊢ (𝑅 ∈ Ring → (Base‘𝑅) = (Base‘𝑀)) |
| 23 | 22 | sseq2d 3227 | . . . . . 6 ⊢ (𝑅 ∈ Ring → (𝐴 ⊆ (Base‘𝑅) ↔ 𝐴 ⊆ (Base‘𝑀))) |
| 24 | 7, 3 | ringidvalg 13808 | . . . . . . 7 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) = (0g‘𝑀)) |
| 25 | 24 | eleq1d 2275 | . . . . . 6 ⊢ (𝑅 ∈ Ring → ((1r‘𝑅) ∈ 𝐴 ↔ (0g‘𝑀) ∈ 𝐴)) |
| 26 | 23, 25 | 3anbi12d 1326 | . . . . 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 1183 | 1 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ∈ (SubMnd‘𝑀)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∧ w3a 981 = wceq 1373 ∈ wcel 2177 ⊆ wss 3170 ‘cfv 5285 (class class class)co 5962 Basecbs 12917 ↾s cress 12918 0gc0g 13173 Mndcmnd 13333 SubMndcsubmnd 13375 mulGrpcmgp 13767 1rcur 13806 Ringcrg 13843 SubRingcsubrg 14064 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-sep 4173 ax-pow 4229 ax-pr 4264 ax-un 4493 ax-setind 4598 ax-cnex 8046 ax-resscn 8047 ax-1cn 8048 ax-1re 8049 ax-icn 8050 ax-addcl 8051 ax-addrcl 8052 ax-mulcl 8053 ax-addcom 8055 ax-addass 8057 ax-i2m1 8060 ax-0lt1 8061 ax-0id 8063 ax-rnegex 8064 ax-pre-ltirr 8067 ax-pre-lttrn 8069 ax-pre-ltadd 8071 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-nel 2473 df-ral 2490 df-rex 2491 df-reu 2492 df-rmo 2493 df-rab 2494 df-v 2775 df-sbc 3003 df-csb 3098 df-dif 3172 df-un 3174 df-in 3176 df-ss 3183 df-nul 3465 df-pw 3623 df-sn 3644 df-pr 3645 df-op 3647 df-uni 3860 df-int 3895 df-br 4055 df-opab 4117 df-mpt 4118 df-id 4353 df-xp 4694 df-rel 4695 df-cnv 4696 df-co 4697 df-dm 4698 df-rn 4699 df-res 4700 df-ima 4701 df-iota 5246 df-fun 5287 df-fn 5288 df-fv 5293 df-riota 5917 df-ov 5965 df-oprab 5966 df-mpo 5967 df-pnf 8139 df-mnf 8140 df-ltxr 8142 df-inn 9067 df-2 9125 df-3 9126 df-ndx 12920 df-slot 12921 df-base 12923 df-sets 12924 df-iress 12925 df-plusg 13007 df-mulr 13008 df-0g 13175 df-mgm 13273 df-sgrp 13319 df-mnd 13334 df-submnd 13377 df-mgp 13768 df-ur 13807 df-ring 13845 df-subrg 14066 |
| This theorem is referenced by: resrhm 14095 resrhm2b 14096 rhmima 14098 lgseisenlem4 15635 |
| Copyright terms: Public domain | W3C validator |