Theorem rngqipring1 21269

Description: The ring unity of the product of the quotient with a two-sided ideal and the two-sided ideal, which both are rings. (Contributed by AV, 16-Mar-2025.)

Hypotheses

Ref	Expression
rngqiprngfu.r	⊢ (𝜑 → 𝑅 ∈ Rng)
rngqiprngfu.i	⊢ (𝜑 → 𝐼 ∈ (2Ideal‘𝑅))
rngqiprngfu.j	⊢ 𝐽 = (𝑅 ↾s 𝐼)
rngqiprngfu.u	⊢ (𝜑 → 𝐽 ∈ Ring)
rngqiprngfu.b	⊢ 𝐵 = (Base‘𝑅)
rngqiprngfu.t	⊢ · = (.r‘𝑅)
rngqiprngfu.1	⊢ 1 = (1r‘𝐽)
rngqiprngfu.g	⊢ ∼ = (𝑅 ~QG 𝐼)
rngqiprngfu.q	⊢ 𝑄 = (𝑅 /s ∼ )
rngqiprngfu.v	⊢ (𝜑 → 𝑄 ∈ Ring)
rngqiprngfu.e	⊢ (𝜑 → 𝐸 ∈ (1r‘𝑄))
rngqiprngfu.m	⊢ − = (-g‘𝑅)
rngqiprngfu.a	⊢ + = (+g‘𝑅)
rngqiprngfu.n	⊢ 𝑈 = ((𝐸 − ( 1 · 𝐸)) + 1 )
rngqipring1.p	⊢ 𝑃 = (𝑄 ×s 𝐽)

Assertion

Ref	Expression
rngqipring1	⊢ (𝜑 → (1r‘𝑃) = ⟨[𝐸] ∼ , 1 ⟩)

Proof of Theorem rngqipring1

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		rngqipring1.p	. . 3 ⊢ 𝑃 = (𝑄 ×s 𝐽)
2		rngqiprngfu.v	. . 3 ⊢ (𝜑 → 𝑄 ∈ Ring)
3		rngqiprngfu.u	. . 3 ⊢ (𝜑 → 𝐽 ∈ Ring)
4	1, 2, 3	xpsring1d 20267	. 2 ⊢ (𝜑 → (1r‘𝑃) = ⟨(1r‘𝑄), (1r‘𝐽)⟩)
5		rngqiprngfu.e	. . . . . . . . 9 ⊢ (𝜑 → 𝐸 ∈ (1r‘𝑄))
6	5	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐸 ∈ (1r‘𝑄))
7		eleq2 2823	. . . . . . . . . . 11 ⊢ ((1r‘𝑄) = [𝑥] ∼ → (𝐸 ∈ (1r‘𝑄) ↔ 𝐸 ∈ [𝑥] ∼ ))
8	7	adantl 481	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ (1r‘𝑄) = [𝑥] ∼ ) → (𝐸 ∈ (1r‘𝑄) ↔ 𝐸 ∈ [𝑥] ∼ ))
9		elecg 8677	. . . . . . . . . . . . 13 ⊢ ((𝐸 ∈ (1r‘𝑄) ∧ 𝑥 ∈ 𝐵) → (𝐸 ∈ [𝑥] ∼ ↔ 𝑥 ∼ 𝐸))
10	5, 9	sylan 580	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐸 ∈ [𝑥] ∼ ↔ 𝑥 ∼ 𝐸))
11		rngqiprngfu.r	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → 𝑅 ∈ Rng)
12		rngqiprngfu.i	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → 𝐼 ∈ (2Ideal‘𝑅))
13		rngqiprngfu.j	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 𝐽 = (𝑅 ↾s 𝐼)
14		ringrng 20218	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝐽 ∈ Ring → 𝐽 ∈ Rng)
15	3, 14	syl 17	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → 𝐽 ∈ Rng)
16	13, 15	eqeltrrid 2839	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → (𝑅 ↾s 𝐼) ∈ Rng)
17	11, 12, 16	rng2idlnsg 21219	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝐼 ∈ (NrmSGrp‘𝑅))
18		nsgsubg 19085	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐼 ∈ (NrmSGrp‘𝑅) → 𝐼 ∈ (SubGrp‘𝑅))
19	17, 18	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐼 ∈ (SubGrp‘𝑅))
20	19	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐼 ∈ (SubGrp‘𝑅))
21		rngqiprngfu.b	. . . . . . . . . . . . . . . . . 18 ⊢ 𝐵 = (Base‘𝑅)
22		rngqiprngfu.g	. . . . . . . . . . . . . . . . . 18 ⊢ ∼ = (𝑅 ~QG 𝐼)
23	21, 22	eqger 19105	. . . . . . . . . . . . . . . . 17 ⊢ (𝐼 ∈ (SubGrp‘𝑅) → ∼ Er 𝐵)
24	20, 23	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∼ Er 𝐵)
25		simpr 484	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵)
26	24, 25	erth 8687	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 ∼ 𝐸 ↔ [𝑥] ∼ = [𝐸] ∼ ))
27	26	biimpa 476	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑥 ∼ 𝐸) → [𝑥] ∼ = [𝐸] ∼ )
28	27	eqcomd 2740	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑥 ∼ 𝐸) → [𝐸] ∼ = [𝑥] ∼ )
29	28	ex 412	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 ∼ 𝐸 → [𝐸] ∼ = [𝑥] ∼ ))
30	10, 29	sylbid 240	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐸 ∈ [𝑥] ∼ → [𝐸] ∼ = [𝑥] ∼ ))
31	30	adantr 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ (1r‘𝑄) = [𝑥] ∼ ) → (𝐸 ∈ [𝑥] ∼ → [𝐸] ∼ = [𝑥] ∼ ))
32	8, 31	sylbid 240	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ (1r‘𝑄) = [𝑥] ∼ ) → (𝐸 ∈ (1r‘𝑄) → [𝐸] ∼ = [𝑥] ∼ ))
33	32	ex 412	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((1r‘𝑄) = [𝑥] ∼ → (𝐸 ∈ (1r‘𝑄) → [𝐸] ∼ = [𝑥] ∼ )))
34	6, 33	mpid 44	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((1r‘𝑄) = [𝑥] ∼ → [𝐸] ∼ = [𝑥] ∼ ))
35	34	imp 406	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ (1r‘𝑄) = [𝑥] ∼ ) → [𝐸] ∼ = [𝑥] ∼ )
36		simpr 484	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ (1r‘𝑄) = [𝑥] ∼ ) → (1r‘𝑄) = [𝑥] ∼ )
37	35, 36	eqtr4d 2772	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ (1r‘𝑄) = [𝑥] ∼ ) → [𝐸] ∼ = (1r‘𝑄))
38		rngqiprngfu.t	. . . . . 6 ⊢ · = (.r‘𝑅)
39		rngqiprngfu.1	. . . . . 6 ⊢ 1 = (1r‘𝐽)
40		rngqiprngfu.q	. . . . . 6 ⊢ 𝑄 = (𝑅 /s ∼ )
41	11, 12, 13, 3, 21, 38, 39, 22, 40, 2	rngqiprngfulem1 21264	. . . . 5 ⊢ (𝜑 → ∃𝑥 ∈ 𝐵 (1r‘𝑄) = [𝑥] ∼ )
42	37, 41	r19.29a 3142	. . . 4 ⊢ (𝜑 → [𝐸] ∼ = (1r‘𝑄))
43	42	eqcomd 2740	. . 3 ⊢ (𝜑 → (1r‘𝑄) = [𝐸] ∼ )
44	39	eqcomi 2743	. . . 4 ⊢ (1r‘𝐽) = 1
45	44	a1i 11	. . 3 ⊢ (𝜑 → (1r‘𝐽) = 1 )
46	43, 45	opeq12d 4835	. 2 ⊢ (𝜑 → ⟨(1r‘𝑄), (1r‘𝐽)⟩ = ⟨[𝐸] ∼ , 1 ⟩)
47	4, 46	eqtrd 2769	1 ⊢ (𝜑 → (1r‘𝑃) = ⟨[𝐸] ∼ , 1 ⟩)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541   ∈ wcel 2113  ⟨cop 4584   class class class wbr 5096  ‘cfv 6490  (class class class)co 7356   Er wer 8630  [cec 8631  Basecbs 17134   ↾_s cress 17155  +_gcplusg 17175  ._rcmulr 17176   /_s cqus 17424   ×_s cxps 17425  -_gcsg 18863  SubGrpcsubg 19048  NrmSGrpcnsg 19049   ~_QG cqg 19050  Rngcrng 20085  1_rcur 20114  Ringcrg 20166  2Idealc2idl 21202

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678  ax-cnex 11080  ax-resscn 11081  ax-1cn 11082  ax-icn 11083  ax-addcl 11084  ax-addrcl 11085  ax-mulcl 11086  ax-mulrcl 11087  ax-mulcom 11088  ax-addass 11089  ax-mulass 11090  ax-distr 11091  ax-i2m1 11092  ax-1ne0 11093  ax-1rid 11094  ax-rnegex 11095  ax-rrecex 11096  ax-cnre 11097  ax-pre-lttri 11098  ax-pre-lttrn 11099  ax-pre-ltadd 11100  ax-pre-mulgt0 11101

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-nel 3035  df-ral 3050  df-rex 3059  df-rmo 3348  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-tp 4583  df-op 4585  df-uni 4862  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-tr 5204  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-pred 6257  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-om 7807  df-1st 7931  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-1o 8395  df-2o 8396  df-er 8633  df-ec 8635  df-qs 8639  df-map 8763  df-ixp 8834  df-en 8882  df-dom 8883  df-sdom 8884  df-fin 8885  df-sup 9343  df-inf 9344  df-pnf 11166  df-mnf 11167  df-xr 11168  df-ltxr 11169  df-le 11170  df-sub 11364  df-neg 11365  df-nn 12144  df-2 12206  df-3 12207  df-4 12208  df-5 12209  df-6 12210  df-7 12211  df-8 12212  df-9 12213  df-n0 12400  df-z 12487  df-dec 12606  df-uz 12750  df-fz 13422  df-struct 17072  df-sets 17089  df-slot 17107  df-ndx 17119  df-base 17135  df-ress 17156  df-plusg 17188  df-mulr 17189  df-sca 17191  df-vsca 17192  df-ip 17193  df-tset 17194  df-ple 17195  df-ds 17197  df-hom 17199  df-cco 17200  df-0g 17359  df-prds 17365  df-imas 17427  df-qus 17428  df-xps 17429  df-mgm 18563  df-sgrp 18642  df-mnd 18658  df-grp 18864  df-minusg 18865  df-subg 19051  df-nsg 19052  df-eqg 19053  df-cmn 19709  df-abl 19710  df-mgp 20074  df-rng 20086  df-ur 20115  df-ring 20168  df-subrng 20477  df-lss 20881  df-sra 21123  df-rgmod 21124  df-lidl 21161  df-2idl 21203

This theorem is referenced by:  rngqiprngu  21271