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

Theorem funcixp 18071
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 2763 . . . 4 (Base‘𝐸) = (Base‘𝐸)
4 funcixp.h . . . 4 𝐻 = (Hom ‘𝐷)
5 funcixp.j . . . 4 𝐽 = (Hom ‘𝐸)
6 eqid 2763 . . . 4 (Id‘𝐷) = (Id‘𝐷)
7 eqid 2763 . . . 4 (Id‘𝐸) = (Id‘𝐸)
8 eqid 2763 . . . 4 (comp‘𝐷) = (comp‘𝐷)
9 eqid 2763 . . . 4 (comp‘𝐸) = (comp‘𝐸)
10 df-br 5107 . . . . . . 7 (𝐹(𝐷 Func 𝐸)𝐺 ↔ ⟨𝐹, 𝐺⟩ ∈ (𝐷 Func 𝐸))
111, 10sylib 221 . . . . . 6 (𝜑 → ⟨𝐹, 𝐺⟩ ∈ (𝐷 Func 𝐸))
12 funcrcl 18067 . . . . . 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 18068 . . 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 2147  ∀wral 3080  ⟨cop 4838   class class class wbr 5106   × cxp 5653  ⟶wf 6554  ‘cfv 6558  (class class class)co 7443  1st c1st 8023  2nd c2nd 8024   ↑m cmap 8875  Xcixp 8953  Basecbs 17416  Hom chom 17468  compcco 17469  Catccat 17867  Idccid 17868   Func cfunc 18058
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 7775
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-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-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-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-map 8877  df-ixp 8954  df-func 18062
This theorem is used by:  funcf2  18072  funcfn2  18073  wunfunc  18105
  Copyright terms: Public domain W3C validator