| 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 2730 | . . . 4 ⊢ (Base‘𝐸) = (Base‘𝐸) | |
| 4 | funcixp.h | . . . 4 ⊢ 𝐻 = (Hom ‘𝐷) | |
| 5 | funcixp.j | . . . 4 ⊢ 𝐽 = (Hom ‘𝐸) | |
| 6 | eqid 2730 | . . . 4 ⊢ (Id‘𝐷) = (Id‘𝐷) | |
| 7 | eqid 2730 | . . . 4 ⊢ (Id‘𝐸) = (Id‘𝐸) | |
| 8 | eqid 2730 | . . . 4 ⊢ (comp‘𝐷) = (comp‘𝐷) | |
| 9 | eqid 2730 | . . . 4 ⊢ (comp‘𝐸) = (comp‘𝐸) | |
| 10 | df-br 5090 | . . . . . . 7 ⊢ (𝐹(𝐷 Func 𝐸)𝐺 ↔ 〈𝐹, 𝐺〉 ∈ (𝐷 Func 𝐸)) | |
| 11 | 1, 10 | sylib 218 | . . . . . 6 ⊢ (𝜑 → 〈𝐹, 𝐺〉 ∈ (𝐷 Func 𝐸)) |
| 12 | funcrcl 17762 | . . . . . 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 17763 | . . 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 1143 | 1 ⊢ (𝜑 → 𝐺 ∈ X𝑧 ∈ (𝐵 × 𝐵)(((𝐹‘(1st ‘𝑧))𝐽(𝐹‘(2nd ‘𝑧))) ↑m (𝐻‘𝑧))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2110 ∀wral 3045 〈cop 4580 class class class wbr 5089 × cxp 5612 ⟶wf 6473 ‘cfv 6477 (class class class)co 7341 1st c1st 7914 2nd c2nd 7915 ↑m cmap 8745 Xcixp 8816 Basecbs 17112 Hom chom 17164 compcco 17165 Catccat 17562 Idccid 17563 Func cfunc 17753 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2112 ax-9 2120 ax-10 2143 ax-11 2159 ax-12 2179 ax-ext 2702 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7663 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-rab 3394 df-v 3436 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-nul 4282 df-if 4474 df-pw 4550 df-sn 4575 df-pr 4577 df-op 4581 df-uni 4858 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-id 5509 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-iota 6433 df-fun 6479 df-fn 6480 df-f 6481 df-fv 6485 df-ov 7344 df-oprab 7345 df-mpo 7346 df-map 8747 df-ixp 8817 df-func 17757 |
| This theorem is referenced by: funcf2 17767 funcfn2 17768 wunfunc 17800 |
| Copyright terms: Public domain | W3C validator |