| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > srgcl | GIF version | ||
| Description: Closure of the multiplication operation of a semiring. (Contributed by NM, 26-Aug-2011.) (Revised by Mario Carneiro, 6-Jan-2015.) (Revised by Thierry Arnoux, 1-Apr-2018.) |
| Ref | Expression |
|---|---|
| srgcl.b | ⊢ 𝐵 = (Base‘𝑅) |
| srgcl.t | ⊢ · = (.r‘𝑅) |
| Ref | Expression |
|---|---|
| srgcl | ⊢ ((𝑅 ∈ SRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 · 𝑌) ∈ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2230 | . . . . 5 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅) | |
| 2 | 1 | srgmgp 14005 | . . . 4 ⊢ (𝑅 ∈ SRing → (mulGrp‘𝑅) ∈ Mnd) |
| 3 | 2 | 3ad2ant1 1044 | . . 3 ⊢ ((𝑅 ∈ SRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (mulGrp‘𝑅) ∈ Mnd) |
| 4 | simp2 1024 | . . . 4 ⊢ ((𝑅 ∈ SRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 5 | srgcl.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
| 6 | 1, 5 | mgpbasg 13963 | . . . . 5 ⊢ (𝑅 ∈ SRing → 𝐵 = (Base‘(mulGrp‘𝑅))) |
| 7 | 6 | 3ad2ant1 1044 | . . . 4 ⊢ ((𝑅 ∈ SRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐵 = (Base‘(mulGrp‘𝑅))) |
| 8 | 4, 7 | eleqtrd 2309 | . . 3 ⊢ ((𝑅 ∈ SRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ (Base‘(mulGrp‘𝑅))) |
| 9 | simp3 1025 | . . . 4 ⊢ ((𝑅 ∈ SRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 10 | 9, 7 | eleqtrd 2309 | . . 3 ⊢ ((𝑅 ∈ SRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ (Base‘(mulGrp‘𝑅))) |
| 11 | eqid 2230 | . . . 4 ⊢ (Base‘(mulGrp‘𝑅)) = (Base‘(mulGrp‘𝑅)) | |
| 12 | eqid 2230 | . . . 4 ⊢ (+g‘(mulGrp‘𝑅)) = (+g‘(mulGrp‘𝑅)) | |
| 13 | 11, 12 | mndcl 13529 | . . 3 ⊢ (((mulGrp‘𝑅) ∈ Mnd ∧ 𝑋 ∈ (Base‘(mulGrp‘𝑅)) ∧ 𝑌 ∈ (Base‘(mulGrp‘𝑅))) → (𝑋(+g‘(mulGrp‘𝑅))𝑌) ∈ (Base‘(mulGrp‘𝑅))) |
| 14 | 3, 8, 10, 13 | syl3anc 1273 | . 2 ⊢ ((𝑅 ∈ SRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋(+g‘(mulGrp‘𝑅))𝑌) ∈ (Base‘(mulGrp‘𝑅))) |
| 15 | srgcl.t | . . . . 5 ⊢ · = (.r‘𝑅) | |
| 16 | 1, 15 | mgpplusgg 13961 | . . . 4 ⊢ (𝑅 ∈ SRing → · = (+g‘(mulGrp‘𝑅))) |
| 17 | 16 | 3ad2ant1 1044 | . . 3 ⊢ ((𝑅 ∈ SRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → · = (+g‘(mulGrp‘𝑅))) |
| 18 | 17 | oveqd 6040 | . 2 ⊢ ((𝑅 ∈ SRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 · 𝑌) = (𝑋(+g‘(mulGrp‘𝑅))𝑌)) |
| 19 | 14, 18, 7 | 3eltr4d 2314 | 1 ⊢ ((𝑅 ∈ SRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 · 𝑌) ∈ 𝐵) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 1004 = wceq 1397 ∈ wcel 2201 ‘cfv 5328 (class class class)co 6023 Basecbs 13105 +gcplusg 13183 .rcmulr 13184 Mndcmnd 13522 mulGrpcmgp 13957 SRingcsrg 14000 |
| 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 2203 ax-14 2204 ax-ext 2212 ax-sep 4208 ax-pow 4266 ax-pr 4301 ax-un 4532 ax-setind 4637 ax-cnex 8128 ax-resscn 8129 ax-1cn 8130 ax-1re 8131 ax-icn 8132 ax-addcl 8133 ax-addrcl 8134 ax-mulcl 8135 ax-addcom 8137 ax-addass 8139 ax-i2m1 8142 ax-0lt1 8143 ax-0id 8145 ax-rnegex 8146 ax-pre-ltirr 8149 ax-pre-ltadd 8153 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ne 2402 df-nel 2497 df-ral 2514 df-rex 2515 df-rab 2518 df-v 2803 df-sbc 3031 df-csb 3127 df-dif 3201 df-un 3203 df-in 3205 df-ss 3212 df-nul 3494 df-pw 3655 df-sn 3676 df-pr 3677 df-op 3679 df-uni 3895 df-int 3930 df-br 4090 df-opab 4152 df-mpt 4153 df-id 4392 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 df-res 4739 df-iota 5288 df-fun 5330 df-fn 5331 df-fv 5336 df-riota 5976 df-ov 6026 df-oprab 6027 df-mpo 6028 df-pnf 8221 df-mnf 8222 df-ltxr 8224 df-inn 9149 df-2 9207 df-3 9208 df-ndx 13108 df-slot 13109 df-base 13111 df-sets 13112 df-plusg 13196 df-mulr 13197 df-0g 13364 df-mgm 13462 df-sgrp 13508 df-mnd 13523 df-mgp 13958 df-srg 14001 |
| This theorem is referenced by: srgfcl 14010 srgmulgass 14026 srgpcomppsc 14029 srglmhm 14030 srgrmhm 14031 dvdsrvald 14131 dvdsrd 14132 dvdsrex 14136 |
| Copyright terms: Public domain | W3C validator |