MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  arwval Structured version   Visualization version   GIF version

Theorem arwval 17967
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.
StepHypRef Expression
1 arwval.a . 2 𝐴 = (Arrow‘𝐶)
2 fveq2 6834 . . . . . . 7 (𝑐 = 𝐶 → (Homa𝑐) = (Homa𝐶))
3 arwval.h . . . . . . 7 𝐻 = (Homa𝐶)
42, 3eqtr4di 2789 . . . . . 6 (𝑐 = 𝐶 → (Homa𝑐) = 𝐻)
54rneqd 5887 . . . . 5 (𝑐 = 𝐶 → ran (Homa𝑐) = ran 𝐻)
65unieqd 4876 . . . 4 (𝑐 = 𝐶 ran (Homa𝑐) = ran 𝐻)
7 df-arw 17951 . . . 4 Arrow = (𝑐 ∈ Cat ↦ ran (Homa𝑐))
83fvexi 6848 . . . . . 6 𝐻 ∈ V
98rnex 7852 . . . . 5 ran 𝐻 ∈ V
109uniex 7686 . . . 4 ran 𝐻 ∈ V
116, 7, 10fvmpt 6941 . . 3 (𝐶 ∈ Cat → (Arrow‘𝐶) = ran 𝐻)
127fvmptndm 6972 . . . 4 𝐶 ∈ Cat → (Arrow‘𝐶) = ∅)
13 df-homa 17950 . . . . . . . . . 10 Homa = (𝑐 ∈ Cat ↦ (𝑥 ∈ ((Base‘𝑐) × (Base‘𝑐)) ↦ ({𝑥} × ((Hom ‘𝑐)‘𝑥))))
1413fvmptndm 6972 . . . . . . . . 9 𝐶 ∈ Cat → (Homa𝐶) = ∅)
153, 14eqtrid 2783 . . . . . . . 8 𝐶 ∈ Cat → 𝐻 = ∅)
1615rneqd 5887 . . . . . . 7 𝐶 ∈ Cat → ran 𝐻 = ran ∅)
17 rn0 5875 . . . . . . 7 ran ∅ = ∅
1816, 17eqtrdi 2787 . . . . . 6 𝐶 ∈ Cat → ran 𝐻 = ∅)
1918unieqd 4876 . . . . 5 𝐶 ∈ Cat → ran 𝐻 = ∅)
20 uni0 4891 . . . . 5 ∅ = ∅
2119, 20eqtrdi 2787 . . . 4 𝐶 ∈ Cat → ran 𝐻 = ∅)
2212, 21eqtr4d 2774 . . 3 𝐶 ∈ Cat → (Arrow‘𝐶) = ran 𝐻)
2311, 22pm2.61i 182 . 2 (Arrow‘𝐶) = ran 𝐻
241, 23eqtri 2759 1 𝐴 = ran 𝐻
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1541  wcel 2113  c0 4285  {csn 4580   cuni 4863  cmpt 5179   × cxp 5622  ran crn 5625  cfv 6492  Basecbs 17136  Hom chom 17188  Catccat 17587  Arrowcarw 17946  Homachoma 17947
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-iota 6448  df-fun 6494  df-fv 6500  df-homa 17950  df-arw 17951
This theorem is referenced by:  arwhoma  17969  homarw  17970
  Copyright terms: Public domain W3C validator