| 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 2760 | . . . 4 ⊢ (Base‘𝐸) = (Base‘𝐸) | |
| 4 | funcixp.h | . . . 4 ⊢ 𝐻 = (Hom ‘𝐷) | |
| 5 | funcixp.j | . . . 4 ⊢ 𝐽 = (Hom ‘𝐸) | |
| 6 | eqid 2760 | . . . 4 ⊢ (Id‘𝐷) = (Id‘𝐷) | |
| 7 | eqid 2760 | . . . 4 ⊢ (Id‘𝐸) = (Id‘𝐸) | |
| 8 | eqid 2760 | . . . 4 ⊢ (comp‘𝐷) = (comp‘𝐷) | |
| 9 | eqid 2760 | . . . 4 ⊢ (comp‘𝐸) = (comp‘𝐸) | |
| 10 | df-br 5103 | . . . . . . 7 ⊢ (𝐹(𝐷 Func 𝐸)𝐺 ↔ 〈𝐹, 𝐺〉 ∈ (𝐷 Func 𝐸)) | |
| 11 | 1, 10 | sylib 221 | . . . . . 6 ⊢ (𝜑 → 〈𝐹, 𝐺〉 ∈ (𝐷 Func 𝐸)) |
| 12 | funcrcl 18000 | . . . . . 6 ⊢ (〈𝐹, 𝐺〉 ∈ (𝐷 Func 𝐸) → (𝐷 ∈ Cat ∧ 𝐸 ∈ Cat)) | |
| 13 | 11, 12 | syl 18 | . . . . 5 ⊢ (𝜑 → (𝐷 ∈ Cat ∧ 𝐸 ∈ Cat)) |
| 14 | 13 | simpld 500 | . . . 4 ⊢ (𝜑 → 𝐷 ∈ Cat) |
| 15 | 13 | simprd 501 | . . . 4 ⊢ (𝜑 → 𝐸 ∈ Cat) |
| 16 | 2, 3, 4, 5, 6, 7, 8, 9, 14, 15 | isfunc 18001 | . . 3 ⊢ (𝜑 → (𝐹(𝐷 Func 𝐸)𝐺 ↔ (𝐹:𝐵⟶(Base‘𝐸) ∧ 𝐺 ∈ X𝑧 ∈ (𝐵 × 𝐵)(((𝐹‘(1st ‘𝑧))𝐽(𝐹‘(2nd ‘𝑧))) ↑m (𝐻‘𝑧)) ∧ ∀𝑥 ∈ 𝐵 (((𝑥𝐺𝑥)‘((Id‘𝐷)‘𝑥)) = ((Id‘𝐸)‘(𝐹‘𝑥)) ∧ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ∀𝑚 ∈ (𝑥𝐻𝑦)∀𝑛 ∈ (𝑦𝐻𝑧)((𝑥𝐺𝑧)‘(𝑛(〈𝑥, 𝑦〉(comp‘𝐷)𝑧)𝑚)) = (((𝑦𝐺𝑧)‘𝑛)(〈(𝐹‘𝑥), (𝐹‘𝑦)〉(comp‘𝐸)(𝐹‘𝑧))((𝑥𝐺𝑦)‘𝑚)))))) |
| 17 | 1, 16 | mpbid 235 | . 2 ⊢ (𝜑 → (𝐹:𝐵⟶(Base‘𝐸) ∧ 𝐺 ∈ X𝑧 ∈ (𝐵 × 𝐵)(((𝐹‘(1st ‘𝑧))𝐽(𝐹‘(2nd ‘𝑧))) ↑m (𝐻‘𝑧)) ∧ ∀𝑥 ∈ 𝐵 (((𝑥𝐺𝑥)‘((Id‘𝐷)‘𝑥)) = ((Id‘𝐸)‘(𝐹‘𝑥)) ∧ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ∀𝑚 ∈ (𝑥𝐻𝑦)∀𝑛 ∈ (𝑦𝐻𝑧)((𝑥𝐺𝑧)‘(𝑛(〈𝑥, 𝑦〉(comp‘𝐷)𝑧)𝑚)) = (((𝑦𝐺𝑧)‘𝑛)(〈(𝐹‘𝑥), (𝐹‘𝑦)〉(comp‘𝐸)(𝐹‘𝑧))((𝑥𝐺𝑦)‘𝑚))))) |
| 18 | 17 | simp2d 1161 | 1 ⊢ (𝜑 → 𝐺 ∈ X𝑧 ∈ (𝐵 × 𝐵)(((𝐹‘(1st ‘𝑧))𝐽(𝐹‘(2nd ‘𝑧))) ↑m (𝐻‘𝑧))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ∀wral 3076 〈cop 4589 class class class wbr 5102 × cxp 5645 ⟶wf 6523 ‘cfv 6527 (class class class)co 7408 1st c1st 7982 2nd c2nd 7983 ↑m cmap 8825 Xcixp 8903 Basecbs 17349 Hom chom 17401 compcco 17402 Catccat 17800 Idccid 17801 Func cfunc 17991 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-fv 6535 df-ov 7411 df-oprab 7412 df-mpo 7413 df-map 8827 df-ixp 8904 df-func 17995 |
| This theorem is used by: funcf2 18005 funcfn2 18006 wunfunc 18038 |
| Copyright terms: Public domain | W3C validator |