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

Theorem arwhoma 18270
Description: An arrow is contained in the hom-set corresponding to its domain and codomain. (Contributed by Mario Carneiro, 11-Jan-2017.)
Hypotheses
Ref Expression
arwrcl.a 𝐴 = (Arrow‘𝐶)
arwhoma.h 𝐻 = (Homa‘𝐶)
Assertion
Ref Expression
arwhoma (𝐹 ∈ 𝐴 → 𝐹 ∈ ((doma‘𝐹)𝐻(coda‘𝐹)))

Proof of Theorem arwhoma
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 arwrcl.a . . . . . . 7 𝐴 = (Arrow‘𝐶)
2 arwhoma.h . . . . . . 7 𝐻 = (Homa‘𝐶)
31, 2arwval 18268 . . . . . 6 𝐴 = ∪ ran 𝐻
43eleq2i 2856 . . . . 5 (𝐹 ∈ 𝐴 ↔ 𝐹 ∈ ∪ ran 𝐻)
54biimpi 219 . . . 4 (𝐹 ∈ 𝐴 → 𝐹 ∈ ∪ ran 𝐻)
6 eqid 2763 . . . . . 6 (Base‘𝐶) = (Base‘𝐶)
71arwrcl 18269 . . . . . 6 (𝐹 ∈ 𝐴 → 𝐶 ∈ Cat)
82, 6, 7homaf 18255 . . . . 5 (𝐹 ∈ 𝐴 → 𝐻:((Base‘𝐶) × (Base‘𝐶))⟶𝒫 (((Base‘𝐶) × (Base‘𝐶)) × V))
9 ffn 6739 . . . . 5 (𝐻:((Base‘𝐶) × (Base‘𝐶))⟶𝒫 (((Base‘𝐶) × (Base‘𝐶)) × V) → 𝐻 Fn ((Base‘𝐶) × (Base‘𝐶)))
10 fnunirn 7288 . . . . 5 (𝐻 Fn ((Base‘𝐶) × (Base‘𝐶)) → (𝐹 ∈ ∪ ran 𝐻 ↔ ∃𝑧 ∈ ((Base‘𝐶) × (Base‘𝐶))𝐹 ∈ (𝐻‘𝑧)))
118, 9, 103syl 19 . . . 4 (𝐹 ∈ 𝐴 → (𝐹 ∈ ∪ ran 𝐻 ↔ ∃𝑧 ∈ ((Base‘𝐶) × (Base‘𝐶))𝐹 ∈ (𝐻‘𝑧)))
125, 11mpbid 235 . . 3 (𝐹 ∈ 𝐴 → ∃𝑧 ∈ ((Base‘𝐶) × (Base‘𝐶))𝐹 ∈ (𝐻‘𝑧))
13 fveq2 6916 . . . . . 6 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝐻‘𝑧) = (𝐻‘⟨𝑥, 𝑦⟩))
14 df-ov 7454 . . . . . 6 (𝑥𝐻𝑦) = (𝐻‘⟨𝑥, 𝑦⟩)
1513, 14eqtr4di 2816 . . . . 5 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝐻‘𝑧) = (𝑥𝐻𝑦))
1615eleq2d 2850 . . . 4 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝐹 ∈ (𝐻‘𝑧) ↔ 𝐹 ∈ (𝑥𝐻𝑦)))
1716rexxp 5829 . . 3 (∃𝑧 ∈ ((Base‘𝐶) × (Base‘𝐶))𝐹 ∈ (𝐻‘𝑧) ↔ ∃𝑥 ∈ (Base‘𝐶)∃𝑦 ∈ (Base‘𝐶)𝐹 ∈ (𝑥𝐻𝑦))
1812, 17sylib 221 . 2 (𝐹 ∈ 𝐴 → ∃𝑥 ∈ (Base‘𝐶)∃𝑦 ∈ (Base‘𝐶)𝐹 ∈ (𝑥𝐻𝑦))
19 id 23 . . . . 5 (𝐹 ∈ (𝑥𝐻𝑦) → 𝐹 ∈ (𝑥𝐻𝑦))
202homadm 18265 . . . . . 6 (𝐹 ∈ (𝑥𝐻𝑦) → (doma‘𝐹) = 𝑥)
212homacd 18266 . . . . . 6 (𝐹 ∈ (𝑥𝐻𝑦) → (coda‘𝐹) = 𝑦)
2220, 21oveq12d 7469 . . . . 5 (𝐹 ∈ (𝑥𝐻𝑦) → ((doma‘𝐹)𝐻(coda‘𝐹)) = (𝑥𝐻𝑦))
2319, 22eleqtrrd 2867 . . . 4 (𝐹 ∈ (𝑥𝐻𝑦) → 𝐹 ∈ ((doma‘𝐹)𝐻(coda‘𝐹)))
2423rexlimivw 3163 . . 3 (∃𝑦 ∈ (Base‘𝐶)𝐹 ∈ (𝑥𝐻𝑦) → 𝐹 ∈ ((doma‘𝐹)𝐻(coda‘𝐹)))
2524rexlimivw 3163 . 2 (∃𝑥 ∈ (Base‘𝐶)∃𝑦 ∈ (Base‘𝐶)𝐹 ∈ (𝑥𝐻𝑦) → 𝐹 ∈ ((doma‘𝐹)𝐻(coda‘𝐹)))
2618, 25syl 18 1 (𝐹 ∈ 𝐴 → 𝐹 ∈ ((doma‘𝐹)𝐻(coda‘𝐹)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  Vcvv 3454  𝒫 cpw 4560  ⟨cop 4840  ∪ cuni 4872   × cxp 5656  ran crn 5659   Fn wfn 6561  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  domacdoma 18245  codaccoda 18246  Arrowcarw 18247  Homachoma 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-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  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-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  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-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-1st 8035  df-2nd 8036  df-doma 18249  df-coda 18250  df-homa 18251  df-arw 18252
This theorem is used by:  arwdm  18272  arwcd  18273  arwhom  18276  arwdmcd  18277  coapm  18296
  Copyright terms: Public domain W3C validator