Theorem rngqiprngghm 21194

Description: 𝐹 is a homomorphism of the additive groups of non-unital rings. (Contributed by AV, 24-Feb-2025.)

Hypotheses

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 · 𝑥)⟩)

Assertion

Ref	Expression
rngqiprngghm	⊢ (𝜑 → 𝐹 ∈ (𝑅 GrpHom 𝑃))

Distinct variable groups:   𝑥,𝐶   𝑥,𝐼   𝑥,𝐵   𝜑,𝑥   𝑥, ∼   𝑥, 1   𝑥, ·   𝑥,𝑅

Allowed substitution hints:   𝑃(𝑥)   𝑄(𝑥)   𝐹(𝑥)   𝐽(𝑥)

Proof of Theorem rngqiprngghm

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rng2idlring.b	. 2 ⊢ 𝐵 = (Base‘𝑅)
2		eqid 2727	. 2 ⊢ (Base‘𝑃) = (Base‘𝑃)
3		eqid 2727	. 2 ⊢ (+g‘𝑅) = (+g‘𝑅)
4		eqid 2727	. 2 ⊢ (+g‘𝑃) = (+g‘𝑃)
5		rng2idlring.r	. . 3 ⊢ (𝜑 → 𝑅 ∈ Rng)
6		rnggrp 20103	. . 3 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp)
7	5, 6	syl 17	. 2 ⊢ (𝜑 → 𝑅 ∈ Grp)
8		rng2idlring.i	. . . 4 ⊢ (𝜑 → 𝐼 ∈ (2Ideal‘𝑅))
9		rng2idlring.j	. . . 4 ⊢ 𝐽 = (𝑅 ↾s 𝐼)
10		rng2idlring.u	. . . 4 ⊢ (𝜑 → 𝐽 ∈ Ring)
11		rng2idlring.t	. . . 4 ⊢ · = (.r‘𝑅)
12		rng2idlring.1	. . . 4 ⊢ 1 = (1r‘𝐽)
13		rngqiprngim.g	. . . 4 ⊢ ∼ = (𝑅 ~QG 𝐼)
14		rngqiprngim.q	. . . 4 ⊢ 𝑄 = (𝑅 /s ∼ )
15		rngqiprngim.c	. . . 4 ⊢ 𝐶 = (Base‘𝑄)
16		rngqiprngim.p	. . . 4 ⊢ 𝑃 = (𝑄 ×s 𝐽)
17	5, 8, 9, 10, 1, 11, 12, 13, 14, 15, 16	rngqiprng 21191	. . 3 ⊢ (𝜑 → 𝑃 ∈ Rng)
18		rnggrp 20103	. . 3 ⊢ (𝑃 ∈ Rng → 𝑃 ∈ Grp)
19	17, 18	syl 17	. 2 ⊢ (𝜑 → 𝑃 ∈ Grp)
20		rngqiprngim.f	. . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ ⟨[𝑥] ∼ , ( 1 · 𝑥)⟩)
21	5, 8, 9, 10, 1, 11, 12, 13, 14, 15, 16, 20	rngqiprngimf 21192	. . 3 ⊢ (𝜑 → 𝐹:𝐵⟶(𝐶 × 𝐼))
22	5, 8, 9, 10, 1, 11, 12, 13, 14, 15, 16	rngqipbas 21190	. . . 4 ⊢ (𝜑 → (Base‘𝑃) = (𝐶 × 𝐼))
23	22	feq3d 6712	. . 3 ⊢ (𝜑 → (𝐹:𝐵⟶(Base‘𝑃) ↔ 𝐹:𝐵⟶(𝐶 × 𝐼)))
24	21, 23	mpbird 256	. 2 ⊢ (𝜑 → 𝐹:𝐵⟶(Base‘𝑃))
25		ringrng 20226	. . . . . . . . 9 ⊢ (𝐽 ∈ Ring → 𝐽 ∈ Rng)
26	10, 25	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐽 ∈ Rng)
27	9, 26	eqeltrrid 2833	. . . . . . 7 ⊢ (𝜑 → (𝑅 ↾s 𝐼) ∈ Rng)
28	5, 8, 27	rng2idlnsg 21165	. . . . . 6 ⊢ (𝜑 → 𝐼 ∈ (NrmSGrp‘𝑅))
29	28, 1, 13, 14	ecqusaddd 19152	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → [(𝑎(+g‘𝑅)𝑏)] ∼ = ([𝑎] ∼ (+g‘𝑄)[𝑏] ∼ ))
30	5, 8, 9, 10, 1, 11, 12	rngqiprngghmlem3 21184	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ( 1 · (𝑎(+g‘𝑅)𝑏)) = (( 1 · 𝑎)(+g‘𝐽)( 1 · 𝑏)))
31	29, 30	opeq12d 4884	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ⟨[(𝑎(+g‘𝑅)𝑏)] ∼ , ( 1 · (𝑎(+g‘𝑅)𝑏))⟩ = ⟨([𝑎] ∼ (+g‘𝑄)[𝑏] ∼ ), (( 1 · 𝑎)(+g‘𝐽)( 1 · 𝑏))⟩)
32		eqid 2727	. . . . 5 ⊢ (Base‘𝑄) = (Base‘𝑄)
33		eqid 2727	. . . . 5 ⊢ (Base‘𝐽) = (Base‘𝐽)
34	14	ovexi 7458	. . . . . 6 ⊢ 𝑄 ∈ V
35	34	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → 𝑄 ∈ V)
36	10	adantr 479	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → 𝐽 ∈ Ring)
37		simpl 481	. . . . . 6 ⊢ ((𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → 𝑎 ∈ 𝐵)
38	13, 14, 1, 32	quseccl0 19145	. . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝑎 ∈ 𝐵) → [𝑎] ∼ ∈ (Base‘𝑄))
39	5, 37, 38	syl2an 594	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → [𝑎] ∼ ∈ (Base‘𝑄))
40	5, 8, 9, 10, 1, 11, 12	rngqiprngghmlem1 21182	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → ( 1 · 𝑎) ∈ (Base‘𝐽))
41	40	adantrr 715	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ( 1 · 𝑎) ∈ (Base‘𝐽))
42		simpr 483	. . . . . 6 ⊢ ((𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → 𝑏 ∈ 𝐵)
43	13, 14, 1, 32	quseccl0 19145	. . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝑏 ∈ 𝐵) → [𝑏] ∼ ∈ (Base‘𝑄))
44	5, 42, 43	syl2an 594	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → [𝑏] ∼ ∈ (Base‘𝑄))
45	5, 8, 9, 10, 1, 11, 12	rngqiprngghmlem1 21182	. . . . . 6 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → ( 1 · 𝑏) ∈ (Base‘𝐽))
46	45	adantrl 714	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ( 1 · 𝑏) ∈ (Base‘𝐽))
47	28, 1, 13, 14	ecqusaddcl 19153	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ([𝑎] ∼ (+g‘𝑄)[𝑏] ∼ ) ∈ (Base‘𝑄))
48	5, 8, 9, 10, 1, 11, 12	rngqiprngghmlem2 21183	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (( 1 · 𝑎)(+g‘𝐽)( 1 · 𝑏)) ∈ (Base‘𝐽))
49		eqid 2727	. . . . 5 ⊢ (+g‘𝑄) = (+g‘𝑄)
50		eqid 2727	. . . . 5 ⊢ (+g‘𝐽) = (+g‘𝐽)
51	16, 32, 33, 35, 36, 39, 41, 44, 46, 47, 48, 49, 50, 4	xpsadd 17561	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (⟨[𝑎] ∼ , ( 1 · 𝑎)⟩(+g‘𝑃)⟨[𝑏] ∼ , ( 1 · 𝑏)⟩) = ⟨([𝑎] ∼ (+g‘𝑄)[𝑏] ∼ ), (( 1 · 𝑎)(+g‘𝐽)( 1 · 𝑏))⟩)
52	31, 51	eqtr4d 2770	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ⟨[(𝑎(+g‘𝑅)𝑏)] ∼ , ( 1 · (𝑎(+g‘𝑅)𝑏))⟩ = (⟨[𝑎] ∼ , ( 1 · 𝑎)⟩(+g‘𝑃)⟨[𝑏] ∼ , ( 1 · 𝑏)⟩))
53	5	adantr 479	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → 𝑅 ∈ Rng)
54	37	adantl 480	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → 𝑎 ∈ 𝐵)
55	42	adantl 480	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → 𝑏 ∈ 𝐵)
56	1, 3	rngacl 20107	. . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎(+g‘𝑅)𝑏) ∈ 𝐵)
57	53, 54, 55, 56	syl3anc 1368	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎(+g‘𝑅)𝑏) ∈ 𝐵)
58	5, 8, 9, 10, 1, 11, 12, 13, 14, 15, 16, 20	rngqiprngimfv 21193	. . . 4 ⊢ ((𝜑 ∧ (𝑎(+g‘𝑅)𝑏) ∈ 𝐵) → (𝐹‘(𝑎(+g‘𝑅)𝑏)) = ⟨[(𝑎(+g‘𝑅)𝑏)] ∼ , ( 1 · (𝑎(+g‘𝑅)𝑏))⟩)
59	57, 58	syldan 589	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝐹‘(𝑎(+g‘𝑅)𝑏)) = ⟨[(𝑎(+g‘𝑅)𝑏)] ∼ , ( 1 · (𝑎(+g‘𝑅)𝑏))⟩)
60	5, 8, 9, 10, 1, 11, 12, 13, 14, 15, 16, 20	rngqiprngimfv 21193	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → (𝐹‘𝑎) = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩)
61	60	adantrr 715	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝐹‘𝑎) = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩)
62	5, 8, 9, 10, 1, 11, 12, 13, 14, 15, 16, 20	rngqiprngimfv 21193	. . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (𝐹‘𝑏) = ⟨[𝑏] ∼ , ( 1 · 𝑏)⟩)
63	62	adantrl 714	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝐹‘𝑏) = ⟨[𝑏] ∼ , ( 1 · 𝑏)⟩)
64	61, 63	oveq12d 7442	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ((𝐹‘𝑎)(+g‘𝑃)(𝐹‘𝑏)) = (⟨[𝑎] ∼ , ( 1 · 𝑎)⟩(+g‘𝑃)⟨[𝑏] ∼ , ( 1 · 𝑏)⟩))
65	52, 59, 64	3eqtr4d 2777	. 2 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝐹‘(𝑎(+g‘𝑅)𝑏)) = ((𝐹‘𝑎)(+g‘𝑃)(𝐹‘𝑏)))
66	1, 2, 3, 4, 7, 19, 24, 65	isghmd 19184	1 ⊢ (𝜑 → 𝐹 ∈ (𝑅 GrpHom 𝑃))

Syntax hints:   → wi 4   ∧ wa 394   = wceq 1533   ∈ wcel 2098  Vcvv 3471  ⟨cop 4636   ↦ cmpt 5233   × cxp 5678  ⟶wf 6547  ‘cfv 6551  (class class class)co 7424  [cec 8727  Basecbs 17185   ↾_s cress 17214  +_gcplusg 17238  ._rcmulr 17239   /_s cqus 17492   ×_s cxps 17493  Grpcgrp 18895   ~_QG cqg 19082   GrpHom cghm 19172  Rngcrng 20097  1_rcur 20126  Ringcrg 20178  2Idealc2idl 21148

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2698  ax-rep 5287  ax-sep 5301  ax-nul 5308  ax-pow 5367  ax-pr 5431  ax-un 7744  ax-cnex 11200  ax-resscn 11201  ax-1cn 11202  ax-icn 11203  ax-addcl 11204  ax-addrcl 11205  ax-mulcl 11206  ax-mulrcl 11207  ax-mulcom 11208  ax-addass 11209  ax-mulass 11210  ax-distr 11211  ax-i2m1 11212  ax-1ne0 11213  ax-1rid 11214  ax-rnegex 11215  ax-rrecex 11216  ax-cnre 11217  ax-pre-lttri 11218  ax-pre-lttrn 11219  ax-pre-ltadd 11220  ax-pre-mulgt0 11221

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2529  df-eu 2558  df-clab 2705  df-cleq 2719  df-clel 2805  df-nfc 2880  df-ne 2937  df-nel 3043  df-ral 3058  df-rex 3067  df-rmo 3372  df-reu 3373  df-rab 3429  df-v 3473  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4325  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-tp 4635  df-op 4637  df-uni 4911  df-iun 5000  df-br 5151  df-opab 5213  df-mpt 5234  df-tr 5268  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5635  df-we 5637  df-xp 5686  df-rel 5687  df-cnv 5688  df-co 5689  df-dm 5690  df-rn 5691  df-res 5692  df-ima 5693  df-pred 6308  df-ord 6375  df-on 6376  df-lim 6377  df-suc 6378  df-iota 6503  df-fun 6553  df-fn 6554  df-f 6555  df-f1 6556  df-fo 6557  df-f1o 6558  df-fv 6559  df-riota 7380  df-ov 7427  df-oprab 7428  df-mpo 7429  df-om 7875  df-1st 7997  df-2nd 7998  df-tpos 8236  df-frecs 8291  df-wrecs 8322  df-recs 8396  df-rdg 8435  df-1o 8491  df-2o 8492  df-er 8729  df-ec 8731  df-qs 8735  df-map 8851  df-ixp 8921  df-en 8969  df-dom 8970  df-sdom 8971  df-fin 8972  df-sup 9471  df-inf 9472  df-pnf 11286  df-mnf 11287  df-xr 11288  df-ltxr 11289  df-le 11290  df-sub 11482  df-neg 11483  df-nn 12249  df-2 12311  df-3 12312  df-4 12313  df-5 12314  df-6 12315  df-7 12316  df-8 12317  df-9 12318  df-n0 12509  df-z 12595  df-dec 12714  df-uz 12859  df-fz 13523  df-struct 17121  df-sets 17138  df-slot 17156  df-ndx 17168  df-base 17186  df-ress 17215  df-plusg 17251  df-mulr 17252  df-sca 17254  df-vsca 17255  df-ip 17256  df-tset 17257  df-ple 17258  df-ds 17260  df-hom 17262  df-cco 17263  df-0g 17428  df-prds 17434  df-imas 17495  df-qus 17496  df-xps 17497  df-mgm 18605  df-sgrp 18684  df-mnd 18700  df-grp 18898  df-minusg 18899  df-sbg 18900  df-subg 19083  df-nsg 19084  df-eqg 19085  df-ghm 19173  df-cmn 19742  df-abl 19743  df-mgp 20080  df-rng 20098  df-ur 20127  df-ring 20180  df-oppr 20278  df-subrng 20488  df-lss 20821  df-sra 21063  df-rgmod 21064  df-lidl 21109  df-2idl 21149

This theorem is referenced by:  rngqiprngimf1  21195  rngqiprngho  21198

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »