Theorem rngqipring1 21314

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 20313	. 2 ⊢ (𝜑 → (1r‘𝑃) = ⟨(1r‘𝑄), (1r‘𝐽)⟩)
5		rngqiprngfu.e	. . . . . . . . 9 ⊢ (𝜑 → 𝐸 ∈ (1r‘𝑄))
6	5	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐸 ∈ (1r‘𝑄))
7		eleq2 2825	. . . . . . . . . . 11 ⊢ ((1r‘𝑄) = [𝑥] ∼ → (𝐸 ∈ (1r‘𝑄) ↔ 𝐸 ∈ [𝑥] ∼ ))
8	7	adantl 481	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ (1r‘𝑄) = [𝑥] ∼ ) → (𝐸 ∈ (1r‘𝑄) ↔ 𝐸 ∈ [𝑥] ∼ ))
9		elecg 8688	. . . . . . . . . . . . 13 ⊢ ((𝐸 ∈ (1r‘𝑄) ∧ 𝑥 ∈ 𝐵) → (𝐸 ∈ [𝑥] ∼ ↔ 𝑥 ∼ 𝐸))
10	5, 9	sylan 581	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐸 ∈ [𝑥] ∼ ↔ 𝑥 ∼ 𝐸))
11		rngqiprngfu.r	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → 𝑅 ∈ Rng)
12		rngqiprngfu.i	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → 𝐼 ∈ (2Ideal‘𝑅))
13		rngqiprngfu.j	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 𝐽 = (𝑅 ↾s 𝐼)
14		ringrng 20266	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝐽 ∈ Ring → 𝐽 ∈ Rng)
15	3, 14	syl 17	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → 𝐽 ∈ Rng)
16	13, 15	eqeltrrid 2841	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → (𝑅 ↾s 𝐼) ∈ Rng)
17	11, 12, 16	rng2idlnsg 21264	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝐼 ∈ (NrmSGrp‘𝑅))
18		nsgsubg 19133	. . . . . . . . . . . . . . . . . . 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 19153	. . . . . . . . . . . . . . . . 17 ⊢ (𝐼 ∈ (SubGrp‘𝑅) → ∼ Er 𝐵)
24	20, 23	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∼ Er 𝐵)
25		simpr 484	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵)
26	24, 25	erth 8698	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 ∼ 𝐸 ↔ [𝑥] ∼ = [𝐸] ∼ ))
27	26	biimpa 476	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑥 ∼ 𝐸) → [𝑥] ∼ = [𝐸] ∼ )
28	27	eqcomd 2742	. . . . . . . . . . . . 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 2774	. . . . 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 21309	. . . . 5 ⊢ (𝜑 → ∃𝑥 ∈ 𝐵 (1r‘𝑄) = [𝑥] ∼ )
42	37, 41	r19.29a 3145	. . . 4 ⊢ (𝜑 → [𝐸] ∼ = (1r‘𝑄))
43	42	eqcomd 2742	. . 3 ⊢ (𝜑 → (1r‘𝑄) = [𝐸] ∼ )
44	39	eqcomi 2745	. . . 4 ⊢ (1r‘𝐽) = 1
45	44	a1i 11	. . 3 ⊢ (𝜑 → (1r‘𝐽) = 1 )
46	43, 45	opeq12d 4824	. 2 ⊢ (𝜑 → ⟨(1r‘𝑄), (1r‘𝐽)⟩ = ⟨[𝐸] ∼ , 1 ⟩)
47	4, 46	eqtrd 2771	1 ⊢ (𝜑 → (1r‘𝑃) = ⟨[𝐸] ∼ , 1 ⟩)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ⟨cop 4573   class class class wbr 5085  ‘cfv 6498  (class class class)co 7367   Er wer 8640  [cec 8641  Basecbs 17179   ↾_s cress 17200  +_gcplusg 17220  ._rcmulr 17221   /_s cqus 17469   ×_s cxps 17470  -_gcsg 18911  SubGrpcsubg 19096  NrmSGrpcnsg 19097   ~_QG cqg 19098  Rngcrng 20133  1_rcur 20162  Ringcrg 20214  2Idealc2idl 21247

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-1o 8405  df-2o 8406  df-er 8643  df-ec 8645  df-qs 8649  df-map 8775  df-ixp 8846  df-en 8894  df-dom 8895  df-sdom 8896  df-fin 8897  df-sup 9355  df-inf 9356  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-nn 12175  df-2 12244  df-3 12245  df-4 12246  df-5 12247  df-6 12248  df-7 12249  df-8 12250  df-9 12251  df-n0 12438  df-z 12525  df-dec 12645  df-uz 12789  df-fz 13462  df-struct 17117  df-sets 17134  df-slot 17152  df-ndx 17164  df-base 17180  df-ress 17201  df-plusg 17233  df-mulr 17234  df-sca 17236  df-vsca 17237  df-ip 17238  df-tset 17239  df-ple 17240  df-ds 17242  df-hom 17244  df-cco 17245  df-0g 17404  df-prds 17410  df-imas 17472  df-qus 17473  df-xps 17474  df-mgm 18608  df-sgrp 18687  df-mnd 18703  df-grp 18912  df-minusg 18913  df-subg 19099  df-nsg 19100  df-eqg 19101  df-cmn 19757  df-abl 19758  df-mgp 20122  df-rng 20134  df-ur 20163  df-ring 20216  df-subrng 20523  df-lss 20927  df-sra 21168  df-rgmod 21169  df-lidl 21206  df-2idl 21248

This theorem is referenced by:  rngqiprngu  21316