| 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 14667 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 2233 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → (Base‘𝑅) = (Base‘𝑅)) | |
| 4 | eqid 2232 | . 2 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 5 | eqid 2232 | . 2 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 6 | simp3 1026 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑆 ∈ (SubGrp‘𝑅)) | |
| 7 | eqid 2232 | . . . 4 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 8 | eqid 2232 | . . . 4 ⊢ (𝑅 ~QG 𝑆) = (𝑅 ~QG 𝑆) | |
| 9 | 7, 8 | eqger 13933 | . . 3 ⊢ (𝑆 ∈ (SubGrp‘𝑅) → (𝑅 ~QG 𝑆) Er (Base‘𝑅)) |
| 10 | 6, 9 | syl 14 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → (𝑅 ~QG 𝑆) Er (Base‘𝑅)) |
| 11 | rngabl 14071 | . . . . . 6 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Abel) | |
| 12 | 11 | 3ad2ant1 1045 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑅 ∈ Abel) |
| 13 | ablnsg 14043 | . . . . 5 ⊢ (𝑅 ∈ Abel → (NrmSGrp‘𝑅) = (SubGrp‘𝑅)) | |
| 14 | 12, 13 | syl 14 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → (NrmSGrp‘𝑅) = (SubGrp‘𝑅)) |
| 15 | 6, 14 | eleqtrrd 2312 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑆 ∈ (NrmSGrp‘𝑅)) |
| 16 | 7, 8, 4 | eqgcpbl 13937 | . . 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 14663 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → ((𝑎(𝑅 ~QG 𝑆)𝑐 ∧ 𝑏(𝑅 ~QG 𝑆)𝑑) → (𝑎(.r‘𝑅)𝑏)(𝑅 ~QG 𝑆)(𝑐(.r‘𝑅)𝑑))) |
| 20 | simp1 1024 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑅 ∈ Rng) | |
| 21 | 2, 3, 4, 5, 10, 17, 19, 20 | qusrng 14094 | 1 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑈 ∈ Rng) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1005 = wceq 1398 ∈ wcel 2203 class class class wbr 4108 ‘cfv 5351 (class class class)co 6049 Er wer 6763 Basecbs 13204 +gcplusg 13282 .rcmulr 13283 /s cqus 13505 SubGrpcsubg 13876 NrmSGrpcnsg 13877 ~QG cqg 13878 Abelcabl 13994 Rngcrng 14068 2Idealc2idl 14639 |
| 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 2205 ax-14 2206 ax-ext 2214 ax-coll 4224 ax-sep 4227 ax-nul 4235 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-setind 4658 ax-cnex 8217 ax-resscn 8218 ax-1cn 8219 ax-1re 8220 ax-icn 8221 ax-addcl 8222 ax-addrcl 8223 ax-mulcl 8224 ax-addcom 8226 ax-addass 8228 ax-i2m1 8231 ax-0lt1 8232 ax-0id 8234 ax-rnegex 8235 ax-pre-ltirr 8238 ax-pre-lttrn 8240 ax-pre-ltadd 8242 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rmo 2528 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-nul 3508 df-pw 3670 df-sn 3694 df-pr 3695 df-tp 3696 df-op 3697 df-uni 3914 df-int 3949 df-iun 3992 df-br 4109 df-opab 4171 df-mpt 4172 df-id 4413 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-riota 6002 df-ov 6052 df-oprab 6053 df-mpo 6054 df-1st 6333 df-2nd 6334 df-tpos 6475 df-er 6766 df-ec 6768 df-qs 6772 df-pnf 8309 df-mnf 8310 df-ltxr 8312 df-inn 9237 df-2 9295 df-3 9296 df-4 9297 df-5 9298 df-6 9299 df-7 9300 df-8 9301 df-ndx 13207 df-slot 13208 df-base 13210 df-sets 13211 df-iress 13212 df-plusg 13295 df-mulr 13296 df-sca 13298 df-vsca 13299 df-ip 13300 df-0g 13463 df-iimas 13507 df-qus 13508 df-mgm 13561 df-sgrp 13607 df-mnd 13622 df-grp 13708 df-minusg 13709 df-sbg 13710 df-subg 13879 df-nsg 13880 df-eqg 13881 df-cmn 13995 df-abl 13996 df-mgp 14057 df-rng 14069 df-oppr 14204 df-lssm 14493 df-sra 14575 df-rgmod 14576 df-lidl 14609 df-2idl 14640 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |