Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > arwhoma | Structured version Visualization version GIF version |
Description: An arrow is contained in the hom-set corresponding to its domain and codomain. (Contributed by Mario Carneiro, 11-Jan-2017.) |
Ref | Expression |
---|---|
arwrcl.a | ⊢ 𝐴 = (Arrow‘𝐶) |
arwhoma.h | ⊢ 𝐻 = (Homa‘𝐶) |
Ref | Expression |
---|---|
arwhoma | ⊢ (𝐹 ∈ 𝐴 → 𝐹 ∈ ((doma‘𝐹)𝐻(coda‘𝐹))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | arwrcl.a | . . . . . . 7 ⊢ 𝐴 = (Arrow‘𝐶) | |
2 | arwhoma.h | . . . . . . 7 ⊢ 𝐻 = (Homa‘𝐶) | |
3 | 1, 2 | arwval 17303 | . . . . . 6 ⊢ 𝐴 = ∪ ran 𝐻 |
4 | 3 | eleq2i 2904 | . . . . 5 ⊢ (𝐹 ∈ 𝐴 ↔ 𝐹 ∈ ∪ ran 𝐻) |
5 | 4 | biimpi 218 | . . . 4 ⊢ (𝐹 ∈ 𝐴 → 𝐹 ∈ ∪ ran 𝐻) |
6 | eqid 2821 | . . . . . 6 ⊢ (Base‘𝐶) = (Base‘𝐶) | |
7 | 1 | arwrcl 17304 | . . . . . 6 ⊢ (𝐹 ∈ 𝐴 → 𝐶 ∈ Cat) |
8 | 2, 6, 7 | homaf 17290 | . . . . 5 ⊢ (𝐹 ∈ 𝐴 → 𝐻:((Base‘𝐶) × (Base‘𝐶))⟶𝒫 (((Base‘𝐶) × (Base‘𝐶)) × V)) |
9 | ffn 6514 | . . . . 5 ⊢ (𝐻:((Base‘𝐶) × (Base‘𝐶))⟶𝒫 (((Base‘𝐶) × (Base‘𝐶)) × V) → 𝐻 Fn ((Base‘𝐶) × (Base‘𝐶))) | |
10 | fnunirn 7012 | . . . . 5 ⊢ (𝐻 Fn ((Base‘𝐶) × (Base‘𝐶)) → (𝐹 ∈ ∪ ran 𝐻 ↔ ∃𝑧 ∈ ((Base‘𝐶) × (Base‘𝐶))𝐹 ∈ (𝐻‘𝑧))) | |
11 | 8, 9, 10 | 3syl 18 | . . . 4 ⊢ (𝐹 ∈ 𝐴 → (𝐹 ∈ ∪ ran 𝐻 ↔ ∃𝑧 ∈ ((Base‘𝐶) × (Base‘𝐶))𝐹 ∈ (𝐻‘𝑧))) |
12 | 5, 11 | mpbid 234 | . . 3 ⊢ (𝐹 ∈ 𝐴 → ∃𝑧 ∈ ((Base‘𝐶) × (Base‘𝐶))𝐹 ∈ (𝐻‘𝑧)) |
13 | fveq2 6670 | . . . . . 6 ⊢ (𝑧 = 〈𝑥, 𝑦〉 → (𝐻‘𝑧) = (𝐻‘〈𝑥, 𝑦〉)) | |
14 | df-ov 7159 | . . . . . 6 ⊢ (𝑥𝐻𝑦) = (𝐻‘〈𝑥, 𝑦〉) | |
15 | 13, 14 | syl6eqr 2874 | . . . . 5 ⊢ (𝑧 = 〈𝑥, 𝑦〉 → (𝐻‘𝑧) = (𝑥𝐻𝑦)) |
16 | 15 | eleq2d 2898 | . . . 4 ⊢ (𝑧 = 〈𝑥, 𝑦〉 → (𝐹 ∈ (𝐻‘𝑧) ↔ 𝐹 ∈ (𝑥𝐻𝑦))) |
17 | 16 | rexxp 5713 | . . 3 ⊢ (∃𝑧 ∈ ((Base‘𝐶) × (Base‘𝐶))𝐹 ∈ (𝐻‘𝑧) ↔ ∃𝑥 ∈ (Base‘𝐶)∃𝑦 ∈ (Base‘𝐶)𝐹 ∈ (𝑥𝐻𝑦)) |
18 | 12, 17 | sylib 220 | . 2 ⊢ (𝐹 ∈ 𝐴 → ∃𝑥 ∈ (Base‘𝐶)∃𝑦 ∈ (Base‘𝐶)𝐹 ∈ (𝑥𝐻𝑦)) |
19 | id 22 | . . . . 5 ⊢ (𝐹 ∈ (𝑥𝐻𝑦) → 𝐹 ∈ (𝑥𝐻𝑦)) | |
20 | 2 | homadm 17300 | . . . . . 6 ⊢ (𝐹 ∈ (𝑥𝐻𝑦) → (doma‘𝐹) = 𝑥) |
21 | 2 | homacd 17301 | . . . . . 6 ⊢ (𝐹 ∈ (𝑥𝐻𝑦) → (coda‘𝐹) = 𝑦) |
22 | 20, 21 | oveq12d 7174 | . . . . 5 ⊢ (𝐹 ∈ (𝑥𝐻𝑦) → ((doma‘𝐹)𝐻(coda‘𝐹)) = (𝑥𝐻𝑦)) |
23 | 19, 22 | eleqtrrd 2916 | . . . 4 ⊢ (𝐹 ∈ (𝑥𝐻𝑦) → 𝐹 ∈ ((doma‘𝐹)𝐻(coda‘𝐹))) |
24 | 23 | rexlimivw 3282 | . . 3 ⊢ (∃𝑦 ∈ (Base‘𝐶)𝐹 ∈ (𝑥𝐻𝑦) → 𝐹 ∈ ((doma‘𝐹)𝐻(coda‘𝐹))) |
25 | 24 | rexlimivw 3282 | . 2 ⊢ (∃𝑥 ∈ (Base‘𝐶)∃𝑦 ∈ (Base‘𝐶)𝐹 ∈ (𝑥𝐻𝑦) → 𝐹 ∈ ((doma‘𝐹)𝐻(coda‘𝐹))) |
26 | 18, 25 | syl 17 | 1 ⊢ (𝐹 ∈ 𝐴 → 𝐹 ∈ ((doma‘𝐹)𝐻(coda‘𝐹))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 = wceq 1537 ∈ wcel 2114 ∃wrex 3139 Vcvv 3494 𝒫 cpw 4539 〈cop 4573 ∪ cuni 4838 × cxp 5553 ran crn 5556 Fn wfn 6350 ⟶wf 6351 ‘cfv 6355 (class class class)co 7156 Basecbs 16483 domacdoma 17280 codaccoda 17281 Arrowcarw 17282 Homachoma 17283 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-ov 7159 df-1st 7689 df-2nd 7690 df-doma 17284 df-coda 17285 df-homa 17286 df-arw 17287 |
This theorem is referenced by: arwdm 17307 arwcd 17308 arwhom 17311 arwdmcd 17312 coapm 17331 |
Copyright terms: Public domain | W3C validator |