Theorem rngqipring1 21387

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 20383	. 2 ⊢ (𝜑 → (1r‘𝑃) = ⟨(1r‘𝑄), (1r‘𝐽)⟩)
5		rngqiprngfu.e	. . . . . . . . 9 ⊢ (𝜑 → 𝐸 ∈ (1r‘𝑄))
6	5	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐸 ∈ (1r‘𝑄))
7		eleq2 2852	. . . . . . . . . . 11 ⊢ ((1r‘𝑄) = [𝑥] ∼ → (𝐸 ∈ (1r‘𝑄) ↔ 𝐸 ∈ [𝑥] ∼ ))
8	7	adantl 485	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ (1r‘𝑄) = [𝑥] ∼ ) → (𝐸 ∈ (1r‘𝑄) ↔ 𝐸 ∈ [𝑥] ∼ ))
9		elecg 8724	. . . . . . . . . . . . 13 ⊢ ((𝐸 ∈ (1r‘𝑄) ∧ 𝑥 ∈ 𝐵) → (𝐸 ∈ [𝑥] ∼ ↔ 𝑥 ∼ 𝐸))
10	5, 9	sylan 589	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐸 ∈ [𝑥] ∼ ↔ 𝑥 ∼ 𝐸))
11		rngqiprngfu.r	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → 𝑅 ∈ Rng)
12		rngqiprngfu.i	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → 𝐼 ∈ (2Ideal‘𝑅))
13		rngqiprngfu.j	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 𝐽 = (𝑅 ↾s 𝐼)
14		ringrng 20336	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝐽 ∈ Ring → 𝐽 ∈ Rng)
15	3, 14	syl 17	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → 𝐽 ∈ Rng)
16	13, 15	eqeltrrid 2868	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → (𝑅 ↾s 𝐼) ∈ Rng)
17	11, 12, 16	rng2idlnsg 21337	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝐼 ∈ (NrmSGrp‘𝑅))
18		nsgsubg 19200	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐼 ∈ (NrmSGrp‘𝑅) → 𝐼 ∈ (SubGrp‘𝑅))
19	17, 18	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐼 ∈ (SubGrp‘𝑅))
20	19	adantr 484	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐼 ∈ (SubGrp‘𝑅))
21		rngqiprngfu.b	. . . . . . . . . . . . . . . . . 18 ⊢ 𝐵 = (Base‘𝑅)
22		rngqiprngfu.g	. . . . . . . . . . . . . . . . . 18 ⊢ ∼ = (𝑅 ~QG 𝐼)
23	21, 22	eqger 19220	. . . . . . . . . . . . . . . . 17 ⊢ (𝐼 ∈ (SubGrp‘𝑅) → ∼ Er 𝐵)
24	20, 23	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∼ Er 𝐵)
25		simpr 488	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵)
26	24, 25	erth 8734	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 ∼ 𝐸 ↔ [𝑥] ∼ = [𝐸] ∼ ))
27	26	biimpa 480	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑥 ∼ 𝐸) → [𝑥] ∼ = [𝐸] ∼ )
28	27	eqcomd 2769	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑥 ∼ 𝐸) → [𝐸] ∼ = [𝑥] ∼ )
29	28	ex 416	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 ∼ 𝐸 → [𝐸] ∼ = [𝑥] ∼ ))
30	10, 29	sylbid 242	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐸 ∈ [𝑥] ∼ → [𝐸] ∼ = [𝑥] ∼ ))
31	30	adantr 484	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ (1r‘𝑄) = [𝑥] ∼ ) → (𝐸 ∈ [𝑥] ∼ → [𝐸] ∼ = [𝑥] ∼ ))
32	8, 31	sylbid 242	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ (1r‘𝑄) = [𝑥] ∼ ) → (𝐸 ∈ (1r‘𝑄) → [𝐸] ∼ = [𝑥] ∼ ))
33	32	ex 416	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((1r‘𝑄) = [𝑥] ∼ → (𝐸 ∈ (1r‘𝑄) → [𝐸] ∼ = [𝑥] ∼ )))
34	6, 33	mpid 44	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((1r‘𝑄) = [𝑥] ∼ → [𝐸] ∼ = [𝑥] ∼ ))
35	34	imp 410	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ (1r‘𝑄) = [𝑥] ∼ ) → [𝐸] ∼ = [𝑥] ∼ )
36		simpr 488	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ (1r‘𝑄) = [𝑥] ∼ ) → (1r‘𝑄) = [𝑥] ∼ )
37	35, 36	eqtr4d 2801	. . . . 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 21382	. . . . 5 ⊢ (𝜑 → ∃𝑥 ∈ 𝐵 (1r‘𝑄) = [𝑥] ∼ )
42	37, 41	r19.29a 3171	. . . 4 ⊢ (𝜑 → [𝐸] ∼ = (1r‘𝑄))
43	42	eqcomd 2769	. . 3 ⊢ (𝜑 → (1r‘𝑄) = [𝐸] ∼ )
44	39	eqcomi 2772	. . . 4 ⊢ (1r‘𝐽) = 1
45	44	a1i 11	. . 3 ⊢ (𝜑 → (1r‘𝐽) = 1 )
46	43, 45	opeq12d 4840	. 2 ⊢ (𝜑 → ⟨(1r‘𝑄), (1r‘𝐽)⟩ = ⟨[𝐸] ∼ , 1 ⟩)
47	4, 46	eqtrd 2798	1 ⊢ (𝜑 → (1r‘𝑃) = ⟨[𝐸] ∼ , 1 ⟩)

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   = wceq 1561   ∈ wcel 2143  ⟨cop 4589   class class class wbr 5101  ‘cfv 6522  (class class class)co 7397   Er wer 8676  [cec 8677  Basecbs 17246   ↾_s cress 17267  +_gcplusg 17287  ._rcmulr 17288   /_s cqus 17536   ×_s cxps 17537  -_gcsg 18978  SubGrpcsubg 19163  NrmSGrpcnsg 19164   ~_QG cqg 19165  Rngcrng 20199  1_rcur 20232  Ringcrg 20284  2Idealc2idl 21320

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1816  ax-4 1830  ax-5 1931  ax-6 1988  ax-7 2029  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5228  ax-sep 5247  ax-nul 5257  ax-pow 5323  ax-pr 5391  ax-un 7719  ax-cnex 11130  ax-resscn 11131  ax-1cn 11132  ax-icn 11133  ax-addcl 11134  ax-addrcl 11135  ax-mulcl 11136  ax-mulrcl 11137  ax-mulcom 11138  ax-addass 11139  ax-mulass 11140  ax-distr 11141  ax-i2m1 11142  ax-1ne0 11143  ax-1rid 11144  ax-rnegex 11145  ax-rrecex 11146  ax-cnre 11147  ax-pre-lttri 11148  ax-pre-lttrn 11149  ax-pre-ltadd 11150  ax-pre-mulgt0 11151

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101  df-tru 1564  df-fal 1574  df-ex 1801  df-nf 1805  df-sb 2092  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3457  df-sbc 3746  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-tp 4588  df-op 4590  df-uni 4867  df-iun 4952  df-br 5102  df-opab 5164  df-mpt 5183  df-tr 5209  df-id 5543  df-eprel 5548  df-po 5556  df-so 5557  df-fr 5601  df-we 5603  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-ima 5661  df-pred 6289  df-ord 6350  df-on 6351  df-lim 6352  df-suc 6353  df-iota 6478  df-fun 6524  df-fn 6525  df-f 6526  df-f1 6527  df-fo 6528  df-f1o 6529  df-fv 6530  df-riota 7354  df-ov 7400  df-oprab 7401  df-mpo 7402  df-om 7848  df-1st 7971  df-2nd 7972  df-frecs 8263  df-wrecs 8294  df-recs 8343  df-rdg 8382  df-1o 8438  df-2o 8439  df-er 8679  df-ec 8681  df-qs 8685  df-map 8811  df-ixp 8881  df-en 8929  df-dom 8930  df-sdom 8931  df-fin 8932  df-sup 9389  df-inf 9390  df-pnf 11219  df-mnf 11220  df-xr 11221  df-ltxr 11222  df-le 11223  df-sub 11417  df-neg 11418  df-nn 12212  df-2 12281  df-3 12282  df-4 12283  df-5 12284  df-6 12285  df-7 12286  df-8 12287  df-9 12288  df-n0 12483  df-z 12570  df-dec 12690  df-uz 12841  df-fz 13514  df-struct 17184  df-sets 17201  df-slot 17219  df-ndx 17231  df-base 17247  df-ress 17268  df-plusg 17300  df-mulr 17301  df-sca 17303  df-vsca 17304  df-ip 17305  df-tset 17306  df-ple 17307  df-ds 17309  df-hom 17311  df-cco 17312  df-0g 17471  df-prds 17477  df-imas 17539  df-qus 17540  df-xps 17541  df-mgm 18675  df-sgrp 18754  df-mnd 18770  df-grp 18979  df-minusg 18980  df-subg 19166  df-nsg 19167  df-eqg 19168  df-cmn 19823  df-abl 19824  df-mgp 20188  df-rng 20200  df-ur 20233  df-ring 20286  df-subrng 20597  df-lss 21000  df-sra 21241  df-rgmod 21242  df-lidl 21279  df-2idl 21321

This theorem is referenced by:  rngqiprngu  21389