| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uncfcl | Structured version Visualization version GIF version | ||
| Description: The uncurry operation takes a functor 𝐹:𝐶⟶(𝐷⟶𝐸) to a functor uncurryF (𝐹):𝐶 × 𝐷⟶𝐸. (Contributed by Mario Carneiro, 13-Jan-2017.) |
| Ref | Expression |
|---|---|
| uncfval.g | ⊢ 𝐹 = (〈“𝐶𝐷𝐸”〉 uncurryF 𝐺) |
| uncfval.c | ⊢ (𝜑 → 𝐷 ∈ Cat) |
| uncfval.d | ⊢ (𝜑 → 𝐸 ∈ Cat) |
| uncfval.f | ⊢ (𝜑 → 𝐺 ∈ (𝐶 Func (𝐷 FuncCat 𝐸))) |
| Ref | Expression |
|---|---|
| uncfcl | ⊢ (𝜑 → 𝐹 ∈ ((𝐶 ×c 𝐷) Func 𝐸)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uncfval.g | . . 3 ⊢ 𝐹 = (〈“𝐶𝐷𝐸”〉 uncurryF 𝐺) | |
| 2 | uncfval.c | . . 3 ⊢ (𝜑 → 𝐷 ∈ Cat) | |
| 3 | uncfval.d | . . 3 ⊢ (𝜑 → 𝐸 ∈ Cat) | |
| 4 | uncfval.f | . . 3 ⊢ (𝜑 → 𝐺 ∈ (𝐶 Func (𝐷 FuncCat 𝐸))) | |
| 5 | 1, 2, 3, 4 | uncfval 18280 | . 2 ⊢ (𝜑 → 𝐹 = ((𝐷 evalF 𝐸) ∘func ((𝐺 ∘func (𝐶 1stF 𝐷)) 〈,〉F (𝐶 2ndF 𝐷)))) |
| 6 | eqid 2765 | . . . 4 ⊢ ((𝐺 ∘func (𝐶 1stF 𝐷)) 〈,〉F (𝐶 2ndF 𝐷)) = ((𝐺 ∘func (𝐶 1stF 𝐷)) 〈,〉F (𝐶 2ndF 𝐷)) | |
| 7 | eqid 2765 | . . . 4 ⊢ ((𝐷 FuncCat 𝐸) ×c 𝐷) = ((𝐷 FuncCat 𝐸) ×c 𝐷) | |
| 8 | eqid 2765 | . . . . . 6 ⊢ (𝐶 ×c 𝐷) = (𝐶 ×c 𝐷) | |
| 9 | funcrcl 17910 | . . . . . . . 8 ⊢ (𝐺 ∈ (𝐶 Func (𝐷 FuncCat 𝐸)) → (𝐶 ∈ Cat ∧ (𝐷 FuncCat 𝐸) ∈ Cat)) | |
| 10 | 4, 9 | syl 18 | . . . . . . 7 ⊢ (𝜑 → (𝐶 ∈ Cat ∧ (𝐷 FuncCat 𝐸) ∈ Cat)) |
| 11 | 10 | simpld 499 | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ Cat) |
| 12 | eqid 2765 | . . . . . 6 ⊢ (𝐶 1stF 𝐷) = (𝐶 1stF 𝐷) | |
| 13 | 8, 11, 2, 12 | 1stfcl 18243 | . . . . 5 ⊢ (𝜑 → (𝐶 1stF 𝐷) ∈ ((𝐶 ×c 𝐷) Func 𝐶)) |
| 14 | 13, 4 | cofucl 17935 | . . . 4 ⊢ (𝜑 → (𝐺 ∘func (𝐶 1stF 𝐷)) ∈ ((𝐶 ×c 𝐷) Func (𝐷 FuncCat 𝐸))) |
| 15 | eqid 2765 | . . . . 5 ⊢ (𝐶 2ndF 𝐷) = (𝐶 2ndF 𝐷) | |
| 16 | 8, 11, 2, 15 | 2ndfcl 18244 | . . . 4 ⊢ (𝜑 → (𝐶 2ndF 𝐷) ∈ ((𝐶 ×c 𝐷) Func 𝐷)) |
| 17 | 6, 7, 14, 16 | prfcl 18249 | . . 3 ⊢ (𝜑 → ((𝐺 ∘func (𝐶 1stF 𝐷)) 〈,〉F (𝐶 2ndF 𝐷)) ∈ ((𝐶 ×c 𝐷) Func ((𝐷 FuncCat 𝐸) ×c 𝐷))) |
| 18 | eqid 2765 | . . . 4 ⊢ (𝐷 evalF 𝐸) = (𝐷 evalF 𝐸) | |
| 19 | eqid 2765 | . . . 4 ⊢ (𝐷 FuncCat 𝐸) = (𝐷 FuncCat 𝐸) | |
| 20 | 18, 19, 2, 3 | evlfcl 18268 | . . 3 ⊢ (𝜑 → (𝐷 evalF 𝐸) ∈ (((𝐷 FuncCat 𝐸) ×c 𝐷) Func 𝐸)) |
| 21 | 17, 20 | cofucl 17935 | . 2 ⊢ (𝜑 → ((𝐷 evalF 𝐸) ∘func ((𝐺 ∘func (𝐶 1stF 𝐷)) 〈,〉F (𝐶 2ndF 𝐷))) ∈ ((𝐶 ×c 𝐷) Func 𝐸)) |
| 22 | 5, 21 | eqeltrd 2865 | 1 ⊢ (𝜑 → 𝐹 ∈ ((𝐶 ×c 𝐷) Func 𝐸)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1563 ∈ wcel 2145 (class class class)co 7400 〈“cs3 14869 Catccat 17710 Func cfunc 17901 ∘func ccofu 17903 FuncCat cfuc 17992 ×c cxpc 18214 1stF c1stf 18215 2ndF c2ndf 18216 〈,〉F cprf 18217 evalF cevlf 18255 uncurryF cuncf 18257 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-uni 4869 df-int 4909 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-er 8682 df-map 8814 df-ixp 8884 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-card 9913 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-nn 12225 df-2 12294 df-3 12295 df-4 12296 df-5 12297 df-6 12298 df-7 12299 df-8 12300 df-9 12301 df-n0 12496 df-z 12583 df-dec 12703 df-uz 12854 df-fz 13527 df-fzo 13674 df-hash 14358 df-word 14541 df-concat 14598 df-s1 14624 df-s2 14875 df-s3 14876 df-struct 17197 df-slot 17232 df-ndx 17244 df-base 17260 df-hom 17324 df-cco 17325 df-cat 17714 df-cid 17715 df-func 17905 df-cofu 17907 df-nat 17993 df-fuc 17994 df-xpc 18218 df-1stf 18219 df-2ndf 18220 df-prf 18221 df-evlf 18259 df-uncf 18261 |
| This theorem is referenced by: curfuncf 18284 uncfcurf 18285 |
| Copyright terms: Public domain | W3C validator |