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

Theorem funcixp 17960
Description: The morphism part of a functor is a function on homsets. (Contributed by Mario Carneiro, 2-Jan-2017.)
Hypotheses
Ref Expression
funcixp.b 𝐵 = (Base‘𝐷)
funcixp.h 𝐻 = (Hom ‘𝐷)
funcixp.j 𝐽 = (Hom ‘𝐸)
funcixp.f (𝜑𝐹(𝐷 Func 𝐸)𝐺)
Assertion
Ref Expression
funcixp (𝜑𝐺X𝑧 ∈ (𝐵 × 𝐵)(((𝐹‘(1st𝑧))𝐽(𝐹‘(2nd𝑧))) ↑m (𝐻𝑧)))
Distinct variable groups:   𝑧,𝐵   𝑧,𝐷   𝑧,𝐸   𝜑,𝑧   𝑧,𝐹   𝑧,𝐺   𝑧,𝐽   𝑧,𝐻

Proof of Theorem funcixp
Dummy variables 𝑚 𝑛 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 funcixp.f . . 3 (𝜑𝐹(𝐷 Func 𝐸)𝐺)
2 funcixp.b . . . 4 𝐵 = (Base‘𝐷)
3 eqid 2762 . . . 4 (Base‘𝐸) = (Base‘𝐸)
4 funcixp.h . . . 4 𝐻 = (Hom ‘𝐷)
5 funcixp.j . . . 4 𝐽 = (Hom ‘𝐸)
6 eqid 2762 . . . 4 (Id‘𝐷) = (Id‘𝐷)
7 eqid 2762 . . . 4 (Id‘𝐸) = (Id‘𝐸)
8 eqid 2762 . . . 4 (comp‘𝐷) = (comp‘𝐷)
9 eqid 2762 . . . 4 (comp‘𝐸) = (comp‘𝐸)
10 df-br 5108 . . . . . . 7 (𝐹(𝐷 Func 𝐸)𝐺 ↔ ⟨𝐹, 𝐺⟩ ∈ (𝐷 Func 𝐸))
111, 10sylib 221 . . . . . 6 (𝜑 → ⟨𝐹, 𝐺⟩ ∈ (𝐷 Func 𝐸))
12 funcrcl 17956 . . . . . 6 (⟨𝐹, 𝐺⟩ ∈ (𝐷 Func 𝐸) → (𝐷 ∈ Cat ∧ 𝐸 ∈ Cat))
1311, 12syl 18 . . . . 5 (𝜑 → (𝐷 ∈ Cat ∧ 𝐸 ∈ Cat))
1413simpld 500 . . . 4 (𝜑𝐷 ∈ Cat)
1513simprd 501 . . . 4 (𝜑𝐸 ∈ Cat)
162, 3, 4, 5, 6, 7, 8, 9, 14, 15isfunc 17957 . . 3 (𝜑 → (𝐹(𝐷 Func 𝐸)𝐺 ↔ (𝐹:𝐵⟶(Base‘𝐸) ∧ 𝐺X𝑧 ∈ (𝐵 × 𝐵)(((𝐹‘(1st𝑧))𝐽(𝐹‘(2nd𝑧))) ↑m (𝐻𝑧)) ∧ ∀𝑥𝐵 (((𝑥𝐺𝑥)‘((Id‘𝐷)‘𝑥)) = ((Id‘𝐸)‘(𝐹𝑥)) ∧ ∀𝑦𝐵𝑧𝐵𝑚 ∈ (𝑥𝐻𝑦)∀𝑛 ∈ (𝑦𝐻𝑧)((𝑥𝐺𝑧)‘(𝑛(⟨𝑥, 𝑦⟩(comp‘𝐷)𝑧)𝑚)) = (((𝑦𝐺𝑧)‘𝑛)(⟨(𝐹𝑥), (𝐹𝑦)⟩(comp‘𝐸)(𝐹𝑧))((𝑥𝐺𝑦)‘𝑚))))))
171, 16mpbid 235 . 2 (𝜑 → (𝐹:𝐵⟶(Base‘𝐸) ∧ 𝐺X𝑧 ∈ (𝐵 × 𝐵)(((𝐹‘(1st𝑧))𝐽(𝐹‘(2nd𝑧))) ↑m (𝐻𝑧)) ∧ ∀𝑥𝐵 (((𝑥𝐺𝑥)‘((Id‘𝐷)‘𝑥)) = ((Id‘𝐸)‘(𝐹𝑥)) ∧ ∀𝑦𝐵𝑧𝐵𝑚 ∈ (𝑥𝐻𝑦)∀𝑛 ∈ (𝑦𝐻𝑧)((𝑥𝐺𝑧)‘(𝑛(⟨𝑥, 𝑦⟩(comp‘𝐷)𝑧)𝑚)) = (((𝑦𝐺𝑧)‘𝑛)(⟨(𝐹𝑥), (𝐹𝑦)⟩(comp‘𝐸)(𝐹𝑧))((𝑥𝐺𝑦)‘𝑚)))))
1817simp2d 1161 1 (𝜑𝐺X𝑧 ∈ (𝐵 × 𝐵)(((𝐹‘(1st𝑧))𝐽(𝐹‘(2nd𝑧))) ↑m (𝐻𝑧)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  w3a 1103   = wceq 1570  wcel 2145  wral 3078  cop 4593   class class class wbr 5107   × cxp 5657  wf 6533  cfv 6537  (class class class)co 7416  1st c1st 7987  2nd c2nd 7988  m cmap 8829  Xcixp 8907  Basecbs 17305  Hom chom 17357  compcco 17358  Catccat 17756  Idccid 17757   Func cfunc 17947
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739
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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-map 8831  df-ixp 8908  df-func 17951
This theorem is used by:  funcf2  17961  funcfn2  17962  wunfunc  17994
  Copyright terms: Public domain W3C validator