Theorem dvrfval 20517

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 6888	. . . . . 6 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
3		dvrval.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑅)
4	2, 3	eqtr4di 2819	. . . . 5 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
5		fveq2 6888	. . . . . 6 ⊢ (𝑟 = 𝑅 → (Unit‘𝑟) = (Unit‘𝑅))
6		dvrval.u	. . . . . 6 ⊢ 𝑈 = (Unit‘𝑅)
7	5, 6	eqtr4di 2819	. . . . 5 ⊢ (𝑟 = 𝑅 → (Unit‘𝑟) = 𝑈)
8		fveq2 6888	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (.r‘𝑟) = (.r‘𝑅))
9		dvrval.t	. . . . . . 7 ⊢ · = (.r‘𝑅)
10	8, 9	eqtr4di 2819	. . . . . 6 ⊢ (𝑟 = 𝑅 → (.r‘𝑟) = · )
11		eqidd 2767	. . . . . 6 ⊢ (𝑟 = 𝑅 → 𝑥 = 𝑥)
12		fveq2 6888	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (invr‘𝑟) = (invr‘𝑅))
13		dvrval.i	. . . . . . . 8 ⊢ 𝐼 = (invr‘𝑅)
14	12, 13	eqtr4di 2819	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (invr‘𝑟) = 𝐼)
15	14	fveq1d 6890	. . . . . 6 ⊢ (𝑟 = 𝑅 → ((invr‘𝑟)‘𝑦) = (𝐼‘𝑦))
16	10, 11, 15	oveq123d 7444	. . . . 5 ⊢ (𝑟 = 𝑅 → (𝑥(.r‘𝑟)((invr‘𝑟)‘𝑦)) = (𝑥 · (𝐼‘𝑦)))
17	4, 7, 16	mpoeq123dv 7498	. . . 4 ⊢ (𝑟 = 𝑅 → (𝑥 ∈ (Base‘𝑟), 𝑦 ∈ (Unit‘𝑟) ↦ (𝑥(.r‘𝑟)((invr‘𝑟)‘𝑦))) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦))))
18		df-dvr 20516	. . . 4 ⊢ /r = (𝑟 ∈ V ↦ (𝑥 ∈ (Base‘𝑟), 𝑦 ∈ (Unit‘𝑟) ↦ (𝑥(.r‘𝑟)((invr‘𝑟)‘𝑦))))
19	3	fvexi 6902	. . . . 5 ⊢ 𝐵 ∈ V
20	6	fvexi 6902	. . . . 5 ⊢ 𝑈 ∈ V
21	19, 20	mpoex 8085	. . . 4 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦))) ∈ V
22	17, 18, 21	fvmpt 6996	. . 3 ⊢ (𝑅 ∈ V → (/r‘𝑅) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦))))
23		fvprc 6880	. . . 4 ⊢ (¬ 𝑅 ∈ V → (/r‘𝑅) = ∅)
24		fvprc 6880	. . . . . . 7 ⊢ (¬ 𝑅 ∈ V → (Base‘𝑅) = ∅)
25	3, 24	eqtrid 2813	. . . . . 6 ⊢ (¬ 𝑅 ∈ V → 𝐵 = ∅)
26	25	orcd 887	. . . . 5 ⊢ (¬ 𝑅 ∈ V → (𝐵 = ∅ ∨ 𝑈 = ∅))
27		0mpo0 7506	. . . . 5 ⊢ ((𝐵 = ∅ ∨ 𝑈 = ∅) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦))) = ∅)
28	26, 27	syl 18	. . . 4 ⊢ (¬ 𝑅 ∈ V → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦))) = ∅)
29	23, 28	eqtr4d 2804	. . 3 ⊢ (¬ 𝑅 ∈ V → (/r‘𝑅) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦))))
30	22, 29	pm2.61i 184	. 2 ⊢ (/r‘𝑅) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦)))
31	1, 30	eqtri 2789	1 ⊢ / = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝑈 ↦ (𝑥 · (𝐼‘𝑦)))

This proof depends on syntax axioms:  ¬ wn 3   ∨ wo 861   = wceq 1570   ∈ wcel 2146  Vcvv 3458  ∅c0 4289  ‘cfv 6543  (class class class)co 7423   ∈ cmpo 7425  Basecbs 17294  ._rcmulr 17336  Unitcui 20470  inv_rcinvr 20502  /_rcdvr 20515

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-1st 7995  df-2nd 7996  df-dvr 20516

This theorem is used by:  dvrval  20518  cnflddiv  21589  dvrcn  24378