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

Theorem homdmcoa 18268
Description: If 𝐹:𝑋⟶𝑌 and 𝐺:𝑌⟶𝑍, then 𝐺 and 𝐹 are composable. (Contributed by Mario Carneiro, 11-Jan-2017.)
Hypotheses
Ref Expression
homdmcoa.o · = (compa‘𝐶)
homdmcoa.h 𝐻 = (Homa‘𝐶)
homdmcoa.f (𝜑 → 𝐹 ∈ (𝑋𝐻𝑌))
homdmcoa.g (𝜑 → 𝐺 ∈ (𝑌𝐻𝑍))
Assertion
Ref Expression
homdmcoa (𝜑 → 𝐺dom · 𝐹)

Proof of Theorem homdmcoa
StepHypRef Expression
1 eqid 2763 . . . 4 (Arrow‘𝐶) = (Arrow‘𝐶)
2 homdmcoa.h . . . 4 𝐻 = (Homa‘𝐶)
31, 2homarw 18247 . . 3 (𝑋𝐻𝑌) ⊆ (Arrow‘𝐶)
4 homdmcoa.f . . 3 (𝜑 → 𝐹 ∈ (𝑋𝐻𝑌))
53, 4sselid 3911 . 2 (𝜑 → 𝐹 ∈ (Arrow‘𝐶))
61, 2homarw 18247 . . 3 (𝑌𝐻𝑍) ⊆ (Arrow‘𝐶)
7 homdmcoa.g . . 3 (𝜑 → 𝐺 ∈ (𝑌𝐻𝑍))
86, 7sselid 3911 . 2 (𝜑 → 𝐺 ∈ (Arrow‘𝐶))
92homacd 18242 . . . 4 (𝐹 ∈ (𝑋𝐻𝑌) → (coda‘𝐹) = 𝑌)
104, 9syl 18 . . 3 (𝜑 → (coda‘𝐹) = 𝑌)
112homadm 18241 . . . 4 (𝐺 ∈ (𝑌𝐻𝑍) → (doma‘𝐺) = 𝑌)
127, 11syl 18 . . 3 (𝜑 → (doma‘𝐺) = 𝑌)
1310, 12eqtr4d 2801 . 2 (𝜑 → (coda‘𝐹) = (doma‘𝐺))
14 homdmcoa.o . . 3 · = (compa‘𝐶)
1514, 1eldmcoa 18266 . 2 (𝐺dom · 𝐹 ↔ (𝐹 ∈ (Arrow‘𝐶) ∧ 𝐺 ∈ (Arrow‘𝐶) ∧ (coda‘𝐹) = (doma‘𝐺)))
165, 8, 13, 15syl3anbrc 1362 1 (𝜑 → 𝐺dom · 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147   class class class wbr 5106  dom cdm 5655  ‘cfv 6555  (class class class)co 7440  domacdoma 18221  codaccoda 18222  Arrowcarw 18223  Homachoma 18224  compaccoa 18255
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 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
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 4839  df-ot 4862  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-1st 8022  df-2nd 8023  df-doma 18225  df-coda 18226  df-homa 18227  df-arw 18228  df-coa 18257
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator