Theorem dvrfval 20549

Description: Division operation in a ring. (Contributed by Mario Carneiro, 2-Jul-2014.) (Revised by Mario Carneiro, 2-Dec-2014.) (Proof shortened by AV, 2-Mar-2024.)

Hypotheses

Ref	Expression
dvrval.b	⊢ 𝐵 = (Base‘𝑅)
dvrval.t	⊢ · = (.r‘𝑅)
dvrval.u	⊢ 𝑈 = (Unit‘𝑅)
dvrval.i	⊢ 𝐼 = (invr‘𝑅)
dvrval.d	⊢ / = (/r‘𝑅)

Assertion

Ref	Expression
dvrfval	⊢ / = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦)))

Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐼,𝑦   𝑥,𝑅,𝑦   𝑥, · ,𝑦   𝑥,𝑈,𝑦

Allowed substitution hints:   / (𝑥, 𝑦)

Proof of Theorem dvrfval

Dummy variable 𝑟 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dvrval.d	. 2 ⊢ / = (/r‘𝑅)
2		fveq2 6882	. . . . . 6 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
3		dvrval.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑅)
4	2, 3	eqtr4di 2815	. . . . 5 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
5		fveq2 6882	. . . . . 6 ⊢ (𝑟 = 𝑅 → (Unit‘𝑟) = (Unit‘𝑅))
6		dvrval.u	. . . . . 6 ⊢ 𝑈 = (Unit‘𝑅)
7	5, 6	eqtr4di 2815	. . . . 5 ⊢ (𝑟 = 𝑅 → (Unit‘𝑟) = 𝑈)
8		fveq2 6882	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (.r‘𝑟) = (.r‘𝑅))
9		dvrval.t	. . . . . . 7 ⊢ · = (.r‘𝑅)
10	8, 9	eqtr4di 2815	. . . . . 6 ⊢ (𝑟 = 𝑅 → (.r‘𝑟) = · )
11		eqidd 2763	. . . . . 6 ⊢ (𝑟 = 𝑅 → 𝑥 = 𝑥)
12		fveq2 6882	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (invr‘𝑟) = (invr‘𝑅))
13		dvrval.i	. . . . . . . 8 ⊢ 𝐼 = (invr‘𝑅)
14	12, 13	eqtr4di 2815	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (invr‘𝑟) = 𝐼)
15	14	fveq1d 6884	. . . . . 6 ⊢ (𝑟 = 𝑅 → ((invr‘𝑟)‘𝑦) = (𝐼‘𝑦))
16	10, 11, 15	oveq123d 7438	. . . . 5 ⊢ (𝑟 = 𝑅 → (𝑥(.r‘𝑟)((invr‘𝑟)‘𝑦)) = (𝑥 · (𝐼‘𝑦)))
17	4, 7, 16	mpoeq123dv 7492	. . . 4 ⊢ (𝑟 = 𝑅 → (𝑥 ∈ (Base‘𝑟), 𝑦 ∈ (Unit‘𝑟) ↦ (𝑥(.r‘𝑟)((invr‘𝑟)‘𝑦))) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦))))
18		df-dvr 20548	. . . 4 ⊢ /r = (𝑟 ∈ V ↦ (𝑥 ∈ (Base‘𝑟), 𝑦 ∈ (Unit‘𝑟) ↦ (𝑥(.r‘𝑟)((invr‘𝑟)‘𝑦))))
19	3	fvexi 6896	. . . . 5 ⊢ 𝐵 ∈ V
20	6	fvexi 6896	. . . . 5 ⊢ 𝑈 ∈ V
21	19, 20	mpoex 8082	. . . 4 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦))) ∈ V
22	17, 18, 21	fvmpt 6990	. . 3 ⊢ (𝑅 ∈ V → (/r‘𝑅) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦))))
23		fvprc 6874	. . . 4 ⊢ (¬ 𝑅 ∈ V → (/r‘𝑅) = ∅)
24		fvprc 6874	. . . . . . 7 ⊢ (¬ 𝑅 ∈ V → (Base‘𝑅) = ∅)
25	3, 24	eqtrid 2809	. . . . . 6 ⊢ (¬ 𝑅 ∈ V → 𝐵 = ∅)
26	25	orcd 887	. . . . 5 ⊢ (¬ 𝑅 ∈ V → (𝐵 = ∅ ∨ 𝑈 = ∅))
27		0mpo0 7500	. . . . 5 ⊢ ((𝐵 = ∅ ∨ 𝑈 = ∅) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦))) = ∅)
28	26, 27	syl 18	. . . 4 ⊢ (¬ 𝑅 ∈ V → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦))) = ∅)
29	23, 28	eqtr4d 2800	. . 3 ⊢ (¬ 𝑅 ∈ V → (/r‘𝑅) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦))))
30	22, 29	pm2.61i 184	. 2 ⊢ (/r‘𝑅) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦)))
31	1, 30	eqtri 2785	1 ⊢ / = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦)))

This proof depends on syntax axioms:  ¬ wn 3   ∨ wo 861   = wceq 1570   ∈ wcel 2145  Vcvv 3453  ∅c0 4282  ‘cfv 6537  (class class class)co 7417   ∈ cmpo 7419  Basecbs 17307  ._rcmulr 17349  Unitcui 20502  inv_rcinvr 20534  /_rcdvr 20547

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-1st 7990  df-2nd 7991  df-dvr 20548

This theorem is used by:  dvrval  20550  cnflddiv  21621  dvrcn  24416