Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  uncfval Structured version   Visualization version   GIF version

Theorem uncfval 16697
 Description: Value of the uncurry functor, which is the reverse of the curry functor, taking 𝐺:𝐶⟶(𝐷⟶𝐸) to uncurryF (𝐺):𝐶 × 𝐷⟶𝐸. (Contributed by Mario Carneiro, 13-Jan-2017.)
Hypotheses
Ref Expression
uncfval.g 𝐹 = (⟨“𝐶𝐷𝐸”⟩ uncurryF 𝐺)
uncfval.c (𝜑𝐷 ∈ Cat)
uncfval.d (𝜑𝐸 ∈ Cat)
uncfval.f (𝜑𝐺 ∈ (𝐶 Func (𝐷 FuncCat 𝐸)))
Assertion
Ref Expression
uncfval (𝜑𝐹 = ((𝐷 evalF 𝐸) ∘func ((𝐺func (𝐶 1stF 𝐷)) ⟨,⟩F (𝐶 2ndF 𝐷))))

Proof of Theorem uncfval
Dummy variables 𝑓 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 uncfval.g . 2 𝐹 = (⟨“𝐶𝐷𝐸”⟩ uncurryF 𝐺)
2 df-uncf 16678 . . . 4 uncurryF = (𝑐 ∈ V, 𝑓 ∈ V ↦ (((𝑐‘1) evalF (𝑐‘2)) ∘func ((𝑓func ((𝑐‘0) 1stF (𝑐‘1))) ⟨,⟩F ((𝑐‘0) 2ndF (𝑐‘1)))))
32a1i 11 . . 3 (𝜑 → uncurryF = (𝑐 ∈ V, 𝑓 ∈ V ↦ (((𝑐‘1) evalF (𝑐‘2)) ∘func ((𝑓func ((𝑐‘0) 1stF (𝑐‘1))) ⟨,⟩F ((𝑐‘0) 2ndF (𝑐‘1))))))
4 simprl 790 . . . . . . 7 ((𝜑 ∧ (𝑐 = ⟨“𝐶𝐷𝐸”⟩ ∧ 𝑓 = 𝐺)) → 𝑐 = ⟨“𝐶𝐷𝐸”⟩)
54fveq1d 6105 . . . . . 6 ((𝜑 ∧ (𝑐 = ⟨“𝐶𝐷𝐸”⟩ ∧ 𝑓 = 𝐺)) → (𝑐‘1) = (⟨“𝐶𝐷𝐸”⟩‘1))
6 uncfval.c . . . . . . . 8 (𝜑𝐷 ∈ Cat)
7 s3fv1 13487 . . . . . . . 8 (𝐷 ∈ Cat → (⟨“𝐶𝐷𝐸”⟩‘1) = 𝐷)
86, 7syl 17 . . . . . . 7 (𝜑 → (⟨“𝐶𝐷𝐸”⟩‘1) = 𝐷)
98adantr 480 . . . . . 6 ((𝜑 ∧ (𝑐 = ⟨“𝐶𝐷𝐸”⟩ ∧ 𝑓 = 𝐺)) → (⟨“𝐶𝐷𝐸”⟩‘1) = 𝐷)
105, 9eqtrd 2644 . . . . 5 ((𝜑 ∧ (𝑐 = ⟨“𝐶𝐷𝐸”⟩ ∧ 𝑓 = 𝐺)) → (𝑐‘1) = 𝐷)
114fveq1d 6105 . . . . . 6 ((𝜑 ∧ (𝑐 = ⟨“𝐶𝐷𝐸”⟩ ∧ 𝑓 = 𝐺)) → (𝑐‘2) = (⟨“𝐶𝐷𝐸”⟩‘2))
12 uncfval.d . . . . . . . 8 (𝜑𝐸 ∈ Cat)
13 s3fv2 13488 . . . . . . . 8 (𝐸 ∈ Cat → (⟨“𝐶𝐷𝐸”⟩‘2) = 𝐸)
1412, 13syl 17 . . . . . . 7 (𝜑 → (⟨“𝐶𝐷𝐸”⟩‘2) = 𝐸)
1514adantr 480 . . . . . 6 ((𝜑 ∧ (𝑐 = ⟨“𝐶𝐷𝐸”⟩ ∧ 𝑓 = 𝐺)) → (⟨“𝐶𝐷𝐸”⟩‘2) = 𝐸)
1611, 15eqtrd 2644 . . . . 5 ((𝜑 ∧ (𝑐 = ⟨“𝐶𝐷𝐸”⟩ ∧ 𝑓 = 𝐺)) → (𝑐‘2) = 𝐸)
1710, 16oveq12d 6567 . . . 4 ((𝜑 ∧ (𝑐 = ⟨“𝐶𝐷𝐸”⟩ ∧ 𝑓 = 𝐺)) → ((𝑐‘1) evalF (𝑐‘2)) = (𝐷 evalF 𝐸))
18 simprr 792 . . . . . 6 ((𝜑 ∧ (𝑐 = ⟨“𝐶𝐷𝐸”⟩ ∧ 𝑓 = 𝐺)) → 𝑓 = 𝐺)
194fveq1d 6105 . . . . . . . 8 ((𝜑 ∧ (𝑐 = ⟨“𝐶𝐷𝐸”⟩ ∧ 𝑓 = 𝐺)) → (𝑐‘0) = (⟨“𝐶𝐷𝐸”⟩‘0))
20 uncfval.f . . . . . . . . . . . 12 (𝜑𝐺 ∈ (𝐶 Func (𝐷 FuncCat 𝐸)))
21 funcrcl 16346 . . . . . . . . . . . 12 (𝐺 ∈ (𝐶 Func (𝐷 FuncCat 𝐸)) → (𝐶 ∈ Cat ∧ (𝐷 FuncCat 𝐸) ∈ Cat))
2220, 21syl 17 . . . . . . . . . . 11 (𝜑 → (𝐶 ∈ Cat ∧ (𝐷 FuncCat 𝐸) ∈ Cat))
2322simpld 474 . . . . . . . . . 10 (𝜑𝐶 ∈ Cat)
24 s3fv0 13486 . . . . . . . . . 10 (𝐶 ∈ Cat → (⟨“𝐶𝐷𝐸”⟩‘0) = 𝐶)
2523, 24syl 17 . . . . . . . . 9 (𝜑 → (⟨“𝐶𝐷𝐸”⟩‘0) = 𝐶)
2625adantr 480 . . . . . . . 8 ((𝜑 ∧ (𝑐 = ⟨“𝐶𝐷𝐸”⟩ ∧ 𝑓 = 𝐺)) → (⟨“𝐶𝐷𝐸”⟩‘0) = 𝐶)
2719, 26eqtrd 2644 . . . . . . 7 ((𝜑 ∧ (𝑐 = ⟨“𝐶𝐷𝐸”⟩ ∧ 𝑓 = 𝐺)) → (𝑐‘0) = 𝐶)
2827, 10oveq12d 6567 . . . . . 6 ((𝜑 ∧ (𝑐 = ⟨“𝐶𝐷𝐸”⟩ ∧ 𝑓 = 𝐺)) → ((𝑐‘0) 1stF (𝑐‘1)) = (𝐶 1stF 𝐷))
2918, 28oveq12d 6567 . . . . 5 ((𝜑 ∧ (𝑐 = ⟨“𝐶𝐷𝐸”⟩ ∧ 𝑓 = 𝐺)) → (𝑓func ((𝑐‘0) 1stF (𝑐‘1))) = (𝐺func (𝐶 1stF 𝐷)))
3027, 10oveq12d 6567 . . . . 5 ((𝜑 ∧ (𝑐 = ⟨“𝐶𝐷𝐸”⟩ ∧ 𝑓 = 𝐺)) → ((𝑐‘0) 2ndF (𝑐‘1)) = (𝐶 2ndF 𝐷))
3129, 30oveq12d 6567 . . . 4 ((𝜑 ∧ (𝑐 = ⟨“𝐶𝐷𝐸”⟩ ∧ 𝑓 = 𝐺)) → ((𝑓func ((𝑐‘0) 1stF (𝑐‘1))) ⟨,⟩F ((𝑐‘0) 2ndF (𝑐‘1))) = ((𝐺func (𝐶 1stF 𝐷)) ⟨,⟩F (𝐶 2ndF 𝐷)))
3217, 31oveq12d 6567 . . 3 ((𝜑 ∧ (𝑐 = ⟨“𝐶𝐷𝐸”⟩ ∧ 𝑓 = 𝐺)) → (((𝑐‘1) evalF (𝑐‘2)) ∘func ((𝑓func ((𝑐‘0) 1stF (𝑐‘1))) ⟨,⟩F ((𝑐‘0) 2ndF (𝑐‘1)))) = ((𝐷 evalF 𝐸) ∘func ((𝐺func (𝐶 1stF 𝐷)) ⟨,⟩F (𝐶 2ndF 𝐷))))
33 s3cli 13476 . . . 4 ⟨“𝐶𝐷𝐸”⟩ ∈ Word V
34 elex 3185 . . . 4 (⟨“𝐶𝐷𝐸”⟩ ∈ Word V → ⟨“𝐶𝐷𝐸”⟩ ∈ V)
3533, 34mp1i 13 . . 3 (𝜑 → ⟨“𝐶𝐷𝐸”⟩ ∈ V)
36 elex 3185 . . . 4 (𝐺 ∈ (𝐶 Func (𝐷 FuncCat 𝐸)) → 𝐺 ∈ V)
3720, 36syl 17 . . 3 (𝜑𝐺 ∈ V)
38 ovex 6577 . . . 4 ((𝐷 evalF 𝐸) ∘func ((𝐺func (𝐶 1stF 𝐷)) ⟨,⟩F (𝐶 2ndF 𝐷))) ∈ V
3938a1i 11 . . 3 (𝜑 → ((𝐷 evalF 𝐸) ∘func ((𝐺func (𝐶 1stF 𝐷)) ⟨,⟩F (𝐶 2ndF 𝐷))) ∈ V)
403, 32, 35, 37, 39ovmpt2d 6686 . 2 (𝜑 → (⟨“𝐶𝐷𝐸”⟩ uncurryF 𝐺) = ((𝐷 evalF 𝐸) ∘func ((𝐺func (𝐶 1stF 𝐷)) ⟨,⟩F (𝐶 2ndF 𝐷))))
411, 40syl5eq 2656 1 (𝜑𝐹 = ((𝐷 evalF 𝐸) ∘func ((𝐺func (𝐶 1stF 𝐷)) ⟨,⟩F (𝐶 2ndF 𝐷))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  Vcvv 3173  ‘cfv 5804  (class class class)co 6549   ↦ cmpt2 6551  0cc0 9815  1c1 9816  2c2 10947  Word cword 13146  ⟨“cs3 13438  Catccat 16148   Func cfunc 16337   ∘func ccofu 16339   FuncCat cfuc 16425   1stF c1stf 16632   2ndF c2ndf 16633   ⟨,⟩F cprf 16634   evalF cevlf 16672   uncurryF cuncf 16674 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-oadd 7451  df-er 7629  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-card 8648  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-2 10956  df-n0 11170  df-z 11255  df-uz 11564  df-fz 12198  df-fzo 12335  df-hash 12980  df-word 13154  df-concat 13156  df-s1 13157  df-s2 13444  df-s3 13445  df-func 16341  df-uncf 16678 This theorem is referenced by:  uncfcl  16698  uncf1  16699  uncf2  16700
 Copyright terms: Public domain W3C validator