| 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 2752 | . . . 4 ⊢ (Base‘𝐸) = (Base‘𝐸) | |
| 4 | funcixp.h | . . . 4 ⊢ 𝐻 = (Hom ‘𝐷) | |
| 5 | funcixp.j | . . . 4 ⊢ 𝐽 = (Hom ‘𝐸) | |
| 6 | eqid 2752 | . . . 4 ⊢ (Id‘𝐷) = (Id‘𝐷) | |
| 7 | eqid 2752 | . . . 4 ⊢ (Id‘𝐸) = (Id‘𝐸) | |
| 8 | eqid 2752 | . . . 4 ⊢ (comp‘𝐷) = (comp‘𝐷) | |
| 9 | eqid 2752 | . . . 4 ⊢ (comp‘𝐸) = (comp‘𝐸) | |
| 10 | df-br 5091 | . . . . . . 7 ⊢ (𝐹(𝐷 Func 𝐸)𝐺 ↔ 〈𝐹, 𝐺〉 ∈ (𝐷 Func 𝐸)) | |
| 11 | 1, 10 | sylib 220 | . . . . . 6 ⊢ (𝜑 → 〈𝐹, 𝐺〉 ∈ (𝐷 Func 𝐸)) |
| 12 | funcrcl 17868 | . . . . . 6 ⊢ (〈𝐹, 𝐺〉 ∈ (𝐷 Func 𝐸) → (𝐷 ∈ Cat ∧ 𝐸 ∈ Cat)) | |
| 13 | 11, 12 | syl 17 | . . . . 5 ⊢ (𝜑 → (𝐷 ∈ Cat ∧ 𝐸 ∈ Cat)) |
| 14 | 13 | simpld 497 | . . . 4 ⊢ (𝜑 → 𝐷 ∈ Cat) |
| 15 | 13 | simprd 498 | . . . 4 ⊢ (𝜑 → 𝐸 ∈ Cat) |
| 16 | 2, 3, 4, 5, 6, 7, 8, 9, 14, 15 | isfunc 17869 | . . 3 ⊢ (𝜑 → (𝐹(𝐷 Func 𝐸)𝐺 ↔ (𝐹:𝐵⟶(Base‘𝐸) ∧ 𝐺 ∈ X𝑧 ∈ (𝐵 × 𝐵)(((𝐹‘(1st ‘𝑧))𝐽(𝐹‘(2nd ‘𝑧))) ↑m (𝐻‘𝑧)) ∧ ∀𝑥 ∈ 𝐵 (((𝑥𝐺𝑥)‘((Id‘𝐷)‘𝑥)) = ((Id‘𝐸)‘(𝐹‘𝑥)) ∧ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ∀𝑚 ∈ (𝑥𝐻𝑦)∀𝑛 ∈ (𝑦𝐻𝑧)((𝑥𝐺𝑧)‘(𝑛(〈𝑥, 𝑦〉(comp‘𝐷)𝑧)𝑚)) = (((𝑦𝐺𝑧)‘𝑛)(〈(𝐹‘𝑥), (𝐹‘𝑦)〉(comp‘𝐸)(𝐹‘𝑧))((𝑥𝐺𝑦)‘𝑚)))))) |
| 17 | 1, 16 | mpbid 234 | . 2 ⊢ (𝜑 → (𝐹:𝐵⟶(Base‘𝐸) ∧ 𝐺 ∈ X𝑧 ∈ (𝐵 × 𝐵)(((𝐹‘(1st ‘𝑧))𝐽(𝐹‘(2nd ‘𝑧))) ↑m (𝐻‘𝑧)) ∧ ∀𝑥 ∈ 𝐵 (((𝑥𝐺𝑥)‘((Id‘𝐷)‘𝑥)) = ((Id‘𝐸)‘(𝐹‘𝑥)) ∧ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ∀𝑚 ∈ (𝑥𝐻𝑦)∀𝑛 ∈ (𝑦𝐻𝑧)((𝑥𝐺𝑧)‘(𝑛(〈𝑥, 𝑦〉(comp‘𝐷)𝑧)𝑚)) = (((𝑦𝐺𝑧)‘𝑛)(〈(𝐹‘𝑥), (𝐹‘𝑦)〉(comp‘𝐸)(𝐹‘𝑧))((𝑥𝐺𝑦)‘𝑚))))) |
| 18 | 17 | simp2d 1152 | 1 ⊢ (𝜑 → 𝐺 ∈ X𝑧 ∈ (𝐵 × 𝐵)(((𝐹‘(1st ‘𝑧))𝐽(𝐹‘(2nd ‘𝑧))) ↑m (𝐻‘𝑧))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1095 = wceq 1550 ∈ wcel 2132 ∀wral 3066 〈cop 4578 class class class wbr 5090 × cxp 5634 ⟶wf 6502 ‘cfv 6506 (class class class)co 7381 1st c1st 7953 2nd c2nd 7954 ↑m cmap 8792 Xcixp 8864 Basecbs 17217 Hom chom 17269 compcco 17270 Catccat 17668 Idccid 17669 Func cfunc 17859 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-10 2165 ax-11 2181 ax-12 2202 ax-ext 2724 ax-rep 5217 ax-sep 5236 ax-nul 5246 ax-pow 5312 ax-pr 5380 ax-un 7703 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-nf 1794 df-sb 2081 df-mo 2556 df-eu 2586 df-clab 2731 df-cleq 2744 df-clel 2827 df-nfc 2901 df-ne 2948 df-ral 3067 df-rex 3077 df-rab 3405 df-v 3446 df-sbc 3736 df-csb 3844 df-dif 3898 df-un 3900 df-in 3902 df-ss 3912 df-nul 4277 df-if 4471 df-pw 4547 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4856 df-iun 4941 df-br 5091 df-opab 5153 df-mpt 5172 df-id 5531 df-xp 5642 df-rel 5643 df-cnv 5644 df-co 5645 df-dm 5646 df-rn 5647 df-iota 6462 df-fun 6508 df-fn 6509 df-f 6510 df-fv 6514 df-ov 7384 df-oprab 7385 df-mpo 7386 df-map 8794 df-ixp 8865 df-func 17863 |
| This theorem is referenced by: funcf2 17873 funcfn2 17874 wunfunc 17906 |
| Copyright terms: Public domain | W3C validator |