| 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 21478 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 2761 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → (Base‘𝑅) = (Base‘𝑅)) | |
| 4 | eqid 2760 | . 2 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 5 | eqid 2760 | . 2 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 6 | simp3 1156 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑆 ∈ (SubGrp‘𝑅)) | |
| 7 | eqid 2760 | . . . 4 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 8 | eqid 2760 | . . . 4 ⊢ (𝑅 ~QG 𝑆) = (𝑅 ~QG 𝑆) | |
| 9 | 7, 8 | eqger 19304 | . . 3 ⊢ (𝑆 ∈ (SubGrp‘𝑅) → (𝑅 ~QG 𝑆) Er (Base‘𝑅)) |
| 10 | 6, 9 | syl 18 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → (𝑅 ~QG 𝑆) Er (Base‘𝑅)) |
| 11 | rngabl 20291 | . . . . . 6 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Abel) | |
| 12 | 11 | 3ad2ant1 1151 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑅 ∈ Abel) |
| 13 | ablnsg 19975 | . . . . 5 ⊢ (𝑅 ∈ Abel → (NrmSGrp‘𝑅) = (SubGrp‘𝑅)) | |
| 14 | 12, 13 | syl 18 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → (NrmSGrp‘𝑅) = (SubGrp‘𝑅)) |
| 15 | 6, 14 | eleqtrrd 2863 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑆 ∈ (NrmSGrp‘𝑅)) |
| 16 | 7, 8, 4 | eqgcpbl 19308 | . . 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 21474 | . 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 20316 | 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 2145 class class class wbr 5103 ‘cfv 6533 (class class class)co 7414 Er wer 8694 Basecbs 17302 +gcplusg 17343 .rcmulr 17344 /s cqus 17592 SubGrpcsubg 19244 NrmSGrpcnsg 19245 ~QG cqg 19246 Abelcabl 19909 Rngcrng 20288 2Idealc2idl 21452 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11181 ax-resscn 11182 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-mulcom 11189 ax-addass 11190 ax-mulass 11191 ax-distr 11192 ax-i2m1 11193 ax-1ne0 11194 ax-1rid 11195 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 ax-pre-mulgt0 11202 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-1st 7987 df-2nd 7988 df-tpos 8225 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-1o 8456 df-er 8697 df-ec 8699 df-qs 8703 df-en 8954 df-dom 8955 df-sdom 8956 df-fin 8957 df-sup 9413 df-inf 9414 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 df-sub 11468 df-neg 11469 df-nn 12259 df-2 12328 df-3 12329 df-4 12330 df-5 12331 df-6 12332 df-7 12333 df-8 12334 df-9 12335 df-n0 12530 df-z 12617 df-dec 12738 df-uz 12889 df-fz 13563 df-struct 17240 df-sets 17257 df-slot 17275 df-ndx 17287 df-base 17303 df-ress 17324 df-plusg 17356 df-mulr 17357 df-sca 17359 df-vsca 17360 df-ip 17361 df-tset 17362 df-ple 17363 df-ds 17365 df-0g 17527 df-imas 17595 df-qus 17596 df-mgm 18731 df-sgrp 18822 df-mnd 18838 df-grp 19061 df-minusg 19062 df-sbg 19063 df-subg 19247 df-nsg 19248 df-eqg 19249 df-cmn 19910 df-abl 19911 df-mgp 20275 df-rng 20289 df-oppr 20479 df-lss 21117 df-sra 21358 df-rgmod 21359 df-lidl 21396 df-2idl 21453 |
| This theorem is used by: rngqiprng 21500 rngqiprngimf1 21504 pzriprnglem13 21707 |
| Copyright terms: Public domain | W3C validator |