Theorem arwval 18125

Description: The set of arrows is the union of all the disjointified hom-sets. (Contributed by Mario Carneiro, 11-Jan-2017.)

Hypotheses

Ref	Expression
arwval.a	⊢ 𝐴 = (Arrow‘𝐶)
arwval.h	⊢ 𝐻 = (Homa‘𝐶)

Assertion

Ref	Expression
arwval	⊢ 𝐴 = ∪ ran 𝐻

Proof of Theorem arwval

Dummy variables 𝑥 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		arwval.a	. 2 ⊢ 𝐴 = (Arrow‘𝐶)
2		fveq2 6888	. . . . . . 7 ⊢ (𝑐 = 𝐶 → (Homa‘𝑐) = (Homa‘𝐶))
3		arwval.h	. . . . . . 7 ⊢ 𝐻 = (Homa‘𝐶)
4	2, 3	eqtr4di 2819	. . . . . 6 ⊢ (𝑐 = 𝐶 → (Homa‘𝑐) = 𝐻)
5	4	rneqd 5933	. . . . 5 ⊢ (𝑐 = 𝐶 → ran (Homa‘𝑐) = ran 𝐻)
6	5	unieqd 4890	. . . 4 ⊢ (𝑐 = 𝐶 → ∪ ran (Homa‘𝑐) = ∪ ran 𝐻)
7		df-arw 18109	. . . 4 ⊢ Arrow = (𝑐 ∈ Cat ↦ ∪ ran (Homa‘𝑐))
8	3	fvexi 6902	. . . . . 6 ⊢ 𝐻 ∈ V
9	8	rnex 7916	. . . . 5 ⊢ ran 𝐻 ∈ V
10	9	uniex 7752	. . . 4 ⊢ ∪ ran 𝐻 ∈ V
11	6, 7, 10	fvmpt 6996	. . 3 ⊢ (𝐶 ∈ Cat → (Arrow‘𝐶) = ∪ ran 𝐻)
12	7	fvmptndm 7028	. . . 4 ⊢ (¬ 𝐶 ∈ Cat → (Arrow‘𝐶) = ∅)
13		df-homa 18108	. . . . . . . . . 10 ⊢ Homa = (𝑐 ∈ Cat ↦ (𝑥 ∈ ((Base‘𝑐) × (Base‘𝑐)) ↦ ({𝑥} × ((Hom ‘𝑐)‘𝑥))))
14	13	fvmptndm 7028	. . . . . . . . 9 ⊢ (¬ 𝐶 ∈ Cat → (Homa‘𝐶) = ∅)
15	3, 14	eqtrid 2813	. . . . . . . 8 ⊢ (¬ 𝐶 ∈ Cat → 𝐻 = ∅)
16	15	rneqd 5933	. . . . . . 7 ⊢ (¬ 𝐶 ∈ Cat → ran 𝐻 = ran ∅)
17		rn0 5921	. . . . . . 7 ⊢ ran ∅ = ∅
18	16, 17	eqtrdi 2817	. . . . . 6 ⊢ (¬ 𝐶 ∈ Cat → ran 𝐻 = ∅)
19	18	unieqd 4890	. . . . 5 ⊢ (¬ 𝐶 ∈ Cat → ∪ ran 𝐻 = ∪ ∅)
20		uni0 4906	. . . . 5 ⊢ ∪ ∅ = ∅
21	19, 20	eqtrdi 2817	. . . 4 ⊢ (¬ 𝐶 ∈ Cat → ∪ ran 𝐻 = ∅)
22	12, 21	eqtr4d 2804	. . 3 ⊢ (¬ 𝐶 ∈ Cat → (Arrow‘𝐶) = ∪ ran 𝐻)
23	11, 22	pm2.61i 184	. 2 ⊢ (Arrow‘𝐶) = ∪ ran 𝐻
24	1, 23	eqtri 2789	1 ⊢ 𝐴 = ∪ ran 𝐻

This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2146  ∅c0 4289  {csn 4594  ∪ cuni 4877   ↦ cmpt 5197   × cxp 5664  ran crn 5667  ‘cfv 6543  Basecbs 17294  Hom chom 17346  Catccat 17745  Arrowcarw 18104  Hom_achoma 18105

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-sep 5262  ax-nul 5274  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-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  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-iota 6499  df-fun 6545  df-fv 6551  df-homa 18108  df-arw 18109

This theorem is used by:  arwhoma  18127  homarw  18128