| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > qus2idrng | Structured version Visualization version GIF version | ||
| Description: The quotient of a non-unital ring modulo a two-sided ideal, which is a subgroup of the additive group of the non-unital ring, is a non-unital ring (qusring 21464 analog). (Contributed by AV, 23-Feb-2025.) |
| Ref | Expression |
|---|---|
| qus2idrng.u | ⊢ 𝑈 = (𝑅 /s (𝑅 ~QG 𝑆)) |
| qus2idrng.i | ⊢ 𝐼 = (2Ideal‘𝑅) |
| Ref | Expression |
|---|---|
| qus2idrng | ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑈 ∈ Rng) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | qus2idrng.u | . . 3 ⊢ 𝑈 = (𝑅 /s (𝑅 ~QG 𝑆)) | |
| 2 | 1 | a1i 11 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑈 = (𝑅 /s (𝑅 ~QG 𝑆))) |
| 3 | eqidd 2766 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → (Base‘𝑅) = (Base‘𝑅)) | |
| 4 | eqid 2765 | . 2 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 5 | eqid 2765 | . 2 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 6 | simp3 1156 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑆 ∈ (SubGrp‘𝑅)) | |
| 7 | eqid 2765 | . . . 4 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 8 | eqid 2765 | . . . 4 ⊢ (𝑅 ~QG 𝑆) = (𝑅 ~QG 𝑆) | |
| 9 | 7, 8 | eqger 19290 | . . 3 ⊢ (𝑆 ∈ (SubGrp‘𝑅) → (𝑅 ~QG 𝑆) Er (Base‘𝑅)) |
| 10 | 6, 9 | syl 18 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → (𝑅 ~QG 𝑆) Er (Base‘𝑅)) |
| 11 | rngabl 20277 | . . . . . 6 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Abel) | |
| 12 | 11 | 3ad2ant1 1151 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑅 ∈ Abel) |
| 13 | ablnsg 19961 | . . . . 5 ⊢ (𝑅 ∈ Abel → (NrmSGrp‘𝑅) = (SubGrp‘𝑅)) | |
| 14 | 12, 13 | syl 18 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → (NrmSGrp‘𝑅) = (SubGrp‘𝑅)) |
| 15 | 6, 14 | eleqtrrd 2868 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑆 ∈ (NrmSGrp‘𝑅)) |
| 16 | 7, 8, 4 | eqgcpbl 19294 | . . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝑅) → ((𝑎(𝑅 ~QG 𝑆)𝑐 ∧ 𝑏(𝑅 ~QG 𝑆)𝑑) → (𝑎(+g‘𝑅)𝑏)(𝑅 ~QG 𝑆)(𝑐(+g‘𝑅)𝑑))) |
| 17 | 15, 16 | syl 18 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → ((𝑎(𝑅 ~QG 𝑆)𝑐 ∧ 𝑏(𝑅 ~QG 𝑆)𝑑) → (𝑎(+g‘𝑅)𝑏)(𝑅 ~QG 𝑆)(𝑐(+g‘𝑅)𝑑))) |
| 18 | qus2idrng.i | . . 3 ⊢ 𝐼 = (2Ideal‘𝑅) | |
| 19 | 7, 8, 18, 5 | 2idlcpblrng 21460 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → ((𝑎(𝑅 ~QG 𝑆)𝑐 ∧ 𝑏(𝑅 ~QG 𝑆)𝑑) → (𝑎(.r‘𝑅)𝑏)(𝑅 ~QG 𝑆)(𝑐(.r‘𝑅)𝑑))) |
| 20 | simp1 1154 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑅 ∈ Rng) | |
| 21 | 2, 3, 4, 5, 10, 17, 19, 20 | qusrng 20302 | 1 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑈 ∈ Rng) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 class class class wbr 5111 ‘cfv 6540 (class class class)co 7419 Er wer 8697 Basecbs 17291 +gcplusg 17332 .rcmulr 17333 /s cqus 17581 SubGrpcsubg 19230 NrmSGrpcnsg 19231 ~QG cqg 19232 Abelcabl 19895 Rngcrng 20274 2Idealc2idl 21438 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11171 ax-resscn 11172 ax-1cn 11173 ax-icn 11174 ax-addcl 11175 ax-addrcl 11176 ax-mulcl 11177 ax-mulrcl 11178 ax-mulcom 11179 ax-addass 11180 ax-mulass 11181 ax-distr 11182 ax-i2m1 11183 ax-1ne0 11184 ax-1rid 11185 ax-rnegex 11186 ax-rrecex 11187 ax-cnre 11188 ax-pre-lttri 11189 ax-pre-lttrn 11190 ax-pre-ltadd 11191 ax-pre-mulgt0 11192 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-1st 7992 df-2nd 7993 df-tpos 8228 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-er 8700 df-ec 8702 df-qs 8706 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-sup 9409 df-inf 9410 df-pnf 11260 df-mnf 11261 df-xr 11262 df-ltxr 11263 df-le 11264 df-sub 11458 df-neg 11459 df-nn 12249 df-2 12318 df-3 12319 df-4 12320 df-5 12321 df-6 12322 df-7 12323 df-8 12324 df-9 12325 df-n0 12520 df-z 12607 df-dec 12728 df-uz 12879 df-fz 13552 df-struct 17229 df-sets 17246 df-slot 17264 df-ndx 17276 df-base 17292 df-ress 17313 df-plusg 17345 df-mulr 17346 df-sca 17348 df-vsca 17349 df-ip 17350 df-tset 17351 df-ple 17352 df-ds 17354 df-0g 17516 df-imas 17584 df-qus 17585 df-mgm 18720 df-sgrp 18809 df-mnd 18825 df-grp 19047 df-minusg 19048 df-sbg 19049 df-subg 19233 df-nsg 19234 df-eqg 19235 df-cmn 19896 df-abl 19897 df-mgp 20261 df-rng 20275 df-oppr 20465 df-lss 21103 df-sra 21344 df-rgmod 21345 df-lidl 21382 df-2idl 21439 |
| This theorem is used by: rngqiprng 21486 rngqiprngimf1 21490 pzriprnglem13 21693 |
| Copyright terms: Public domain | W3C validator |