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

Theorem funcixp 16350
 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𝑧))) ↑𝑚 (𝐻𝑧)))
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 2610 . . . 4 (Base‘𝐸) = (Base‘𝐸)
4 funcixp.h . . . 4 𝐻 = (Hom ‘𝐷)
5 funcixp.j . . . 4 𝐽 = (Hom ‘𝐸)
6 eqid 2610 . . . 4 (Id‘𝐷) = (Id‘𝐷)
7 eqid 2610 . . . 4 (Id‘𝐸) = (Id‘𝐸)
8 eqid 2610 . . . 4 (comp‘𝐷) = (comp‘𝐷)
9 eqid 2610 . . . 4 (comp‘𝐸) = (comp‘𝐸)
10 df-br 4584 . . . . . . 7 (𝐹(𝐷 Func 𝐸)𝐺 ↔ ⟨𝐹, 𝐺⟩ ∈ (𝐷 Func 𝐸))
111, 10sylib 207 . . . . . 6 (𝜑 → ⟨𝐹, 𝐺⟩ ∈ (𝐷 Func 𝐸))
12 funcrcl 16346 . . . . . 6 (⟨𝐹, 𝐺⟩ ∈ (𝐷 Func 𝐸) → (𝐷 ∈ Cat ∧ 𝐸 ∈ Cat))
1311, 12syl 17 . . . . 5 (𝜑 → (𝐷 ∈ Cat ∧ 𝐸 ∈ Cat))
1413simpld 474 . . . 4 (𝜑𝐷 ∈ Cat)
1513simprd 478 . . . 4 (𝜑𝐸 ∈ Cat)
162, 3, 4, 5, 6, 7, 8, 9, 14, 15isfunc 16347 . . 3 (𝜑 → (𝐹(𝐷 Func 𝐸)𝐺 ↔ (𝐹:𝐵⟶(Base‘𝐸) ∧ 𝐺X𝑧 ∈ (𝐵 × 𝐵)(((𝐹‘(1st𝑧))𝐽(𝐹‘(2nd𝑧))) ↑𝑚 (𝐻𝑧)) ∧ ∀𝑥𝐵 (((𝑥𝐺𝑥)‘((Id‘𝐷)‘𝑥)) = ((Id‘𝐸)‘(𝐹𝑥)) ∧ ∀𝑦𝐵𝑧𝐵𝑚 ∈ (𝑥𝐻𝑦)∀𝑛 ∈ (𝑦𝐻𝑧)((𝑥𝐺𝑧)‘(𝑛(⟨𝑥, 𝑦⟩(comp‘𝐷)𝑧)𝑚)) = (((𝑦𝐺𝑧)‘𝑛)(⟨(𝐹𝑥), (𝐹𝑦)⟩(comp‘𝐸)(𝐹𝑧))((𝑥𝐺𝑦)‘𝑚))))))
171, 16mpbid 221 . 2 (𝜑 → (𝐹:𝐵⟶(Base‘𝐸) ∧ 𝐺X𝑧 ∈ (𝐵 × 𝐵)(((𝐹‘(1st𝑧))𝐽(𝐹‘(2nd𝑧))) ↑𝑚 (𝐻𝑧)) ∧ ∀𝑥𝐵 (((𝑥𝐺𝑥)‘((Id‘𝐷)‘𝑥)) = ((Id‘𝐸)‘(𝐹𝑥)) ∧ ∀𝑦𝐵𝑧𝐵𝑚 ∈ (𝑥𝐻𝑦)∀𝑛 ∈ (𝑦𝐻𝑧)((𝑥𝐺𝑧)‘(𝑛(⟨𝑥, 𝑦⟩(comp‘𝐷)𝑧)𝑚)) = (((𝑦𝐺𝑧)‘𝑛)(⟨(𝐹𝑥), (𝐹𝑦)⟩(comp‘𝐸)(𝐹𝑧))((𝑥𝐺𝑦)‘𝑚)))))
1817simp2d 1067 1 (𝜑𝐺X𝑧 ∈ (𝐵 × 𝐵)(((𝐹‘(1st𝑧))𝐽(𝐹‘(2nd𝑧))) ↑𝑚 (𝐻𝑧)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   ∧ w3a 1031   = wceq 1475   ∈ wcel 1977  ∀wral 2896  ⟨cop 4131   class class class wbr 4583   × cxp 5036  ⟶wf 5800  ‘cfv 5804  (class class class)co 6549  1st c1st 7057  2nd c2nd 7058   ↑𝑚 cmap 7744  Xcixp 7794  Basecbs 15695  Hom chom 15779  compcco 15780  Catccat 16148  Idccid 16149   Func cfunc 16337 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-map 7746  df-ixp 7795  df-func 16341 This theorem is referenced by:  funcf2  16351  funcfn2  16352  wunfunc  16382
 Copyright terms: Public domain W3C validator