Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > homdmcoa | Structured version Visualization version GIF version |
Description: If 𝐹:𝑋⟶𝑌 and 𝐺:𝑌⟶𝑍, then 𝐺 and 𝐹 are composable. (Contributed by Mario Carneiro, 11-Jan-2017.) |
Ref | Expression |
---|---|
homdmcoa.o | ⊢ · = (compa‘𝐶) |
homdmcoa.h | ⊢ 𝐻 = (Homa‘𝐶) |
homdmcoa.f | ⊢ (𝜑 → 𝐹 ∈ (𝑋𝐻𝑌)) |
homdmcoa.g | ⊢ (𝜑 → 𝐺 ∈ (𝑌𝐻𝑍)) |
Ref | Expression |
---|---|
homdmcoa | ⊢ (𝜑 → 𝐺dom · 𝐹) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2738 | . . . 4 ⊢ (Arrow‘𝐶) = (Arrow‘𝐶) | |
2 | homdmcoa.h | . . . 4 ⊢ 𝐻 = (Homa‘𝐶) | |
3 | 1, 2 | homarw 17677 | . . 3 ⊢ (𝑋𝐻𝑌) ⊆ (Arrow‘𝐶) |
4 | homdmcoa.f | . . 3 ⊢ (𝜑 → 𝐹 ∈ (𝑋𝐻𝑌)) | |
5 | 3, 4 | sselid 3915 | . 2 ⊢ (𝜑 → 𝐹 ∈ (Arrow‘𝐶)) |
6 | 1, 2 | homarw 17677 | . . 3 ⊢ (𝑌𝐻𝑍) ⊆ (Arrow‘𝐶) |
7 | homdmcoa.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ (𝑌𝐻𝑍)) | |
8 | 6, 7 | sselid 3915 | . 2 ⊢ (𝜑 → 𝐺 ∈ (Arrow‘𝐶)) |
9 | 2 | homacd 17672 | . . . 4 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → (coda‘𝐹) = 𝑌) |
10 | 4, 9 | syl 17 | . . 3 ⊢ (𝜑 → (coda‘𝐹) = 𝑌) |
11 | 2 | homadm 17671 | . . . 4 ⊢ (𝐺 ∈ (𝑌𝐻𝑍) → (doma‘𝐺) = 𝑌) |
12 | 7, 11 | syl 17 | . . 3 ⊢ (𝜑 → (doma‘𝐺) = 𝑌) |
13 | 10, 12 | eqtr4d 2781 | . 2 ⊢ (𝜑 → (coda‘𝐹) = (doma‘𝐺)) |
14 | homdmcoa.o | . . 3 ⊢ · = (compa‘𝐶) | |
15 | 14, 1 | eldmcoa 17696 | . 2 ⊢ (𝐺dom · 𝐹 ↔ (𝐹 ∈ (Arrow‘𝐶) ∧ 𝐺 ∈ (Arrow‘𝐶) ∧ (coda‘𝐹) = (doma‘𝐺))) |
16 | 5, 8, 13, 15 | syl3anbrc 1341 | 1 ⊢ (𝜑 → 𝐺dom · 𝐹) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2108 class class class wbr 5070 dom cdm 5580 ‘cfv 6418 (class class class)co 7255 domacdoma 17651 codaccoda 17652 Arrowcarw 17653 Homachoma 17654 compaccoa 17685 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-ot 4567 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-ov 7258 df-oprab 7259 df-mpo 7260 df-1st 7804 df-2nd 7805 df-doma 17655 df-coda 17656 df-homa 17657 df-arw 17658 df-coa 17687 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |