| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > funcixp | Structured version Visualization version GIF version | ||
| Description: The morphism part of a functor is a function on homsets. (Contributed by Mario Carneiro, 2-Jan-2017.) |
| Ref | Expression |
|---|---|
| funcixp.b | ⊢ 𝐵 = (Base‘𝐷) |
| funcixp.h | ⊢ 𝐻 = (Hom ‘𝐷) |
| funcixp.j | ⊢ 𝐽 = (Hom ‘𝐸) |
| funcixp.f | ⊢ (𝜑 → 𝐹(𝐷 Func 𝐸)𝐺) |
| Ref | Expression |
|---|---|
| funcixp | ⊢ (𝜑 → 𝐺 ∈ X𝑧 ∈ (𝐵 × 𝐵)(((𝐹‘(1st ‘𝑧))𝐽(𝐹‘(2nd ‘𝑧))) ↑m (𝐻‘𝑧))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | funcixp.f | . . 3 ⊢ (𝜑 → 𝐹(𝐷 Func 𝐸)𝐺) | |
| 2 | funcixp.b | . . . 4 ⊢ 𝐵 = (Base‘𝐷) | |
| 3 | eqid 2737 | . . . 4 ⊢ (Base‘𝐸) = (Base‘𝐸) | |
| 4 | funcixp.h | . . . 4 ⊢ 𝐻 = (Hom ‘𝐷) | |
| 5 | funcixp.j | . . . 4 ⊢ 𝐽 = (Hom ‘𝐸) | |
| 6 | eqid 2737 | . . . 4 ⊢ (Id‘𝐷) = (Id‘𝐷) | |
| 7 | eqid 2737 | . . . 4 ⊢ (Id‘𝐸) = (Id‘𝐸) | |
| 8 | eqid 2737 | . . . 4 ⊢ (comp‘𝐷) = (comp‘𝐷) | |
| 9 | eqid 2737 | . . . 4 ⊢ (comp‘𝐸) = (comp‘𝐸) | |
| 10 | df-br 5100 | . . . . . . 7 ⊢ (𝐹(𝐷 Func 𝐸)𝐺 ↔ 〈𝐹, 𝐺〉 ∈ (𝐷 Func 𝐸)) | |
| 11 | 1, 10 | sylib 218 | . . . . . 6 ⊢ (𝜑 → 〈𝐹, 𝐺〉 ∈ (𝐷 Func 𝐸)) |
| 12 | funcrcl 17791 | . . . . . 6 ⊢ (〈𝐹, 𝐺〉 ∈ (𝐷 Func 𝐸) → (𝐷 ∈ Cat ∧ 𝐸 ∈ Cat)) | |
| 13 | 11, 12 | syl 17 | . . . . 5 ⊢ (𝜑 → (𝐷 ∈ Cat ∧ 𝐸 ∈ Cat)) |
| 14 | 13 | simpld 494 | . . . 4 ⊢ (𝜑 → 𝐷 ∈ Cat) |
| 15 | 13 | simprd 495 | . . . 4 ⊢ (𝜑 → 𝐸 ∈ Cat) |
| 16 | 2, 3, 4, 5, 6, 7, 8, 9, 14, 15 | isfunc 17792 | . . 3 ⊢ (𝜑 → (𝐹(𝐷 Func 𝐸)𝐺 ↔ (𝐹:𝐵⟶(Base‘𝐸) ∧ 𝐺 ∈ X𝑧 ∈ (𝐵 × 𝐵)(((𝐹‘(1st ‘𝑧))𝐽(𝐹‘(2nd ‘𝑧))) ↑m (𝐻‘𝑧)) ∧ ∀𝑥 ∈ 𝐵 (((𝑥𝐺𝑥)‘((Id‘𝐷)‘𝑥)) = ((Id‘𝐸)‘(𝐹‘𝑥)) ∧ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ∀𝑚 ∈ (𝑥𝐻𝑦)∀𝑛 ∈ (𝑦𝐻𝑧)((𝑥𝐺𝑧)‘(𝑛(〈𝑥, 𝑦〉(comp‘𝐷)𝑧)𝑚)) = (((𝑦𝐺𝑧)‘𝑛)(〈(𝐹‘𝑥), (𝐹‘𝑦)〉(comp‘𝐸)(𝐹‘𝑧))((𝑥𝐺𝑦)‘𝑚)))))) |
| 17 | 1, 16 | mpbid 232 | . 2 ⊢ (𝜑 → (𝐹:𝐵⟶(Base‘𝐸) ∧ 𝐺 ∈ X𝑧 ∈ (𝐵 × 𝐵)(((𝐹‘(1st ‘𝑧))𝐽(𝐹‘(2nd ‘𝑧))) ↑m (𝐻‘𝑧)) ∧ ∀𝑥 ∈ 𝐵 (((𝑥𝐺𝑥)‘((Id‘𝐷)‘𝑥)) = ((Id‘𝐸)‘(𝐹‘𝑥)) ∧ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ∀𝑚 ∈ (𝑥𝐻𝑦)∀𝑛 ∈ (𝑦𝐻𝑧)((𝑥𝐺𝑧)‘(𝑛(〈𝑥, 𝑦〉(comp‘𝐷)𝑧)𝑚)) = (((𝑦𝐺𝑧)‘𝑛)(〈(𝐹‘𝑥), (𝐹‘𝑦)〉(comp‘𝐸)(𝐹‘𝑧))((𝑥𝐺𝑦)‘𝑚))))) |
| 18 | 17 | simp2d 1144 | 1 ⊢ (𝜑 → 𝐺 ∈ X𝑧 ∈ (𝐵 × 𝐵)(((𝐹‘(1st ‘𝑧))𝐽(𝐹‘(2nd ‘𝑧))) ↑m (𝐻‘𝑧))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∀wral 3052 〈cop 4587 class class class wbr 5099 × cxp 5623 ⟶wf 6489 ‘cfv 6493 (class class class)co 7360 1st c1st 7933 2nd c2nd 7934 ↑m cmap 8767 Xcixp 8839 Basecbs 17140 Hom chom 17192 compcco 17193 Catccat 17591 Idccid 17592 Func cfunc 17782 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-fv 6501 df-ov 7363 df-oprab 7364 df-mpo 7365 df-map 8769 df-ixp 8840 df-func 17786 |
| This theorem is referenced by: funcf2 17796 funcfn2 17797 wunfunc 17829 |
| Copyright terms: Public domain | W3C validator |