Theorem arwval 18138

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 6882	. . . . . . 7 ⊢ (𝑐 = 𝐶 → (Homa‘𝑐) = (Homa‘𝐶))
3		arwval.h	. . . . . . 7 ⊢ 𝐻 = (Homa‘𝐶)
4	2, 3	eqtr4di 2815	. . . . . 6 ⊢ (𝑐 = 𝐶 → (Homa‘𝑐) = 𝐻)
5	4	rneqd 5926	. . . . 5 ⊢ (𝑐 = 𝐶 → ran (Homa‘𝑐) = ran 𝐻)
6	5	unieqd 4883	. . . 4 ⊢ (𝑐 = 𝐶 → ∪ ran (Homa‘𝑐) = ∪ ran 𝐻)
7		df-arw 18122	. . . 4 ⊢ Arrow = (𝑐 ∈ Cat ↦ ∪ ran (Homa‘𝑐))
8	3	fvexi 6896	. . . . . 6 ⊢ 𝐻 ∈ V
9	8	rnex 7911	. . . . 5 ⊢ ran 𝐻 ∈ V
10	9	uniex 7747	. . . 4 ⊢ ∪ ran 𝐻 ∈ V
11	6, 7, 10	fvmpt 6990	. . 3 ⊢ (𝐶 ∈ Cat → (Arrow‘𝐶) = ∪ ran 𝐻)
12	7	fvmptndm 7022	. . . 4 ⊢ (¬ 𝐶 ∈ Cat → (Arrow‘𝐶) = ∅)
13		df-homa 18121	. . . . . . . . . 10 ⊢ Homa = (𝑐 ∈ Cat ↦ (𝑥 ∈ ((Base‘𝑐) × (Base‘𝑐)) ↦ ({𝑥} × ((Hom ‘𝑐)‘𝑥))))
14	13	fvmptndm 7022	. . . . . . . . 9 ⊢ (¬ 𝐶 ∈ Cat → (Homa‘𝐶) = ∅)
15	3, 14	eqtrid 2809	. . . . . . . 8 ⊢ (¬ 𝐶 ∈ Cat → 𝐻 = ∅)
16	15	rneqd 5926	. . . . . . 7 ⊢ (¬ 𝐶 ∈ Cat → ran 𝐻 = ran ∅)
17		rn0 5914	. . . . . . 7 ⊢ ran ∅ = ∅
18	16, 17	eqtrdi 2813	. . . . . 6 ⊢ (¬ 𝐶 ∈ Cat → ran 𝐻 = ∅)
19	18	unieqd 4883	. . . . 5 ⊢ (¬ 𝐶 ∈ Cat → ∪ ran 𝐻 = ∪ ∅)
20		uni0 4899	. . . . 5 ⊢ ∪ ∅ = ∅
21	19, 20	eqtrdi 2813	. . . 4 ⊢ (¬ 𝐶 ∈ Cat → ∪ ran 𝐻 = ∅)
22	12, 21	eqtr4d 2800	. . 3 ⊢ (¬ 𝐶 ∈ Cat → (Arrow‘𝐶) = ∪ ran 𝐻)
23	11, 22	pm2.61i 184	. 2 ⊢ (Arrow‘𝐶) = ∪ ran 𝐻
24	1, 23	eqtri 2785	1 ⊢ 𝐴 = ∪ ran 𝐻

This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2145  ∅c0 4282  {csn 4587  ∪ cuni 4870   ↦ cmpt 5190   × cxp 5657  ran crn 5660  ‘cfv 6537  Basecbs 17307  Hom chom 17359  Catccat 17758  Arrowcarw 18117  Hom_achoma 18118

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-sep 5255  ax-nul 5267  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-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  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-iota 6493  df-fun 6539  df-fv 6545  df-homa 18121  df-arw 18122

This theorem is used by:  arwhoma  18140  homarw  18141