| 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 14300 | . 2 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ⊆ (Base‘𝑅)) |
| 3 | eqid 2231 | . . 3 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 4 | 3 | subrg1cl 14307 | . 2 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑅) ∈ 𝐴) |
| 5 | subrgrcl 14304 | . . . 4 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring) | |
| 6 | eqid 2231 | . . . . 5 ⊢ (𝑅 ↾s 𝐴) = (𝑅 ↾s 𝐴) | |
| 7 | subrgsubm.1 | . . . . 5 ⊢ 𝑀 = (mulGrp‘𝑅) | |
| 8 | 6, 7 | mgpress 14008 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ∈ (SubRing‘𝑅)) → (𝑀 ↾s 𝐴) = (mulGrp‘(𝑅 ↾s 𝐴))) |
| 9 | 5, 8 | mpancom 422 | . . 3 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑀 ↾s 𝐴) = (mulGrp‘(𝑅 ↾s 𝐴))) |
| 10 | 6 | subrgring 14302 | . . . 4 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑅 ↾s 𝐴) ∈ Ring) |
| 11 | eqid 2231 | . . . . 5 ⊢ (mulGrp‘(𝑅 ↾s 𝐴)) = (mulGrp‘(𝑅 ↾s 𝐴)) | |
| 12 | 11 | ringmgp 14079 | . . . 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 14079 | . . . . 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 13619 | . . . . 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 14003 | . . . . . . 7 ⊢ (𝑅 ∈ Ring → (Base‘𝑅) = (Base‘𝑀)) |
| 23 | 22 | sseq2d 3258 | . . . . . 6 ⊢ (𝑅 ∈ Ring → (𝐴 ⊆ (Base‘𝑅) ↔ 𝐴 ⊆ (Base‘𝑀))) |
| 24 | 7, 3 | ringidvalg 14038 | . . . . . . 7 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) = (0g‘𝑀)) |
| 25 | 24 | eleq1d 2300 | . . . . . 6 ⊢ (𝑅 ∈ Ring → ((1r‘𝑅) ∈ 𝐴 ↔ (0g‘𝑀) ∈ 𝐴)) |
| 26 | 23, 25 | 3anbi12d 1350 | . . . . 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 1207 | 1 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ∈ (SubMnd‘𝑀)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∧ w3a 1005 = wceq 1398 ∈ wcel 2202 ⊆ wss 3201 ‘cfv 5333 (class class class)co 6028 Basecbs 13145 ↾s cress 13146 0gc0g 13402 Mndcmnd 13562 SubMndcsubmnd 13604 mulGrpcmgp 13997 1rcur 14036 Ringcrg 14073 SubRingcsubrg 14295 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-addcom 8175 ax-addass 8177 ax-i2m1 8180 ax-0lt1 8181 ax-0id 8183 ax-rnegex 8184 ax-pre-ltirr 8187 ax-pre-lttrn 8189 ax-pre-ltadd 8191 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-br 4094 df-opab 4156 df-mpt 4157 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-pnf 8258 df-mnf 8259 df-ltxr 8261 df-inn 9186 df-2 9244 df-3 9245 df-ndx 13148 df-slot 13149 df-base 13151 df-sets 13152 df-iress 13153 df-plusg 13236 df-mulr 13237 df-0g 13404 df-mgm 13502 df-sgrp 13548 df-mnd 13563 df-submnd 13606 df-mgp 13998 df-ur 14037 df-ring 14075 df-subrg 14297 |
| This theorem is referenced by: resrhm 14326 resrhm2b 14327 rhmima 14329 lgseisenlem4 15875 |
| Copyright terms: Public domain | W3C validator |