Theorem qusrng 13764

Description: The quotient structure of a non-unital ring is a non-unital ring (qusring2 13872 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 2206	. . 3 ⊢ (𝑢 ∈ 𝑉 ↦ [𝑢] ∼ ) = (𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )
4		qusrng.r	. . . 4 ⊢ (𝜑 → ∼ Er 𝑉)
5		basfn 12934	. . . . . 6 ⊢ Base Fn V
6		qusrng.x	. . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ Rng)
7	6	elexd 2786	. . . . . 6 ⊢ (𝜑 → 𝑅 ∈ V)
8		funfvex 5600	. . . . . . 7 ⊢ ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V)
9	8	funfni 5381	. . . . . 6 ⊢ ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V)
10	5, 7, 9	sylancr 414	. . . . 5 ⊢ (𝜑 → (Base‘𝑅) ∈ V)
11	2, 10	eqeltrd 2283	. . . 4 ⊢ (𝜑 → 𝑉 ∈ V)
12		erex 6651	. . . 4 ⊢ ( ∼ Er 𝑉 → (𝑉 ∈ V → ∼ ∈ V))
13	4, 11, 12	sylc 62	. . 3 ⊢ (𝜑 → ∼ ∈ V)
14	1, 2, 3, 13, 6	qusval 13199	. 2 ⊢ (𝜑 → 𝑈 = ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ ) “s 𝑅))
15		qusrng.p	. 2 ⊢ + = (+g‘𝑅)
16		qusrng.t	. 2 ⊢ · = (.r‘𝑅)
17	1, 2, 3, 13, 6	quslem 13200	. 2 ⊢ (𝜑 → (𝑢 ∈ 𝑉 ↦ [𝑢] ∼ ):𝑉–onto→(𝑉 / ∼ ))
18	6	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → 𝑅 ∈ Rng)
19		simprl 529	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → 𝑥 ∈ 𝑉)
20	2	eleq2d 2276	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝑉 ↔ 𝑥 ∈ (Base‘𝑅)))
21	20	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (𝑥 ∈ 𝑉 ↔ 𝑥 ∈ (Base‘𝑅)))
22	19, 21	mpbid 147	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → 𝑥 ∈ (Base‘𝑅))
23		simprr 531	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → 𝑦 ∈ 𝑉)
24	2	eleq2d 2276	. . . . . . 7 ⊢ (𝜑 → (𝑦 ∈ 𝑉 ↔ 𝑦 ∈ (Base‘𝑅)))
25	24	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (𝑦 ∈ 𝑉 ↔ 𝑦 ∈ (Base‘𝑅)))
26	23, 25	mpbid 147	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → 𝑦 ∈ (Base‘𝑅))
27		eqid 2206	. . . . . 6 ⊢ (Base‘𝑅) = (Base‘𝑅)
28	27, 15	rngacl 13748	. . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝑥 + 𝑦) ∈ (Base‘𝑅))
29	18, 22, 26, 28	syl3anc 1250	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (𝑥 + 𝑦) ∈ (Base‘𝑅))
30	2	eleq2d 2276	. . . . 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 13207	. 2 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → ((((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘𝑎) = ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘𝑝) ∧ ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘𝑏) = ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘𝑞)) → ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘(𝑎 + 𝑏)) = ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘(𝑝 + 𝑞))))
35	27, 16	rngcl 13750	. . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝑥 · 𝑦) ∈ (Base‘𝑅))
36	18, 22, 26, 35	syl3anc 1250	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (𝑥 · 𝑦) ∈ (Base‘𝑅))
37	2	eleq2d 2276	. . . . 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 13207	. 2 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → ((((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘𝑎) = ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘𝑝) ∧ ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘𝑏) = ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘𝑞)) → ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘(𝑎 · 𝑏)) = ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘(𝑝 · 𝑞))))
42	14, 2, 15, 16, 17, 34, 41, 6	imasrng 13762	1 ⊢ (𝜑 → 𝑈 ∈ Rng)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1373   ∈ wcel 2177  Vcvv 2773   class class class wbr 4047   ↦ cmpt 4109   Fn wfn 5271  ‘cfv 5276  (class class class)co 5951   Er wer 6624  [cec 6625   / cqs 6626  Basecbs 12876  +_gcplusg 12953  ._rcmulr 12954   /_s cqus 13176  Rngcrng 13738

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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4163  ax-sep 4166  ax-pow 4222  ax-pr 4257  ax-un 4484  ax-setind 4589  ax-cnex 8023  ax-resscn 8024  ax-1cn 8025  ax-1re 8026  ax-icn 8027  ax-addcl 8028  ax-addrcl 8029  ax-mulcl 8030  ax-addcom 8032  ax-addass 8034  ax-i2m1 8037  ax-0lt1 8038  ax-0id 8040  ax-rnegex 8041  ax-pre-ltirr 8044  ax-pre-lttrn 8046  ax-pre-ltadd 8048

This theorem depends on definitions:  df-bi 117  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-nel 2473  df-ral 2490  df-rex 2491  df-reu 2492  df-rmo 2493  df-rab 2494  df-v 2775  df-sbc 3000  df-csb 3095  df-dif 3169  df-un 3171  df-in 3173  df-ss 3180  df-nul 3462  df-pw 3619  df-sn 3640  df-pr 3641  df-tp 3642  df-op 3643  df-uni 3853  df-int 3888  df-iun 3931  df-br 4048  df-opab 4110  df-mpt 4111  df-id 4344  df-xp 4685  df-rel 4686  df-cnv 4687  df-co 4688  df-dm 4689  df-rn 4690  df-res 4691  df-ima 4692  df-iota 5237  df-fun 5278  df-fn 5279  df-f 5280  df-f1 5281  df-fo 5282  df-f1o 5283  df-fv 5284  df-riota 5906  df-ov 5954  df-oprab 5955  df-mpo 5956  df-er 6627  df-ec 6629  df-qs 6633  df-pnf 8116  df-mnf 8117  df-ltxr 8119  df-inn 9044  df-2 9102  df-3 9103  df-ndx 12879  df-slot 12880  df-base 12882  df-sets 12883  df-plusg 12966  df-mulr 12967  df-0g 13134  df-iimas 13178  df-qus 13179  df-mgm 13232  df-sgrp 13278  df-mnd 13293  df-grp 13379  df-minusg 13380  df-cmn 13666  df-abl 13667  df-mgp 13727  df-rng 13739

This theorem is referenced by:  qus2idrng  14331