| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rngqiprngho | Structured version Visualization version GIF version | ||
| Description: 𝐹 is a homomorphism of non-unital rings. (Contributed by AV, 21-Feb-2025.) |
| Ref | Expression |
|---|---|
| rng2idlring.r | ⊢ (𝜑 → 𝑅 ∈ Rng) |
| rng2idlring.i | ⊢ (𝜑 → 𝐼 ∈ (2Ideal‘𝑅)) |
| rng2idlring.j | ⊢ 𝐽 = (𝑅 ↾s 𝐼) |
| rng2idlring.u | ⊢ (𝜑 → 𝐽 ∈ Ring) |
| rng2idlring.b | ⊢ 𝐵 = (Base‘𝑅) |
| rng2idlring.t | ⊢ · = (.r‘𝑅) |
| rng2idlring.1 | ⊢ 1 = (1r‘𝐽) |
| rngqiprngim.g | ⊢ ∼ = (𝑅 ~QG 𝐼) |
| rngqiprngim.q | ⊢ 𝑄 = (𝑅 /s ∼ ) |
| rngqiprngim.c | ⊢ 𝐶 = (Base‘𝑄) |
| rngqiprngim.p | ⊢ 𝑃 = (𝑄 ×s 𝐽) |
| rngqiprngim.f | ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ 〈[𝑥] ∼ , ( 1 · 𝑥)〉) |
| Ref | Expression |
|---|---|
| rngqiprngho | ⊢ (𝜑 → 𝐹 ∈ (𝑅 RngHom 𝑃)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rng2idlring.r | . 2 ⊢ (𝜑 → 𝑅 ∈ Rng) | |
| 2 | rng2idlring.i | . . 3 ⊢ (𝜑 → 𝐼 ∈ (2Ideal‘𝑅)) | |
| 3 | rng2idlring.j | . . 3 ⊢ 𝐽 = (𝑅 ↾s 𝐼) | |
| 4 | rng2idlring.u | . . 3 ⊢ (𝜑 → 𝐽 ∈ Ring) | |
| 5 | rng2idlring.b | . . 3 ⊢ 𝐵 = (Base‘𝑅) | |
| 6 | rng2idlring.t | . . 3 ⊢ · = (.r‘𝑅) | |
| 7 | rng2idlring.1 | . . 3 ⊢ 1 = (1r‘𝐽) | |
| 8 | rngqiprngim.g | . . 3 ⊢ ∼ = (𝑅 ~QG 𝐼) | |
| 9 | rngqiprngim.q | . . 3 ⊢ 𝑄 = (𝑅 /s ∼ ) | |
| 10 | rngqiprngim.c | . . 3 ⊢ 𝐶 = (Base‘𝑄) | |
| 11 | rngqiprngim.p | . . 3 ⊢ 𝑃 = (𝑄 ×s 𝐽) | |
| 12 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 | rngqiprng 21407 | . 2 ⊢ (𝜑 → 𝑃 ∈ Rng) |
| 13 | rngqiprngim.f | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ 〈[𝑥] ∼ , ( 1 · 𝑥)〉) | |
| 14 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13 | rngqiprngghm 21410 | . . 3 ⊢ (𝜑 → 𝐹 ∈ (𝑅 GrpHom 𝑃)) |
| 15 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13 | rngqiprnglin 21413 | . . 3 ⊢ (𝜑 → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝐹‘(𝑎 · 𝑏)) = ((𝐹‘𝑎)(.r‘𝑃)(𝐹‘𝑏))) |
| 16 | 14, 15 | jca 520 | . 2 ⊢ (𝜑 → (𝐹 ∈ (𝑅 GrpHom 𝑃) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝐹‘(𝑎 · 𝑏)) = ((𝐹‘𝑎)(.r‘𝑃)(𝐹‘𝑏)))) |
| 17 | eqid 2769 | . . 3 ⊢ (.r‘𝑃) = (.r‘𝑃) | |
| 18 | 5, 6, 17 | isrnghm 20523 | . 2 ⊢ (𝐹 ∈ (𝑅 RngHom 𝑃) ↔ ((𝑅 ∈ Rng ∧ 𝑃 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑃) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝐹‘(𝑎 · 𝑏)) = ((𝐹‘𝑎)(.r‘𝑃)(𝐹‘𝑏))))) |
| 19 | 1, 12, 16, 18 | syl21anbrc 1361 | 1 ⊢ (𝜑 → 𝐹 ∈ (𝑅 RngHom 𝑃)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ∀wral 3085 〈cop 4600 ↦ cmpt 5196 ‘cfv 6537 (class class class)co 7411 [cec 8692 Basecbs 17269 ↾s cress 17290 .rcmulr 17311 /s cqus 17559 ×s cxps 17560 ~QG cqg 19188 GrpHom cghm 19283 Rngcrng 20230 1rcur 20263 Ringcrg 20315 RngHom crnghm 20516 2Idealc2idl 21359 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-tp 4599 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-1st 7986 df-2nd 7987 df-tpos 8222 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-2o 8454 df-er 8694 df-ec 8696 df-qs 8700 df-map 8826 df-ixp 8896 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-sup 9402 df-inf 9403 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-2 12303 df-3 12304 df-4 12305 df-5 12306 df-6 12307 df-7 12308 df-8 12309 df-9 12310 df-n0 12505 df-z 12592 df-dec 12712 df-uz 12863 df-fz 13536 df-struct 17207 df-sets 17224 df-slot 17242 df-ndx 17254 df-base 17270 df-ress 17291 df-plusg 17323 df-mulr 17324 df-sca 17326 df-vsca 17327 df-ip 17328 df-tset 17329 df-ple 17330 df-ds 17332 df-hom 17334 df-cco 17335 df-0g 17494 df-prds 17500 df-imas 17562 df-qus 17563 df-xps 17564 df-mgm 18698 df-sgrp 18777 df-mnd 18793 df-grp 19003 df-minusg 19004 df-sbg 19005 df-subg 19189 df-nsg 19190 df-eqg 19191 df-ghm 19284 df-cmn 19852 df-abl 19853 df-mgp 20217 df-rng 20231 df-ur 20264 df-ring 20317 df-oppr 20419 df-rnghm 20518 df-subrng 20631 df-lss 21031 df-sra 21272 df-rgmod 21273 df-lidl 21310 df-2idl 21360 |
| This theorem is referenced by: rngqiprngim 21415 |
| Copyright terms: Public domain | W3C validator |