| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > qus2idrng | 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 14971 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 9 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑈 = (𝑅 /s (𝑅 ~QG 𝑆))) |
| 3 | eqidd 2239 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → (Base‘𝑅) = (Base‘𝑅)) | |
| 4 | eqid 2238 | . 2 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 5 | eqid 2238 | . 2 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 6 | simp3 1030 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑆 ∈ (SubGrp‘𝑅)) | |
| 7 | eqid 2238 | . . . 4 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 8 | eqid 2238 | . . . 4 ⊢ (𝑅 ~QG 𝑆) = (𝑅 ~QG 𝑆) | |
| 9 | 7, 8 | eqger 14084 | . . 3 ⊢ (𝑆 ∈ (SubGrp‘𝑅) → (𝑅 ~QG 𝑆) Er (Base‘𝑅)) |
| 10 | 6, 9 | syl 14 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → (𝑅 ~QG 𝑆) Er (Base‘𝑅)) |
| 11 | rngabl 14339 | . . . . . 6 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Abel) | |
| 12 | 11 | 3ad2ant1 1049 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑅 ∈ Abel) |
| 13 | ablnsg 14226 | . . . . 5 ⊢ (𝑅 ∈ Abel → (NrmSGrp‘𝑅) = (SubGrp‘𝑅)) | |
| 14 | 12, 13 | syl 14 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → (NrmSGrp‘𝑅) = (SubGrp‘𝑅)) |
| 15 | 6, 14 | eleqtrrd 2318 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑆 ∈ (NrmSGrp‘𝑅)) |
| 16 | 7, 8, 4 | eqgcpbl 14088 | . . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝑅) → ((𝑎(𝑅 ~QG 𝑆)𝑐 ∧ 𝑏(𝑅 ~QG 𝑆)𝑑) → (𝑎(+g‘𝑅)𝑏)(𝑅 ~QG 𝑆)(𝑐(+g‘𝑅)𝑑))) |
| 17 | 15, 16 | syl 14 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → ((𝑎(𝑅 ~QG 𝑆)𝑐 ∧ 𝑏(𝑅 ~QG 𝑆)𝑑) → (𝑎(+g‘𝑅)𝑏)(𝑅 ~QG 𝑆)(𝑐(+g‘𝑅)𝑑))) |
| 18 | qus2idrng.i | . . 3 ⊢ 𝐼 = (2Ideal‘𝑅) | |
| 19 | 7, 8, 18, 5 | 2idlcpblrng 14967 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → ((𝑎(𝑅 ~QG 𝑆)𝑐 ∧ 𝑏(𝑅 ~QG 𝑆)𝑑) → (𝑎(.r‘𝑅)𝑏)(𝑅 ~QG 𝑆)(𝑐(.r‘𝑅)𝑑))) |
| 20 | simp1 1028 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑅 ∈ Rng) | |
| 21 | 2, 3, 4, 5, 10, 17, 19, 20 | qusrng 14362 | 1 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑈 ∈ Rng) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 class class class wbr 4131 ‘cfv 5380 (class class class)co 6088 Er wer 6809 Basecbs 13408 +gcplusg 13488 .rcmulr 13489 /s cqus 13680 SubGrpcsubg 14027 NrmSGrpcnsg 14028 ~QG cqg 14029 Abelcabl 14176 Rngcrng 14336 2Idealc2idl 14943 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4248 ax-sep 4251 ax-nul 4261 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-cnex 8275 ax-resscn 8276 ax-1cn 8277 ax-1re 8278 ax-icn 8279 ax-addcl 8280 ax-addrcl 8281 ax-mulcl 8282 ax-addcom 8284 ax-addass 8286 ax-i2m1 8289 ax-0lt1 8290 ax-0id 8292 ax-rnegex 8293 ax-pre-ltirr 8296 ax-pre-lttrn 8298 ax-pre-ltadd 8300 |
| This proof depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3715 df-pr 3716 df-tp 3717 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-1st 6378 df-2nd 6379 df-tpos 6521 df-er 6812 df-ec 6814 df-qs 6818 df-pnf 8367 df-mnf 8368 df-ltxr 8370 df-inn 9313 df-2 9371 df-3 9372 df-4 9373 df-5 9374 df-6 9375 df-7 9376 df-8 9377 df-ndx 13411 df-slot 13412 df-base 13414 df-sets 13415 df-iress 13416 df-plusg 13501 df-mulr 13502 df-sca 13504 df-vsca 13505 df-ip 13506 df-0g 13669 df-iimas 13681 df-qus 13682 df-mgm 13733 df-sgrp 13774 df-mnd 13787 df-grp 13865 df-minusg 13866 df-sbg 13867 df-subg 14030 df-nsg 14031 df-eqg 14032 df-cmn 14177 df-abl 14178 df-mgp 14323 df-rng 14337 df-oppr 14480 df-lssm 14797 df-sra 14879 df-rgmod 14880 df-lidl 14913 df-2idl 14944 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |