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 2823 | . . . 4 ⊢ (Arrow‘𝐶) = (Arrow‘𝐶) | |
2 | homdmcoa.h | . . . 4 ⊢ 𝐻 = (Homa‘𝐶) | |
3 | 1, 2 | homarw 17308 | . . 3 ⊢ (𝑋𝐻𝑌) ⊆ (Arrow‘𝐶) |
4 | homdmcoa.f | . . 3 ⊢ (𝜑 → 𝐹 ∈ (𝑋𝐻𝑌)) | |
5 | 3, 4 | sseldi 3967 | . 2 ⊢ (𝜑 → 𝐹 ∈ (Arrow‘𝐶)) |
6 | 1, 2 | homarw 17308 | . . 3 ⊢ (𝑌𝐻𝑍) ⊆ (Arrow‘𝐶) |
7 | homdmcoa.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ (𝑌𝐻𝑍)) | |
8 | 6, 7 | sseldi 3967 | . 2 ⊢ (𝜑 → 𝐺 ∈ (Arrow‘𝐶)) |
9 | 2 | homacd 17303 | . . . 4 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → (coda‘𝐹) = 𝑌) |
10 | 4, 9 | syl 17 | . . 3 ⊢ (𝜑 → (coda‘𝐹) = 𝑌) |
11 | 2 | homadm 17302 | . . . 4 ⊢ (𝐺 ∈ (𝑌𝐻𝑍) → (doma‘𝐺) = 𝑌) |
12 | 7, 11 | syl 17 | . . 3 ⊢ (𝜑 → (doma‘𝐺) = 𝑌) |
13 | 10, 12 | eqtr4d 2861 | . 2 ⊢ (𝜑 → (coda‘𝐹) = (doma‘𝐺)) |
14 | homdmcoa.o | . . 3 ⊢ · = (compa‘𝐶) | |
15 | 14, 1 | eldmcoa 17327 | . 2 ⊢ (𝐺dom · 𝐹 ↔ (𝐹 ∈ (Arrow‘𝐶) ∧ 𝐺 ∈ (Arrow‘𝐶) ∧ (coda‘𝐹) = (doma‘𝐺))) |
16 | 5, 8, 13, 15 | syl3anbrc 1339 | 1 ⊢ (𝜑 → 𝐺dom · 𝐹) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2114 class class class wbr 5068 dom cdm 5557 ‘cfv 6357 (class class class)co 7158 domacdoma 17282 codaccoda 17283 Arrowcarw 17284 Homachoma 17285 compaccoa 17316 |
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 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 |
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 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-reu 3147 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-op 4576 df-ot 4578 df-uni 4841 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-ov 7161 df-oprab 7162 df-mpo 7163 df-1st 7691 df-2nd 7692 df-doma 17286 df-coda 17287 df-homa 17288 df-arw 17289 df-coa 17318 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |