Theorem homarw 18271

Description: A hom-set is a subset of the collection of all arrows. (Contributed by Mario Carneiro, 11-Jan-2017.)

Hypotheses

Ref	Expression
arwrcl.a	⊢ 𝐴 = (Arrow‘𝐶)
arwhoma.h	⊢ 𝐻 = (Homa‘𝐶)

Assertion

Ref	Expression
homarw	⊢ (𝑋𝐻𝑌) ⊆ 𝐴

Proof of Theorem homarw

Step	Hyp	Ref	Expression
1		ovssunirn 7487	. 2 ⊢ (𝑋𝐻𝑌) ⊆ ∪ ran 𝐻
2		arwrcl.a	. . 3 ⊢ 𝐴 = (Arrow‘𝐶)
3		arwhoma.h	. . 3 ⊢ 𝐻 = (Homa‘𝐶)
4	2, 3	arwval 18268	. 2 ⊢ 𝐴 = ∪ ran 𝐻
5	1, 4	sseqtrri 3962	1 ⊢ (𝑋𝐻𝑌) ⊆ 𝐴

This proof depends on syntax axioms:   = wceq 1570   ⊆ wss 3900  ∪ cuni 4872  ran crn 5659  ‘cfv 6566  (class class class)co 7451  Arrowcarw 18247  Hom_achoma 18248

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-homa 18251  df-arw 18252

This theorem is used by:  idaf  18288  homdmcoa  18292  coaval  18293  coapm  18296  termcarweu  50994  arweuthinc  50995  arweutermc  50996