| 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 18249 | . 2 ⊢ (𝜑 → 𝐹 = ((𝐷 evalF 𝐸) ∘func ((𝐺 ∘func (𝐶 1stF 𝐷)) 〈,〉F (𝐶 2ndF 𝐷)))) |
| 6 | eqid 2761 | . . . 4 ⊢ ((𝐺 ∘func (𝐶 1stF 𝐷)) 〈,〉F (𝐶 2ndF 𝐷)) = ((𝐺 ∘func (𝐶 1stF 𝐷)) 〈,〉F (𝐶 2ndF 𝐷)) | |
| 7 | eqid 2761 | . . . 4 ⊢ ((𝐷 FuncCat 𝐸) ×c 𝐷) = ((𝐷 FuncCat 𝐸) ×c 𝐷) | |
| 8 | eqid 2761 | . . . . . 6 ⊢ (𝐶 ×c 𝐷) = (𝐶 ×c 𝐷) | |
| 9 | funcrcl 17879 | . . . . . . . 8 ⊢ (𝐺 ∈ (𝐶 Func (𝐷 FuncCat 𝐸)) → (𝐶 ∈ Cat ∧ (𝐷 FuncCat 𝐸) ∈ Cat)) | |
| 10 | 4, 9 | syl 17 | . . . . . . 7 ⊢ (𝜑 → (𝐶 ∈ Cat ∧ (𝐷 FuncCat 𝐸) ∈ Cat)) |
| 11 | 10 | simpld 498 | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ Cat) |
| 12 | eqid 2761 | . . . . . 6 ⊢ (𝐶 1stF 𝐷) = (𝐶 1stF 𝐷) | |
| 13 | 8, 11, 2, 12 | 1stfcl 18212 | . . . . 5 ⊢ (𝜑 → (𝐶 1stF 𝐷) ∈ ((𝐶 ×c 𝐷) Func 𝐶)) |
| 14 | 13, 4 | cofucl 17904 | . . . 4 ⊢ (𝜑 → (𝐺 ∘func (𝐶 1stF 𝐷)) ∈ ((𝐶 ×c 𝐷) Func (𝐷 FuncCat 𝐸))) |
| 15 | eqid 2761 | . . . . 5 ⊢ (𝐶 2ndF 𝐷) = (𝐶 2ndF 𝐷) | |
| 16 | 8, 11, 2, 15 | 2ndfcl 18213 | . . . 4 ⊢ (𝜑 → (𝐶 2ndF 𝐷) ∈ ((𝐶 ×c 𝐷) Func 𝐷)) |
| 17 | 6, 7, 14, 16 | prfcl 18218 | . . 3 ⊢ (𝜑 → ((𝐺 ∘func (𝐶 1stF 𝐷)) 〈,〉F (𝐶 2ndF 𝐷)) ∈ ((𝐶 ×c 𝐷) Func ((𝐷 FuncCat 𝐸) ×c 𝐷))) |
| 18 | eqid 2761 | . . . 4 ⊢ (𝐷 evalF 𝐸) = (𝐷 evalF 𝐸) | |
| 19 | eqid 2761 | . . . 4 ⊢ (𝐷 FuncCat 𝐸) = (𝐷 FuncCat 𝐸) | |
| 20 | 18, 19, 2, 3 | evlfcl 18237 | . . 3 ⊢ (𝜑 → (𝐷 evalF 𝐸) ∈ (((𝐷 FuncCat 𝐸) ×c 𝐷) Func 𝐸)) |
| 21 | 17, 20 | cofucl 17904 | . 2 ⊢ (𝜑 → ((𝐷 evalF 𝐸) ∘func ((𝐺 ∘func (𝐶 1stF 𝐷)) 〈,〉F (𝐶 2ndF 𝐷))) ∈ ((𝐶 ×c 𝐷) Func 𝐸)) |
| 22 | 5, 21 | eqeltrd 2861 | 1 ⊢ (𝜑 → 𝐹 ∈ ((𝐶 ×c 𝐷) Func 𝐸)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1559 ∈ wcel 2141 (class class class)co 7392 〈“cs3 14852 Catccat 17679 Func cfunc 17870 ∘func ccofu 17872 FuncCat cfuc 17961 ×c cxpc 18183 1stF c1stf 18184 2ndF c2ndf 18185 〈,〉F cprf 18186 evalF cevlf 18224 uncurryF cuncf 18226 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 ax-cnex 11126 ax-resscn 11127 ax-1cn 11128 ax-icn 11129 ax-addcl 11130 ax-addrcl 11131 ax-mulcl 11132 ax-mulrcl 11133 ax-mulcom 11134 ax-addass 11135 ax-mulass 11136 ax-distr 11137 ax-i2m1 11138 ax-1ne0 11139 ax-1rid 11140 ax-rnegex 11141 ax-rrecex 11142 ax-cnre 11143 ax-pre-lttri 11144 ax-pre-lttrn 11145 ax-pre-ltadd 11146 ax-pre-mulgt0 11147 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-tp 4586 df-op 4588 df-uni 4865 df-int 4905 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6284 df-ord 6345 df-on 6346 df-lim 6347 df-suc 6348 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-riota 7349 df-ov 7395 df-oprab 7396 df-mpo 7397 df-om 7843 df-1st 7966 df-2nd 7967 df-frecs 8257 df-wrecs 8288 df-recs 8337 df-rdg 8376 df-1o 8432 df-er 8673 df-map 8805 df-ixp 8876 df-en 8924 df-dom 8925 df-sdom 8926 df-fin 8927 df-card 9894 df-pnf 11215 df-mnf 11216 df-xr 11217 df-ltxr 11218 df-le 11219 df-sub 11413 df-neg 11414 df-nn 12208 df-2 12277 df-3 12278 df-4 12279 df-5 12280 df-6 12281 df-7 12282 df-8 12283 df-9 12284 df-n0 12479 df-z 12566 df-dec 12686 df-uz 12837 df-fz 13510 df-fzo 13657 df-hash 14341 df-word 14524 df-concat 14581 df-s1 14607 df-s2 14858 df-s3 14859 df-struct 17166 df-slot 17201 df-ndx 17213 df-base 17229 df-hom 17293 df-cco 17294 df-cat 17683 df-cid 17684 df-func 17874 df-cofu 17876 df-nat 17962 df-fuc 17963 df-xpc 18187 df-1stf 18188 df-2ndf 18189 df-prf 18190 df-evlf 18228 df-uncf 18230 |
| This theorem is referenced by: curfuncf 18253 uncfcurf 18254 |
| Copyright terms: Public domain | W3C validator |