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

Theorem arwval 18059
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 6863 . . . . . . 7 (𝑐 = 𝐶 → (Homa𝑐) = (Homa𝐶))
3 arwval.h . . . . . . 7 𝐻 = (Homa𝐶)
42, 3eqtr4di 2814 . . . . . 6 (𝑐 = 𝐶 → (Homa𝑐) = 𝐻)
54rneqd 5912 . . . . 5 (𝑐 = 𝐶 → ran (Homa𝑐) = ran 𝐻)
65unieqd 4877 . . . 4 (𝑐 = 𝐶 ran (Homa𝑐) = ran 𝐻)
7 df-arw 18043 . . . 4 Arrow = (𝑐 ∈ Cat ↦ ran (Homa𝑐))
83fvexi 6877 . . . . . 6 𝐻 ∈ V
98rnex 7887 . . . . 5 ran 𝐻 ∈ V
109uniex 7720 . . . 4 ran 𝐻 ∈ V
116, 7, 10fvmpt 6971 . . 3 (𝐶 ∈ Cat → (Arrow‘𝐶) = ran 𝐻)
127fvmptndm 7003 . . . 4 𝐶 ∈ Cat → (Arrow‘𝐶) = ∅)
13 df-homa 18042 . . . . . . . . . 10 Homa = (𝑐 ∈ Cat ↦ (𝑥 ∈ ((Base‘𝑐) × (Base‘𝑐)) ↦ ({𝑥} × ((Hom ‘𝑐)‘𝑥))))
1413fvmptndm 7003 . . . . . . . . 9 𝐶 ∈ Cat → (Homa𝐶) = ∅)
153, 14eqtrid 2808 . . . . . . . 8 𝐶 ∈ Cat → 𝐻 = ∅)
1615rneqd 5912 . . . . . . 7 𝐶 ∈ Cat → ran 𝐻 = ran ∅)
17 rn0 5900 . . . . . . 7 ran ∅ = ∅
1816, 17eqtrdi 2812 . . . . . 6 𝐶 ∈ Cat → ran 𝐻 = ∅)
1918unieqd 4877 . . . . 5 𝐶 ∈ Cat → ran 𝐻 = ∅)
20 uni0 4893 . . . . 5 ∅ = ∅
2119, 20eqtrdi 2812 . . . 4 𝐶 ∈ Cat → ran 𝐻 = ∅)
2212, 21eqtr4d 2799 . . 3 𝐶 ∈ Cat → (Arrow‘𝐶) = ran 𝐻)
2311, 22pm2.61i 183 . 2 (Arrow‘𝐶) = ran 𝐻
241, 23eqtri 2784 1 𝐴 = ran 𝐻
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1559  wcel 2141  c0 4285  {csn 4581   cuni 4864  cmpt 5180   × cxp 5643  ran crn 5646  cfv 6517  Basecbs 17228  Hom chom 17280  Catccat 17679  Arrowcarw 18038  Homachoma 18039
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5245  ax-nul 5255  ax-pr 5389  ax-un 7714
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-iota 6473  df-fun 6519  df-fv 6525  df-homa 18042  df-arw 18043
This theorem is referenced by:  arwhoma  18061  homarw  18062
  Copyright terms: Public domain W3C validator