| 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 18200 | . 2 ⊢ (𝜑 → 𝐹 = ((𝐷 evalF 𝐸) ∘func ((𝐺 ∘func (𝐶 1stF 𝐷)) 〈,〉F (𝐶 2ndF 𝐷)))) |
| 6 | eqid 2736 | . . . 4 ⊢ ((𝐺 ∘func (𝐶 1stF 𝐷)) 〈,〉F (𝐶 2ndF 𝐷)) = ((𝐺 ∘func (𝐶 1stF 𝐷)) 〈,〉F (𝐶 2ndF 𝐷)) | |
| 7 | eqid 2736 | . . . 4 ⊢ ((𝐷 FuncCat 𝐸) ×c 𝐷) = ((𝐷 FuncCat 𝐸) ×c 𝐷) | |
| 8 | eqid 2736 | . . . . . 6 ⊢ (𝐶 ×c 𝐷) = (𝐶 ×c 𝐷) | |
| 9 | funcrcl 17830 | . . . . . . . 8 ⊢ (𝐺 ∈ (𝐶 Func (𝐷 FuncCat 𝐸)) → (𝐶 ∈ Cat ∧ (𝐷 FuncCat 𝐸) ∈ Cat)) | |
| 10 | 4, 9 | syl 17 | . . . . . . 7 ⊢ (𝜑 → (𝐶 ∈ Cat ∧ (𝐷 FuncCat 𝐸) ∈ Cat)) |
| 11 | 10 | simpld 494 | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ Cat) |
| 12 | eqid 2736 | . . . . . 6 ⊢ (𝐶 1stF 𝐷) = (𝐶 1stF 𝐷) | |
| 13 | 8, 11, 2, 12 | 1stfcl 18163 | . . . . 5 ⊢ (𝜑 → (𝐶 1stF 𝐷) ∈ ((𝐶 ×c 𝐷) Func 𝐶)) |
| 14 | 13, 4 | cofucl 17855 | . . . 4 ⊢ (𝜑 → (𝐺 ∘func (𝐶 1stF 𝐷)) ∈ ((𝐶 ×c 𝐷) Func (𝐷 FuncCat 𝐸))) |
| 15 | eqid 2736 | . . . . 5 ⊢ (𝐶 2ndF 𝐷) = (𝐶 2ndF 𝐷) | |
| 16 | 8, 11, 2, 15 | 2ndfcl 18164 | . . . 4 ⊢ (𝜑 → (𝐶 2ndF 𝐷) ∈ ((𝐶 ×c 𝐷) Func 𝐷)) |
| 17 | 6, 7, 14, 16 | prfcl 18169 | . . 3 ⊢ (𝜑 → ((𝐺 ∘func (𝐶 1stF 𝐷)) 〈,〉F (𝐶 2ndF 𝐷)) ∈ ((𝐶 ×c 𝐷) Func ((𝐷 FuncCat 𝐸) ×c 𝐷))) |
| 18 | eqid 2736 | . . . 4 ⊢ (𝐷 evalF 𝐸) = (𝐷 evalF 𝐸) | |
| 19 | eqid 2736 | . . . 4 ⊢ (𝐷 FuncCat 𝐸) = (𝐷 FuncCat 𝐸) | |
| 20 | 18, 19, 2, 3 | evlfcl 18188 | . . 3 ⊢ (𝜑 → (𝐷 evalF 𝐸) ∈ (((𝐷 FuncCat 𝐸) ×c 𝐷) Func 𝐸)) |
| 21 | 17, 20 | cofucl 17855 | . 2 ⊢ (𝜑 → ((𝐷 evalF 𝐸) ∘func ((𝐺 ∘func (𝐶 1stF 𝐷)) 〈,〉F (𝐶 2ndF 𝐷))) ∈ ((𝐶 ×c 𝐷) Func 𝐸)) |
| 22 | 5, 21 | eqeltrd 2836 | 1 ⊢ (𝜑 → 𝐹 ∈ ((𝐶 ×c 𝐷) Func 𝐸)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 (class class class)co 7367 〈“cs3 14804 Catccat 17630 Func cfunc 17821 ∘func ccofu 17823 FuncCat cfuc 17912 ×c cxpc 18134 1stF c1stf 18135 2ndF c2ndf 18136 〈,〉F cprf 18137 evalF cevlf 18175 uncurryF cuncf 18177 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-er 8643 df-map 8775 df-ixp 8846 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-card 9863 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-2 12244 df-3 12245 df-4 12246 df-5 12247 df-6 12248 df-7 12249 df-8 12250 df-9 12251 df-n0 12438 df-z 12525 df-dec 12645 df-uz 12789 df-fz 13462 df-fzo 13609 df-hash 14293 df-word 14476 df-concat 14533 df-s1 14559 df-s2 14810 df-s3 14811 df-struct 17117 df-slot 17152 df-ndx 17164 df-base 17180 df-hom 17244 df-cco 17245 df-cat 17634 df-cid 17635 df-func 17825 df-cofu 17827 df-nat 17913 df-fuc 17914 df-xpc 18138 df-1stf 18139 df-2ndf 18140 df-prf 18141 df-evlf 18179 df-uncf 18181 |
| This theorem is referenced by: curfuncf 18204 uncfcurf 18205 |
| Copyright terms: Public domain | W3C validator |