Theorem arwval 18104

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 6881	. . . . . . 7 ⊢ (𝑐 = 𝐶 → (Homa‘𝑐) = (Homa‘𝐶))
3		arwval.h	. . . . . . 7 ⊢ 𝐻 = (Homa‘𝐶)
4	2, 3	eqtr4di 2816	. . . . . 6 ⊢ (𝑐 = 𝐶 → (Homa‘𝑐) = 𝐻)
5	4	rneqd 5928	. . . . 5 ⊢ (𝑐 = 𝐶 → ran (Homa‘𝑐) = ran 𝐻)
6	5	unieqd 4885	. . . 4 ⊢ (𝑐 = 𝐶 → ∪ ran (Homa‘𝑐) = ∪ ran 𝐻)
7		df-arw 18088	. . . 4 ⊢ Arrow = (𝑐 ∈ Cat ↦ ∪ ran (Homa‘𝑐))
8	3	fvexi 6895	. . . . . 6 ⊢ 𝐻 ∈ V
9	8	rnex 7903	. . . . 5 ⊢ ran 𝐻 ∈ V
10	9	uniex 7739	. . . 4 ⊢ ∪ ran 𝐻 ∈ V
11	6, 7, 10	fvmpt 6989	. . 3 ⊢ (𝐶 ∈ Cat → (Arrow‘𝐶) = ∪ ran 𝐻)
12	7	fvmptndm 7021	. . . 4 ⊢ (¬ 𝐶 ∈ Cat → (Arrow‘𝐶) = ∅)
13		df-homa 18087	. . . . . . . . . 10 ⊢ Homa = (𝑐 ∈ Cat ↦ (𝑥 ∈ ((Base‘𝑐) × (Base‘𝑐)) ↦ ({𝑥} × ((Hom ‘𝑐)‘𝑥))))
14	13	fvmptndm 7021	. . . . . . . . 9 ⊢ (¬ 𝐶 ∈ Cat → (Homa‘𝐶) = ∅)
15	3, 14	eqtrid 2810	. . . . . . . 8 ⊢ (¬ 𝐶 ∈ Cat → 𝐻 = ∅)
16	15	rneqd 5928	. . . . . . 7 ⊢ (¬ 𝐶 ∈ Cat → ran 𝐻 = ran ∅)
17		rn0 5916	. . . . . . 7 ⊢ ran ∅ = ∅
18	16, 17	eqtrdi 2814	. . . . . 6 ⊢ (¬ 𝐶 ∈ Cat → ran 𝐻 = ∅)
19	18	unieqd 4885	. . . . 5 ⊢ (¬ 𝐶 ∈ Cat → ∪ ran 𝐻 = ∪ ∅)
20		uni0 4901	. . . . 5 ⊢ ∪ ∅ = ∅
21	19, 20	eqtrdi 2814	. . . 4 ⊢ (¬ 𝐶 ∈ Cat → ∪ ran 𝐻 = ∅)
22	12, 21	eqtr4d 2801	. . 3 ⊢ (¬ 𝐶 ∈ Cat → (Arrow‘𝐶) = ∪ ran 𝐻)
23	11, 22	pm2.61i 184	. 2 ⊢ (Arrow‘𝐶) = ∪ ran 𝐻
24	1, 23	eqtri 2786	1 ⊢ 𝐴 = ∪ ran 𝐻

This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2143  ∅c0 4286  {csn 4589  ∪ cuni 4872   ↦ cmpt 5192   × cxp 5659  ran crn 5662  ‘cfv 6536  Basecbs 17273  Hom chom 17325  Catccat 17724  Arrowcarw 18083  Hom_achoma 18084

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404  ax-un 7732

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-iota 6492  df-fun 6538  df-fv 6544  df-homa 18087  df-arw 18088

This theorem is used by:  arwhoma  18106  homarw  18107