| 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 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 5102 | . . . . . . 7 ⊢ (𝐹(𝐷 Func 𝐸)𝐺 ↔ 〈𝐹, 𝐺〉 ∈ (𝐷 Func 𝐸)) | |
| 11 | 1, 10 | sylib 220 | . . . . . 6 ⊢ (𝜑 → 〈𝐹, 𝐺〉 ∈ (𝐷 Func 𝐸)) |
| 12 | funcrcl 17906 | . . . . . 6 ⊢ (〈𝐹, 𝐺〉 ∈ (𝐷 Func 𝐸) → (𝐷 ∈ Cat ∧ 𝐸 ∈ Cat)) | |
| 13 | 11, 12 | syl 17 | . . . . 5 ⊢ (𝜑 → (𝐷 ∈ Cat ∧ 𝐸 ∈ Cat)) |
| 14 | 13 | simpld 498 | . . . 4 ⊢ (𝜑 → 𝐷 ∈ Cat) |
| 15 | 13 | simprd 499 | . . . 4 ⊢ (𝜑 → 𝐸 ∈ Cat) |
| 16 | 2, 3, 4, 5, 6, 7, 8, 9, 14, 15 | isfunc 17907 | . . 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 1157 | 1 ⊢ (𝜑 → 𝐺 ∈ X𝑧 ∈ (𝐵 × 𝐵)(((𝐹‘(1st ‘𝑧))𝐽(𝐹‘(2nd ‘𝑧))) ↑m (𝐻‘𝑧))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1099 = wceq 1561 ∈ wcel 2143 ∀wral 3077 〈cop 4589 class class class wbr 5101 × cxp 5646 ⟶wf 6517 ‘cfv 6521 (class class class)co 7396 1st c1st 7968 2nd c2nd 7969 ↑m cmap 8808 Xcixp 8879 Basecbs 17255 Hom chom 17307 compcco 17308 Catccat 17706 Idccid 17707 Func cfunc 17897 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5228 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7718 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3078 df-rex 3088 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5102 df-opab 5164 df-mpt 5183 df-id 5543 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-fv 6529 df-ov 7399 df-oprab 7400 df-mpo 7401 df-map 8810 df-ixp 8880 df-func 17901 |
| This theorem is referenced by: funcf2 17911 funcfn2 17912 wunfunc 17944 |
| Copyright terms: Public domain | W3C validator |