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

Theorem mpocurryd 8273
Description: The currying of an operation given in maps-to notation, splitting the operation (function of two arguments) into a function of the first argument, producing a function over the second argument. (Contributed by AV, 27-Oct-2019.)
Hypotheses
Ref Expression
mpocurryd.f 𝐹 = (𝑥𝑋, 𝑦𝑌𝐶)
mpocurryd.c (𝜑 → ∀𝑥𝑋𝑦𝑌 𝐶𝑉)
mpocurryd.n (𝜑𝑌 ≠ ∅)
Assertion
Ref Expression
mpocurryd (𝜑 → curry 𝐹 = (𝑥𝑋 ↦ (𝑦𝑌𝐶)))
Distinct variable groups:   𝑥,𝐹,𝑦   𝑥,𝑉,𝑦   𝑥,𝑋,𝑦   𝑥,𝑌,𝑦   𝜑,𝑥,𝑦
Allowed substitution hints:   𝐶(𝑥,𝑦)

Proof of Theorem mpocurryd
Dummy variables 𝑎 𝑏 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-cur 8271 . 2 curry 𝐹 = (𝑥 ∈ dom dom 𝐹 ↦ {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦𝐹𝑧})
2 mpocurryd.c . . . . . . 7 (𝜑 → ∀𝑥𝑋𝑦𝑌 𝐶𝑉)
3 mpocurryd.f . . . . . . . 8 𝐹 = (𝑥𝑋, 𝑦𝑌𝐶)
43dmmpoga 8075 . . . . . . 7 (∀𝑥𝑋𝑦𝑌 𝐶𝑉 → dom 𝐹 = (𝑋 × 𝑌))
52, 4syl 17 . . . . . 6 (𝜑 → dom 𝐹 = (𝑋 × 𝑌))
65dmeqd 5902 . . . . 5 (𝜑 → dom dom 𝐹 = dom (𝑋 × 𝑌))
7 mpocurryd.n . . . . . 6 (𝜑𝑌 ≠ ∅)
8 dmxp 5925 . . . . . 6 (𝑌 ≠ ∅ → dom (𝑋 × 𝑌) = 𝑋)
97, 8syl 17 . . . . 5 (𝜑 → dom (𝑋 × 𝑌) = 𝑋)
106, 9eqtrd 2765 . . . 4 (𝜑 → dom dom 𝐹 = 𝑋)
1110mpteq1d 5238 . . 3 (𝜑 → (𝑥 ∈ dom dom 𝐹 ↦ {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦𝐹𝑧}) = (𝑥𝑋 ↦ {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦𝐹𝑧}))
12 df-mpt 5227 . . . . 5 (𝑦𝑌𝐶) = {⟨𝑦, 𝑧⟩ ∣ (𝑦𝑌𝑧 = 𝐶)}
133mpofun 7541 . . . . . . . 8 Fun 𝐹
14 funbrfv2b 6951 . . . . . . . 8 (Fun 𝐹 → (⟨𝑥, 𝑦𝐹𝑧 ↔ (⟨𝑥, 𝑦⟩ ∈ dom 𝐹 ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧)))
1513, 14mp1i 13 . . . . . . 7 ((𝜑𝑥𝑋) → (⟨𝑥, 𝑦𝐹𝑧 ↔ (⟨𝑥, 𝑦⟩ ∈ dom 𝐹 ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧)))
165adantr 479 . . . . . . . . . 10 ((𝜑𝑥𝑋) → dom 𝐹 = (𝑋 × 𝑌))
1716eleq2d 2811 . . . . . . . . 9 ((𝜑𝑥𝑋) → (⟨𝑥, 𝑦⟩ ∈ dom 𝐹 ↔ ⟨𝑥, 𝑦⟩ ∈ (𝑋 × 𝑌)))
18 opelxp 5708 . . . . . . . . 9 (⟨𝑥, 𝑦⟩ ∈ (𝑋 × 𝑌) ↔ (𝑥𝑋𝑦𝑌))
1917, 18bitrdi 286 . . . . . . . 8 ((𝜑𝑥𝑋) → (⟨𝑥, 𝑦⟩ ∈ dom 𝐹 ↔ (𝑥𝑋𝑦𝑌)))
2019anbi1d 629 . . . . . . 7 ((𝜑𝑥𝑋) → ((⟨𝑥, 𝑦⟩ ∈ dom 𝐹 ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧) ↔ ((𝑥𝑋𝑦𝑌) ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧)))
21 an21 642 . . . . . . . 8 (((𝑥𝑋𝑦𝑌) ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧) ↔ (𝑦𝑌 ∧ (𝑥𝑋 ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧)))
22 ibar 527 . . . . . . . . . . . . 13 (𝑥𝑋 → ((𝐹‘⟨𝑥, 𝑦⟩) = 𝑧 ↔ (𝑥𝑋 ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧)))
2322bicomd 222 . . . . . . . . . . . 12 (𝑥𝑋 → ((𝑥𝑋 ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧) ↔ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧))
2423adantl 480 . . . . . . . . . . 11 ((𝜑𝑥𝑋) → ((𝑥𝑋 ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧) ↔ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧))
2524adantr 479 . . . . . . . . . 10 (((𝜑𝑥𝑋) ∧ 𝑦𝑌) → ((𝑥𝑋 ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧) ↔ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧))
26 df-ov 7419 . . . . . . . . . . . . 13 (𝑥𝐹𝑦) = (𝐹‘⟨𝑥, 𝑦⟩)
27 nfcv 2892 . . . . . . . . . . . . . . . . 17 𝑎𝐶
28 nfcv 2892 . . . . . . . . . . . . . . . . 17 𝑏𝐶
29 nfcv 2892 . . . . . . . . . . . . . . . . . 18 𝑥𝑏
30 nfcsb1v 3909 . . . . . . . . . . . . . . . . . 18 𝑥𝑎 / 𝑥𝐶
3129, 30nfcsbw 3911 . . . . . . . . . . . . . . . . 17 𝑥𝑏 / 𝑦𝑎 / 𝑥𝐶
32 nfcsb1v 3909 . . . . . . . . . . . . . . . . 17 𝑦𝑏 / 𝑦𝑎 / 𝑥𝐶
33 csbeq1a 3898 . . . . . . . . . . . . . . . . . 18 (𝑥 = 𝑎𝐶 = 𝑎 / 𝑥𝐶)
34 csbeq1a 3898 . . . . . . . . . . . . . . . . . 18 (𝑦 = 𝑏𝑎 / 𝑥𝐶 = 𝑏 / 𝑦𝑎 / 𝑥𝐶)
3533, 34sylan9eq 2785 . . . . . . . . . . . . . . . . 17 ((𝑥 = 𝑎𝑦 = 𝑏) → 𝐶 = 𝑏 / 𝑦𝑎 / 𝑥𝐶)
3627, 28, 31, 32, 35cbvmpo 7511 . . . . . . . . . . . . . . . 16 (𝑥𝑋, 𝑦𝑌𝐶) = (𝑎𝑋, 𝑏𝑌𝑏 / 𝑦𝑎 / 𝑥𝐶)
373, 36eqtri 2753 . . . . . . . . . . . . . . 15 𝐹 = (𝑎𝑋, 𝑏𝑌𝑏 / 𝑦𝑎 / 𝑥𝐶)
3837a1i 11 . . . . . . . . . . . . . 14 (((𝜑𝑥𝑋) ∧ 𝑦𝑌) → 𝐹 = (𝑎𝑋, 𝑏𝑌𝑏 / 𝑦𝑎 / 𝑥𝐶))
3933eqcomd 2731 . . . . . . . . . . . . . . . . . 18 (𝑥 = 𝑎𝑎 / 𝑥𝐶 = 𝐶)
4039equcoms 2015 . . . . . . . . . . . . . . . . 17 (𝑎 = 𝑥𝑎 / 𝑥𝐶 = 𝐶)
4140csbeq2dv 3891 . . . . . . . . . . . . . . . 16 (𝑎 = 𝑥𝑏 / 𝑦𝑎 / 𝑥𝐶 = 𝑏 / 𝑦𝐶)
42 csbeq1a 3898 . . . . . . . . . . . . . . . . . 18 (𝑦 = 𝑏𝐶 = 𝑏 / 𝑦𝐶)
4342eqcomd 2731 . . . . . . . . . . . . . . . . 17 (𝑦 = 𝑏𝑏 / 𝑦𝐶 = 𝐶)
4443equcoms 2015 . . . . . . . . . . . . . . . 16 (𝑏 = 𝑦𝑏 / 𝑦𝐶 = 𝐶)
4541, 44sylan9eq 2785 . . . . . . . . . . . . . . 15 ((𝑎 = 𝑥𝑏 = 𝑦) → 𝑏 / 𝑦𝑎 / 𝑥𝐶 = 𝐶)
4645adantl 480 . . . . . . . . . . . . . 14 ((((𝜑𝑥𝑋) ∧ 𝑦𝑌) ∧ (𝑎 = 𝑥𝑏 = 𝑦)) → 𝑏 / 𝑦𝑎 / 𝑥𝐶 = 𝐶)
47 simpr 483 . . . . . . . . . . . . . . 15 ((𝜑𝑥𝑋) → 𝑥𝑋)
4847adantr 479 . . . . . . . . . . . . . 14 (((𝜑𝑥𝑋) ∧ 𝑦𝑌) → 𝑥𝑋)
49 simpr 483 . . . . . . . . . . . . . 14 (((𝜑𝑥𝑋) ∧ 𝑦𝑌) → 𝑦𝑌)
50 rsp2 3265 . . . . . . . . . . . . . . . 16 (∀𝑥𝑋𝑦𝑌 𝐶𝑉 → ((𝑥𝑋𝑦𝑌) → 𝐶𝑉))
512, 50syl 17 . . . . . . . . . . . . . . 15 (𝜑 → ((𝑥𝑋𝑦𝑌) → 𝐶𝑉))
5251impl 454 . . . . . . . . . . . . . 14 (((𝜑𝑥𝑋) ∧ 𝑦𝑌) → 𝐶𝑉)
5338, 46, 48, 49, 52ovmpod 7570 . . . . . . . . . . . . 13 (((𝜑𝑥𝑋) ∧ 𝑦𝑌) → (𝑥𝐹𝑦) = 𝐶)
5426, 53eqtr3id 2779 . . . . . . . . . . . 12 (((𝜑𝑥𝑋) ∧ 𝑦𝑌) → (𝐹‘⟨𝑥, 𝑦⟩) = 𝐶)
5554eqeq1d 2727 . . . . . . . . . . 11 (((𝜑𝑥𝑋) ∧ 𝑦𝑌) → ((𝐹‘⟨𝑥, 𝑦⟩) = 𝑧𝐶 = 𝑧))
56 eqcom 2732 . . . . . . . . . . 11 (𝐶 = 𝑧𝑧 = 𝐶)
5755, 56bitrdi 286 . . . . . . . . . 10 (((𝜑𝑥𝑋) ∧ 𝑦𝑌) → ((𝐹‘⟨𝑥, 𝑦⟩) = 𝑧𝑧 = 𝐶))
5825, 57bitrd 278 . . . . . . . . 9 (((𝜑𝑥𝑋) ∧ 𝑦𝑌) → ((𝑥𝑋 ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧) ↔ 𝑧 = 𝐶))
5958pm5.32da 577 . . . . . . . 8 ((𝜑𝑥𝑋) → ((𝑦𝑌 ∧ (𝑥𝑋 ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧)) ↔ (𝑦𝑌𝑧 = 𝐶)))
6021, 59bitrid 282 . . . . . . 7 ((𝜑𝑥𝑋) → (((𝑥𝑋𝑦𝑌) ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧) ↔ (𝑦𝑌𝑧 = 𝐶)))
6115, 20, 603bitrrd 305 . . . . . 6 ((𝜑𝑥𝑋) → ((𝑦𝑌𝑧 = 𝐶) ↔ ⟨𝑥, 𝑦𝐹𝑧))
6261opabbidv 5209 . . . . 5 ((𝜑𝑥𝑋) → {⟨𝑦, 𝑧⟩ ∣ (𝑦𝑌𝑧 = 𝐶)} = {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦𝐹𝑧})
6312, 62eqtr2id 2778 . . . 4 ((𝜑𝑥𝑋) → {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦𝐹𝑧} = (𝑦𝑌𝐶))
6463mpteq2dva 5243 . . 3 (𝜑 → (𝑥𝑋 ↦ {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦𝐹𝑧}) = (𝑥𝑋 ↦ (𝑦𝑌𝐶)))
6511, 64eqtrd 2765 . 2 (𝜑 → (𝑥 ∈ dom dom 𝐹 ↦ {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦𝐹𝑧}) = (𝑥𝑋 ↦ (𝑦𝑌𝐶)))
661, 65eqtrid 2777 1 (𝜑 → curry 𝐹 = (𝑥𝑋 ↦ (𝑦𝑌𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 394   = wceq 1533  wcel 2098  wne 2930  wral 3051  csb 3884  c0 4318  cop 4630   class class class wbr 5143  {copab 5205  cmpt 5226   × cxp 5670  dom cdm 5672  Fun wfun 6537  cfv 6543  (class class class)co 7416  cmpo 7418  curry ccur 8269
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-sep 5294  ax-nul 5301  ax-pr 5423  ax-un 7738
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2931  df-ral 3052  df-rex 3061  df-rab 3420  df-v 3465  df-sbc 3769  df-csb 3885  df-dif 3942  df-un 3944  df-in 3946  df-ss 3956  df-nul 4319  df-if 4525  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4904  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5227  df-id 5570  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7991  df-2nd 7992  df-cur 8271
This theorem is referenced by:  mpocurryvald  8274  curfv  37130
  Copyright terms: Public domain W3C validator