| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rngcl | GIF version | ||
| Description: Closure of the multiplication operation of a non-unital ring. (Contributed by AV, 17-Apr-2020.) |
| Ref | Expression |
|---|---|
| rngcl.b | ⊢ 𝐵 = (Base‘𝑅) |
| rngcl.t | ⊢ · = (.r‘𝑅) |
| Ref | Expression |
|---|---|
| rngcl | ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 · 𝑌) ∈ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2231 | . . . . . 6 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅) | |
| 2 | 1 | rngmgp 14013 | . . . . 5 ⊢ (𝑅 ∈ Rng → (mulGrp‘𝑅) ∈ Smgrp) |
| 3 | sgrpmgm 13553 | . . . . 5 ⊢ ((mulGrp‘𝑅) ∈ Smgrp → (mulGrp‘𝑅) ∈ Mgm) | |
| 4 | 2, 3 | syl 14 | . . . 4 ⊢ (𝑅 ∈ Rng → (mulGrp‘𝑅) ∈ Mgm) |
| 5 | 4 | 3ad2ant1 1045 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (mulGrp‘𝑅) ∈ Mgm) |
| 6 | simp2 1025 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 7 | rngcl.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
| 8 | 1, 7 | mgpbasg 14003 | . . . . 5 ⊢ (𝑅 ∈ Rng → 𝐵 = (Base‘(mulGrp‘𝑅))) |
| 9 | 8 | 3ad2ant1 1045 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐵 = (Base‘(mulGrp‘𝑅))) |
| 10 | 6, 9 | eleqtrd 2310 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ (Base‘(mulGrp‘𝑅))) |
| 11 | simp3 1026 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 12 | 11, 9 | eleqtrd 2310 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ (Base‘(mulGrp‘𝑅))) |
| 13 | eqid 2231 | . . . 4 ⊢ (Base‘(mulGrp‘𝑅)) = (Base‘(mulGrp‘𝑅)) | |
| 14 | eqid 2231 | . . . 4 ⊢ (+g‘(mulGrp‘𝑅)) = (+g‘(mulGrp‘𝑅)) | |
| 15 | 13, 14 | mgmcl 13505 | . . 3 ⊢ (((mulGrp‘𝑅) ∈ Mgm ∧ 𝑋 ∈ (Base‘(mulGrp‘𝑅)) ∧ 𝑌 ∈ (Base‘(mulGrp‘𝑅))) → (𝑋(+g‘(mulGrp‘𝑅))𝑌) ∈ (Base‘(mulGrp‘𝑅))) |
| 16 | 5, 10, 12, 15 | syl3anc 1274 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋(+g‘(mulGrp‘𝑅))𝑌) ∈ (Base‘(mulGrp‘𝑅))) |
| 17 | rngcl.t | . . . . 5 ⊢ · = (.r‘𝑅) | |
| 18 | 1, 17 | mgpplusgg 14001 | . . . 4 ⊢ (𝑅 ∈ Rng → · = (+g‘(mulGrp‘𝑅))) |
| 19 | 18 | oveqd 6045 | . . 3 ⊢ (𝑅 ∈ Rng → (𝑋 · 𝑌) = (𝑋(+g‘(mulGrp‘𝑅))𝑌)) |
| 20 | 19 | 3ad2ant1 1045 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 · 𝑌) = (𝑋(+g‘(mulGrp‘𝑅))𝑌)) |
| 21 | 16, 20, 9 | 3eltr4d 2315 | 1 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 · 𝑌) ∈ 𝐵) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 1005 = wceq 1398 ∈ wcel 2202 ‘cfv 5333 (class class class)co 6028 Basecbs 13145 +gcplusg 13223 .rcmulr 13224 Mgmcmgm 13500 Smgrpcsgrp 13547 mulGrpcmgp 13997 Rngcrng 14009 |
| 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-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-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-iota 5293 df-fun 5335 df-fn 5336 df-fv 5341 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-plusg 13236 df-mulr 13237 df-mgm 13502 df-sgrp 13548 df-mgp 13998 df-rng 14010 |
| This theorem is referenced by: rnglz 14022 rngrz 14023 rngmneg1 14024 rngmneg2 14025 rngm2neg 14026 rngsubdi 14028 rngsubdir 14029 rngressid 14031 imasrng 14033 qusrng 14035 opprrng 14154 subrngmcl 14287 rnglidlmcl 14559 2idlcpblrng 14602 qusmulrng 14611 |
| Copyright terms: Public domain | W3C validator |