Theorem qusrng 13974

Description: The quotient structure of a non-unital ring is a non-unital ring (qusring2 14082 analog). (Contributed by AV, 23-Feb-2025.)

Hypotheses

Ref	Expression
qusrng.u	⊢ (𝜑 → 𝑈 = (𝑅 /s ∼ ))
qusrng.v	⊢ (𝜑 → 𝑉 = (Base‘𝑅))
qusrng.p	⊢ + = (+g‘𝑅)
qusrng.t	⊢ · = (.r‘𝑅)
qusrng.r	⊢ (𝜑 → ∼ Er 𝑉)
qusrng.e1	⊢ (𝜑 → ((𝑎 ∼ 𝑝 ∧ 𝑏 ∼ 𝑞) → (𝑎 + 𝑏) ∼ (𝑝 + 𝑞)))
qusrng.e2	⊢ (𝜑 → ((𝑎 ∼ 𝑝 ∧ 𝑏 ∼ 𝑞) → (𝑎 · 𝑏) ∼ (𝑝 · 𝑞)))
qusrng.x	⊢ (𝜑 → 𝑅 ∈ Rng)

Assertion

Ref	Expression
qusrng	⊢ (𝜑 → 𝑈 ∈ Rng)

Distinct variable groups:   𝑅,𝑎,𝑏,𝑝,𝑞   𝑈,𝑎,𝑏,𝑝,𝑞   𝑉,𝑎,𝑏,𝑝,𝑞   ∼ ,𝑎,𝑏,𝑝,𝑞   + ,𝑝,𝑞   · ,𝑝,𝑞   𝜑,𝑎,𝑏,𝑝,𝑞

Allowed substitution hints:   + (𝑎,𝑏)   · (𝑎,𝑏)

Proof of Theorem qusrng

Dummy variables 𝑢 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		qusrng.u	. . 3 ⊢ (𝜑 → 𝑈 = (𝑅 /s ∼ ))
2		qusrng.v	. . 3 ⊢ (𝜑 → 𝑉 = (Base‘𝑅))
3		eqid 2231	. . 3 ⊢ (𝑢 ∈ 𝑉 ↦ [𝑢] ∼ ) = (𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )
4		qusrng.r	. . . 4 ⊢ (𝜑 → ∼ Er 𝑉)
5		basfn 13143	. . . . . 6 ⊢ Base Fn V
6		qusrng.x	. . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ Rng)
7	6	elexd 2816	. . . . . 6 ⊢ (𝜑 → 𝑅 ∈ V)
8		funfvex 5656	. . . . . . 7 ⊢ ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V)
9	8	funfni 5432	. . . . . 6 ⊢ ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V)
10	5, 7, 9	sylancr 414	. . . . 5 ⊢ (𝜑 → (Base‘𝑅) ∈ V)
11	2, 10	eqeltrd 2308	. . . 4 ⊢ (𝜑 → 𝑉 ∈ V)
12		erex 6726	. . . 4 ⊢ ( ∼ Er 𝑉 → (𝑉 ∈ V → ∼ ∈ V))
13	4, 11, 12	sylc 62	. . 3 ⊢ (𝜑 → ∼ ∈ V)
14	1, 2, 3, 13, 6	qusval 13408	. 2 ⊢ (𝜑 → 𝑈 = ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ ) “s 𝑅))
15		qusrng.p	. 2 ⊢ + = (+g‘𝑅)
16		qusrng.t	. 2 ⊢ · = (.r‘𝑅)
17	1, 2, 3, 13, 6	quslem 13409	. 2 ⊢ (𝜑 → (𝑢 ∈ 𝑉 ↦ [𝑢] ∼ ):𝑉–onto→(𝑉 / ∼ ))
18	6	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → 𝑅 ∈ Rng)
19		simprl 531	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → 𝑥 ∈ 𝑉)
20	2	eleq2d 2301	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝑉 ↔ 𝑥 ∈ (Base‘𝑅)))
21	20	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (𝑥 ∈ 𝑉 ↔ 𝑥 ∈ (Base‘𝑅)))
22	19, 21	mpbid 147	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → 𝑥 ∈ (Base‘𝑅))
23		simprr 533	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → 𝑦 ∈ 𝑉)
24	2	eleq2d 2301	. . . . . . 7 ⊢ (𝜑 → (𝑦 ∈ 𝑉 ↔ 𝑦 ∈ (Base‘𝑅)))
25	24	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (𝑦 ∈ 𝑉 ↔ 𝑦 ∈ (Base‘𝑅)))
26	23, 25	mpbid 147	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → 𝑦 ∈ (Base‘𝑅))
27		eqid 2231	. . . . . 6 ⊢ (Base‘𝑅) = (Base‘𝑅)
28	27, 15	rngacl 13958	. . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝑥 + 𝑦) ∈ (Base‘𝑅))
29	18, 22, 26, 28	syl3anc 1273	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (𝑥 + 𝑦) ∈ (Base‘𝑅))
30	2	eleq2d 2301	. . . . 5 ⊢ (𝜑 → ((𝑥 + 𝑦) ∈ 𝑉 ↔ (𝑥 + 𝑦) ∈ (Base‘𝑅)))
31	30	adantr 276	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → ((𝑥 + 𝑦) ∈ 𝑉 ↔ (𝑥 + 𝑦) ∈ (Base‘𝑅)))
32	29, 31	mpbird 167	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (𝑥 + 𝑦) ∈ 𝑉)
33		qusrng.e1	. . 3 ⊢ (𝜑 → ((𝑎 ∼ 𝑝 ∧ 𝑏 ∼ 𝑞) → (𝑎 + 𝑏) ∼ (𝑝 + 𝑞)))
34	4, 11, 3, 32, 33	ercpbl 13416	. 2 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → ((((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘𝑎) = ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘𝑝) ∧ ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘𝑏) = ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘𝑞)) → ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘(𝑎 + 𝑏)) = ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘(𝑝 + 𝑞))))
35	27, 16	rngcl 13960	. . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝑥 · 𝑦) ∈ (Base‘𝑅))
36	18, 22, 26, 35	syl3anc 1273	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (𝑥 · 𝑦) ∈ (Base‘𝑅))
37	2	eleq2d 2301	. . . . 5 ⊢ (𝜑 → ((𝑥 · 𝑦) ∈ 𝑉 ↔ (𝑥 · 𝑦) ∈ (Base‘𝑅)))
38	37	adantr 276	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → ((𝑥 · 𝑦) ∈ 𝑉 ↔ (𝑥 · 𝑦) ∈ (Base‘𝑅)))
39	36, 38	mpbird 167	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (𝑥 · 𝑦) ∈ 𝑉)
40		qusrng.e2	. . 3 ⊢ (𝜑 → ((𝑎 ∼ 𝑝 ∧ 𝑏 ∼ 𝑞) → (𝑎 · 𝑏) ∼ (𝑝 · 𝑞)))
41	4, 11, 3, 39, 40	ercpbl 13416	. 2 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → ((((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘𝑎) = ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘𝑝) ∧ ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘𝑏) = ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘𝑞)) → ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘(𝑎 · 𝑏)) = ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘(𝑝 · 𝑞))))
42	14, 2, 15, 16, 17, 34, 41, 6	imasrng 13972	1 ⊢ (𝜑 → 𝑈 ∈ Rng)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1397   ∈ wcel 2202  Vcvv 2802   class class class wbr 4088   ↦ cmpt 4150   Fn wfn 5321  ‘cfv 5326  (class class class)co 6018   Er wer 6699  [cec 6700   / cqs 6701  Basecbs 13084  +_gcplusg 13162  ._rcmulr 13163   /_s cqus 13385  Rngcrng 13948

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-addcom 8132  ax-addass 8134  ax-i2m1 8137  ax-0lt1 8138  ax-0id 8140  ax-rnegex 8141  ax-pre-ltirr 8144  ax-pre-lttrn 8146  ax-pre-ltadd 8148

This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-tp 3677  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-er 6702  df-ec 6704  df-qs 6708  df-pnf 8216  df-mnf 8217  df-ltxr 8219  df-inn 9144  df-2 9202  df-3 9203  df-ndx 13087  df-slot 13088  df-base 13090  df-sets 13091  df-plusg 13175  df-mulr 13176  df-0g 13343  df-iimas 13387  df-qus 13388  df-mgm 13441  df-sgrp 13487  df-mnd 13502  df-grp 13588  df-minusg 13589  df-cmn 13875  df-abl 13876  df-mgp 13937  df-rng 13949

This theorem is referenced by:  qus2idrng  14542