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

Theorem arwval 18008
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 2793 . . . . . 6 (𝑐 = 𝐶 → (Homa𝑐) = 𝐻)
54rneqd 5887 . . . . 5 (𝑐 = 𝐶 → ran (Homa𝑐) = ran 𝐻)
65unieqd 4858 . . . 4 (𝑐 = 𝐶 ran (Homa𝑐) = ran 𝐻)
7 df-arw 17992 . . . 4 Arrow = (𝑐 ∈ Cat ↦ ran (Homa𝑐))
83fvexi 6848 . . . . . 6 𝐻 ∈ V
98rnex 7857 . . . . 5 ran 𝐻 ∈ V
109uniex 7691 . . . 4 ran 𝐻 ∈ V
116, 7, 10fvmpt 6942 . . 3 (𝐶 ∈ Cat → (Arrow‘𝐶) = ran 𝐻)
127fvmptndm 6974 . . . 4 𝐶 ∈ Cat → (Arrow‘𝐶) = ∅)
13 df-homa 17991 . . . . . . . . . 10 Homa = (𝑐 ∈ Cat ↦ (𝑥 ∈ ((Base‘𝑐) × (Base‘𝑐)) ↦ ({𝑥} × ((Hom ‘𝑐)‘𝑥))))
1413fvmptndm 6974 . . . . . . . . 9 𝐶 ∈ Cat → (Homa𝐶) = ∅)
153, 14eqtrid 2787 . . . . . . . 8 𝐶 ∈ Cat → 𝐻 = ∅)
1615rneqd 5887 . . . . . . 7 𝐶 ∈ Cat → ran 𝐻 = ran ∅)
17 rn0 5875 . . . . . . 7 ran ∅ = ∅
1816, 17eqtrdi 2791 . . . . . 6 𝐶 ∈ Cat → ran 𝐻 = ∅)
1918unieqd 4858 . . . . 5 𝐶 ∈ Cat → ran 𝐻 = ∅)
20 uni0 4873 . . . . 5 ∅ = ∅
2119, 20eqtrdi 2791 . . . 4 𝐶 ∈ Cat → ran 𝐻 = ∅)
2212, 21eqtr4d 2778 . . 3 𝐶 ∈ Cat → (Arrow‘𝐶) = ran 𝐻)
2311, 22pm2.61i 183 . 2 (Arrow‘𝐶) = ran 𝐻
241, 23eqtri 2763 1 𝐴 = ran 𝐻
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1547  wcel 2119  c0 4268  {csn 4562   cuni 4845  cmpt 5160   × cxp 5623  ran crn 5626  cfv 6492  Basecbs 17177  Hom chom 17229  Catccat 17628  Arrowcarw 17987  Homachoma 17988
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-nul 5235  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-iota 6448  df-fun 6494  df-fv 6500  df-homa 17991  df-arw 17992
This theorem is referenced by:  arwhoma  18010  homarw  18011
  Copyright terms: Public domain W3C validator