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

Theorem arwval 17979
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 6842 . . . . . . 7 (𝑐 = 𝐶 → (Homa𝑐) = (Homa𝐶))
3 arwval.h . . . . . . 7 𝐻 = (Homa𝐶)
42, 3eqtr4di 2790 . . . . . 6 (𝑐 = 𝐶 → (Homa𝑐) = 𝐻)
54rneqd 5895 . . . . 5 (𝑐 = 𝐶 → ran (Homa𝑐) = ran 𝐻)
65unieqd 4878 . . . 4 (𝑐 = 𝐶 ran (Homa𝑐) = ran 𝐻)
7 df-arw 17963 . . . 4 Arrow = (𝑐 ∈ Cat ↦ ran (Homa𝑐))
83fvexi 6856 . . . . . 6 𝐻 ∈ V
98rnex 7862 . . . . 5 ran 𝐻 ∈ V
109uniex 7696 . . . 4 ran 𝐻 ∈ V
116, 7, 10fvmpt 6949 . . 3 (𝐶 ∈ Cat → (Arrow‘𝐶) = ran 𝐻)
127fvmptndm 6981 . . . 4 𝐶 ∈ Cat → (Arrow‘𝐶) = ∅)
13 df-homa 17962 . . . . . . . . . 10 Homa = (𝑐 ∈ Cat ↦ (𝑥 ∈ ((Base‘𝑐) × (Base‘𝑐)) ↦ ({𝑥} × ((Hom ‘𝑐)‘𝑥))))
1413fvmptndm 6981 . . . . . . . . 9 𝐶 ∈ Cat → (Homa𝐶) = ∅)
153, 14eqtrid 2784 . . . . . . . 8 𝐶 ∈ Cat → 𝐻 = ∅)
1615rneqd 5895 . . . . . . 7 𝐶 ∈ Cat → ran 𝐻 = ran ∅)
17 rn0 5883 . . . . . . 7 ran ∅ = ∅
1816, 17eqtrdi 2788 . . . . . 6 𝐶 ∈ Cat → ran 𝐻 = ∅)
1918unieqd 4878 . . . . 5 𝐶 ∈ Cat → ran 𝐻 = ∅)
20 uni0 4893 . . . . 5 ∅ = ∅
2119, 20eqtrdi 2788 . . . 4 𝐶 ∈ Cat → ran 𝐻 = ∅)
2212, 21eqtr4d 2775 . . 3 𝐶 ∈ Cat → (Arrow‘𝐶) = ran 𝐻)
2311, 22pm2.61i 182 . 2 (Arrow‘𝐶) = ran 𝐻
241, 23eqtri 2760 1 𝐴 = ran 𝐻
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1542  wcel 2114  c0 4287  {csn 4582   cuni 4865  cmpt 5181   × cxp 5630  ran crn 5633  cfv 6500  Basecbs 17148  Hom chom 17200  Catccat 17599  Arrowcarw 17958  Homachoma 17959
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-iota 6456  df-fun 6502  df-fv 6508  df-homa 17962  df-arw 17963
This theorem is referenced by:  arwhoma  17981  homarw  17982
  Copyright terms: Public domain W3C validator