Theorem dvrfval 20637

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 6885	. . . . . 6 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
3		dvrval.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑅)
4	2, 3	eqtr4di 2813	. . . . 5 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
5		fveq2 6885	. . . . . 6 ⊢ (𝑟 = 𝑅 → (Unit‘𝑟) = (Unit‘𝑅))
6		dvrval.u	. . . . . 6 ⊢ 𝑈 = (Unit‘𝑅)
7	5, 6	eqtr4di 2813	. . . . 5 ⊢ (𝑟 = 𝑅 → (Unit‘𝑟) = 𝑈)
8		fveq2 6885	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (.r‘𝑟) = (.r‘𝑅))
9		dvrval.t	. . . . . . 7 ⊢ · = (.r‘𝑅)
10	8, 9	eqtr4di 2813	. . . . . 6 ⊢ (𝑟 = 𝑅 → (.r‘𝑟) = · )
11		eqidd 2761	. . . . . 6 ⊢ (𝑟 = 𝑅 → 𝑥 = 𝑥)
12		fveq2 6885	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (invr‘𝑟) = (invr‘𝑅))
13		dvrval.i	. . . . . . . 8 ⊢ 𝐼 = (invr‘𝑅)
14	12, 13	eqtr4di 2813	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (invr‘𝑟) = 𝐼)
15	14	fveq1d 6887	. . . . . 6 ⊢ (𝑟 = 𝑅 → ((invr‘𝑟)‘𝑦) = (𝐼‘𝑦))
16	10, 11, 15	oveq123d 7441	. . . . 5 ⊢ (𝑟 = 𝑅 → (𝑥(.r‘𝑟)((invr‘𝑟)‘𝑦)) = (𝑥 · (𝐼‘𝑦)))
17	4, 7, 16	mpoeq123dv 7495	. . . 4 ⊢ (𝑟 = 𝑅 → (𝑥 ∈ (Base‘𝑟), 𝑦 ∈ (Unit‘𝑟) ↦ (𝑥(.r‘𝑟)((invr‘𝑟)‘𝑦))) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦))))
18		df-dvr 20636	. . . 4 ⊢ /r = (𝑟 ∈ V ↦ (𝑥 ∈ (Base‘𝑟), 𝑦 ∈ (Unit‘𝑟) ↦ (𝑥(.r‘𝑟)((invr‘𝑟)‘𝑦))))
19	3	fvexi 6899	. . . . 5 ⊢ 𝐵 ∈ V
20	6	fvexi 6899	. . . . 5 ⊢ 𝑈 ∈ V
21	19, 20	mpoex 8092	. . . 4 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦))) ∈ V
22	17, 18, 21	fvmpt 6993	. . 3 ⊢ (𝑅 ∈ V → (/r‘𝑅) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦))))
23		fvprc 6877	. . . 4 ⊢ (¬ 𝑅 ∈ V → (/r‘𝑅) = ∅)
24		fvprc 6877	. . . . . . 7 ⊢ (¬ 𝑅 ∈ V → (Base‘𝑅) = ∅)
25	3, 24	eqtrid 2807	. . . . . 6 ⊢ (¬ 𝑅 ∈ V → 𝐵 = ∅)
26	25	orcd 887	. . . . 5 ⊢ (¬ 𝑅 ∈ V → (𝐵 = ∅ ∨ 𝑈 = ∅))
27		0mpo0 7503	. . . . 5 ⊢ ((𝐵 = ∅ ∨ 𝑈 = ∅) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦))) = ∅)
28	26, 27	syl 18	. . . 4 ⊢ (¬ 𝑅 ∈ V → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦))) = ∅)
29	23, 28	eqtr4d 2798	. . 3 ⊢ (¬ 𝑅 ∈ V → (/r‘𝑅) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦))))
30	22, 29	pm2.61i 184	. 2 ⊢ (/r‘𝑅) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦)))
31	1, 30	eqtri 2783	1 ⊢ / = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦)))

This proof depends on syntax axioms:  ¬ wn 3   ∨ wo 861   = wceq 1569   ∈ wcel 2144  Vcvv 3450  ∅c0 4278  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422  Basecbs 17392  ._rcmulr 17434  Unitcui 20590  inv_rcinvr 20622  /_rcdvr 20635

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-dvr 20636

This theorem is used by:  dvrval  20638  cnflddiv  21713  dvrcn  24508