| 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 2229 | . . 3 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 2 | 1 | subrgss 14201 | . 2 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ⊆ (Base‘𝑅)) |
| 3 | eqid 2229 | . . 3 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 4 | 3 | subrg1cl 14208 | . 2 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑅) ∈ 𝐴) |
| 5 | subrgrcl 14205 | . . . 4 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring) | |
| 6 | eqid 2229 | . . . . 5 ⊢ (𝑅 ↾s 𝐴) = (𝑅 ↾s 𝐴) | |
| 7 | subrgsubm.1 | . . . . 5 ⊢ 𝑀 = (mulGrp‘𝑅) | |
| 8 | 6, 7 | mgpress 13909 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ∈ (SubRing‘𝑅)) → (𝑀 ↾s 𝐴) = (mulGrp‘(𝑅 ↾s 𝐴))) |
| 9 | 5, 8 | mpancom 422 | . . 3 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑀 ↾s 𝐴) = (mulGrp‘(𝑅 ↾s 𝐴))) |
| 10 | 6 | subrgring 14203 | . . . 4 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑅 ↾s 𝐴) ∈ Ring) |
| 11 | eqid 2229 | . . . . 5 ⊢ (mulGrp‘(𝑅 ↾s 𝐴)) = (mulGrp‘(𝑅 ↾s 𝐴)) | |
| 12 | 11 | ringmgp 13980 | . . . 4 ⊢ ((𝑅 ↾s 𝐴) ∈ Ring → (mulGrp‘(𝑅 ↾s 𝐴)) ∈ Mnd) |
| 13 | 10, 12 | syl 14 | . . 3 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (mulGrp‘(𝑅 ↾s 𝐴)) ∈ Mnd) |
| 14 | 9, 13 | eqeltrd 2306 | . 2 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑀 ↾s 𝐴) ∈ Mnd) |
| 15 | 7 | ringmgp 13980 | . . . . 5 ⊢ (𝑅 ∈ Ring → 𝑀 ∈ Mnd) |
| 16 | eqid 2229 | . . . . . 6 ⊢ (Base‘𝑀) = (Base‘𝑀) | |
| 17 | eqid 2229 | . . . . . 6 ⊢ (0g‘𝑀) = (0g‘𝑀) | |
| 18 | eqid 2229 | . . . . . 6 ⊢ (𝑀 ↾s 𝐴) = (𝑀 ↾s 𝐴) | |
| 19 | 16, 17, 18 | issubm2 13521 | . . . . 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 13904 | . . . . . . 7 ⊢ (𝑅 ∈ Ring → (Base‘𝑅) = (Base‘𝑀)) |
| 23 | 22 | sseq2d 3254 | . . . . . 6 ⊢ (𝑅 ∈ Ring → (𝐴 ⊆ (Base‘𝑅) ↔ 𝐴 ⊆ (Base‘𝑀))) |
| 24 | 7, 3 | ringidvalg 13939 | . . . . . . 7 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) = (0g‘𝑀)) |
| 25 | 24 | eleq1d 2298 | . . . . . 6 ⊢ (𝑅 ∈ Ring → ((1r‘𝑅) ∈ 𝐴 ↔ (0g‘𝑀) ∈ 𝐴)) |
| 26 | 23, 25 | 3anbi12d 1347 | . . . . 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 1204 | 1 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ∈ (SubMnd‘𝑀)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∧ w3a 1002 = wceq 1395 ∈ wcel 2200 ⊆ wss 3197 ‘cfv 5318 (class class class)co 6007 Basecbs 13047 ↾s cress 13048 0gc0g 13304 Mndcmnd 13464 SubMndcsubmnd 13506 mulGrpcmgp 13898 1rcur 13937 Ringcrg 13974 SubRingcsubrg 14196 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4202 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-cnex 8101 ax-resscn 8102 ax-1cn 8103 ax-1re 8104 ax-icn 8105 ax-addcl 8106 ax-addrcl 8107 ax-mulcl 8108 ax-addcom 8110 ax-addass 8112 ax-i2m1 8115 ax-0lt1 8116 ax-0id 8118 ax-rnegex 8119 ax-pre-ltirr 8122 ax-pre-lttrn 8124 ax-pre-ltadd 8126 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4384 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-pnf 8194 df-mnf 8195 df-ltxr 8197 df-inn 9122 df-2 9180 df-3 9181 df-ndx 13050 df-slot 13051 df-base 13053 df-sets 13054 df-iress 13055 df-plusg 13138 df-mulr 13139 df-0g 13306 df-mgm 13404 df-sgrp 13450 df-mnd 13465 df-submnd 13508 df-mgp 13899 df-ur 13938 df-ring 13976 df-subrg 14198 |
| This theorem is referenced by: resrhm 14227 resrhm2b 14228 rhmima 14230 lgseisenlem4 15767 |
| Copyright terms: Public domain | W3C validator |