Theorem mpocurryd 8274

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.

Step	Hyp	Ref	Expression
1		df-cur 8272	. 2 ⊢ curry 𝐹 = (𝑥 ∈ dom dom 𝐹 ↦ {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐹𝑧})
2		mpocurryd.c	. . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 𝐶 ∈ 𝑉)
3		mpocurryd.f	. . . . . . . 8 ⊢ 𝐹 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶)
4	3	dmmpoga 8079	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 𝐶 ∈ 𝑉 → dom 𝐹 = (𝑋 × 𝑌))
5	2, 4	syl 18	. . . . . 6 ⊢ (𝜑 → dom 𝐹 = (𝑋 × 𝑌))
6	5	dmeqd 5900	. . . . 5 ⊢ (𝜑 → dom dom 𝐹 = dom (𝑋 × 𝑌))
7		mpocurryd.n	. . . . . 6 ⊢ (𝜑 → 𝑌 ≠ ∅)
8		dmxp 5924	. . . . . 6 ⊢ (𝑌 ≠ ∅ → dom (𝑋 × 𝑌) = 𝑋)
9	7, 8	syl 18	. . . . 5 ⊢ (𝜑 → dom (𝑋 × 𝑌) = 𝑋)
10	6, 9	eqtrd 2801	. . . 4 ⊢ (𝜑 → dom dom 𝐹 = 𝑋)
11	10	mpteq1d 5206	. . 3 ⊢ (𝜑 → (𝑥 ∈ dom dom 𝐹 ↦ {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐹𝑧}) = (𝑥 ∈ 𝑋 ↦ {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐹𝑧}))
12		df-mpt 5198	. . . . 5 ⊢ (𝑦 ∈ 𝑌 ↦ 𝐶) = {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ 𝑌 ∧ 𝑧 = 𝐶)}
13	3	mpofun 7547	. . . . . . . 8 ⊢ Fun 𝐹
14		funbrfv2b 6945	. . . . . . . 8 ⊢ (Fun 𝐹 → (⟨𝑥, 𝑦⟩𝐹𝑧 ↔ (⟨𝑥, 𝑦⟩ ∈ dom 𝐹 ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧)))
15	13, 14	mp1i 14	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (⟨𝑥, 𝑦⟩𝐹𝑧 ↔ (⟨𝑥, 𝑦⟩ ∈ dom 𝐹 ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧)))
16	5	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → dom 𝐹 = (𝑋 × 𝑌))
17	16	eleq2d 2852	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (⟨𝑥, 𝑦⟩ ∈ dom 𝐹 ↔ ⟨𝑥, 𝑦⟩ ∈ (𝑋 × 𝑌)))
18		opelxp 5702	. . . . . . . . 9 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝑋 × 𝑌) ↔ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑌))
19	17, 18	bitrdi 290	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (⟨𝑥, 𝑦⟩ ∈ dom 𝐹 ↔ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑌)))
20	19	anbi1d 643	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((⟨𝑥, 𝑦⟩ ∈ dom 𝐹 ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧) ↔ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑌) ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧)))
21		an21 657	. . . . . . . 8 ⊢ (((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑌) ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧) ↔ (𝑦 ∈ 𝑌 ∧ (𝑥 ∈ 𝑋 ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧)))
22		ibar 538	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝑋 → ((𝐹‘⟨𝑥, 𝑦⟩) = 𝑧 ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧)))
23	22	bicomd 226	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ 𝑋 → ((𝑥 ∈ 𝑋 ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧) ↔ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧))
24	23	adantl 487	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝑥 ∈ 𝑋 ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧) ↔ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧))
25	24	adantr 486	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑌) → ((𝑥 ∈ 𝑋 ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧) ↔ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧))
26		df-ov 7426	. . . . . . . . . . . . 13 ⊢ (𝑥𝐹𝑦) = (𝐹‘⟨𝑥, 𝑦⟩)
27		nfcv 2928	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑎𝐶
28		nfcv 2928	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑏𝐶
29		nfcv 2928	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑥𝑏
30		nfcsb1v 3880	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑥⦋𝑎 / 𝑥⦌𝐶
31	29, 30	nfcsbw 3882	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑥⦋𝑏 / 𝑦⦌⦋𝑎 / 𝑥⦌𝐶
32		nfcsb1v 3880	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑦⦋𝑏 / 𝑦⦌⦋𝑎 / 𝑥⦌𝐶
33		csbeq1a 3870	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑎 → 𝐶 = ⦋𝑎 / 𝑥⦌𝐶)
34		csbeq1a 3870	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = 𝑏 → ⦋𝑎 / 𝑥⦌𝐶 = ⦋𝑏 / 𝑦⦌⦋𝑎 / 𝑥⦌𝐶)
35	33, 34	sylan9eq 2821	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 = 𝑎 ∧ 𝑦 = 𝑏) → 𝐶 = ⦋𝑏 / 𝑦⦌⦋𝑎 / 𝑥⦌𝐶)
36	27, 28, 31, 32, 35	cbvmpo 7517	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶) = (𝑎 ∈ 𝑋, 𝑏 ∈ 𝑌 ↦ ⦋𝑏 / 𝑦⦌⦋𝑎 / 𝑥⦌𝐶)
37	3, 36	eqtri 2789	. . . . . . . . . . . . . . 15 ⊢ 𝐹 = (𝑎 ∈ 𝑋, 𝑏 ∈ 𝑌 ↦ ⦋𝑏 / 𝑦⦌⦋𝑎 / 𝑥⦌𝐶)
38	37	a1i 11	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑌) → 𝐹 = (𝑎 ∈ 𝑋, 𝑏 ∈ 𝑌 ↦ ⦋𝑏 / 𝑦⦌⦋𝑎 / 𝑥⦌𝐶))
39	33	eqcomd 2772	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑎 → ⦋𝑎 / 𝑥⦌𝐶 = 𝐶)
40	39	equcoms 2053	. . . . . . . . . . . . . . . . 17 ⊢ (𝑎 = 𝑥 → ⦋𝑎 / 𝑥⦌𝐶 = 𝐶)
41	40	csbeq2dv 3863	. . . . . . . . . . . . . . . 16 ⊢ (𝑎 = 𝑥 → ⦋𝑏 / 𝑦⦌⦋𝑎 / 𝑥⦌𝐶 = ⦋𝑏 / 𝑦⦌𝐶)
42		csbeq1a 3870	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = 𝑏 → 𝐶 = ⦋𝑏 / 𝑦⦌𝐶)
43	42	eqcomd 2772	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = 𝑏 → ⦋𝑏 / 𝑦⦌𝐶 = 𝐶)
44	43	equcoms 2053	. . . . . . . . . . . . . . . 16 ⊢ (𝑏 = 𝑦 → ⦋𝑏 / 𝑦⦌𝐶 = 𝐶)
45	41, 44	sylan9eq 2821	. . . . . . . . . . . . . . 15 ⊢ ((𝑎 = 𝑥 ∧ 𝑏 = 𝑦) → ⦋𝑏 / 𝑦⦌⦋𝑎 / 𝑥⦌𝐶 = 𝐶)
46	45	adantl 487	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑌) ∧ (𝑎 = 𝑥 ∧ 𝑏 = 𝑦)) → ⦋𝑏 / 𝑦⦌⦋𝑎 / 𝑥⦌𝐶 = 𝐶)
47		simpr 490	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋)
48	47	adantr 486	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑌) → 𝑥 ∈ 𝑋)
49		simpr 490	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑌) → 𝑦 ∈ 𝑌)
50		rsp2 3285	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 𝐶 ∈ 𝑉 → ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑌) → 𝐶 ∈ 𝑉))
51	2, 50	syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑌) → 𝐶 ∈ 𝑉))
52	51	impl 461	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑌) → 𝐶 ∈ 𝑉)
53	38, 46, 48, 49, 52	ovmpod 7575	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑌) → (𝑥𝐹𝑦) = 𝐶)
54	26, 53	eqtr3id 2815	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑌) → (𝐹‘⟨𝑥, 𝑦⟩) = 𝐶)
55	54	eqeq1d 2768	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑌) → ((𝐹‘⟨𝑥, 𝑦⟩) = 𝑧 ↔ 𝐶 = 𝑧))
56		eqcom 2773	. . . . . . . . . . 11 ⊢ (𝐶 = 𝑧 ↔ 𝑧 = 𝐶)
57	55, 56	bitrdi 290	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑌) → ((𝐹‘⟨𝑥, 𝑦⟩) = 𝑧 ↔ 𝑧 = 𝐶))
58	25, 57	bitrd 282	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑌) → ((𝑥 ∈ 𝑋 ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧) ↔ 𝑧 = 𝐶))
59	58	pm5.32da 590	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝑦 ∈ 𝑌 ∧ (𝑥 ∈ 𝑋 ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧)) ↔ (𝑦 ∈ 𝑌 ∧ 𝑧 = 𝐶)))
60	21, 59	bitrid 286	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑌) ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧) ↔ (𝑦 ∈ 𝑌 ∧ 𝑧 = 𝐶)))
61	15, 20, 60	3bitrrd 309	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝑦 ∈ 𝑌 ∧ 𝑧 = 𝐶) ↔ ⟨𝑥, 𝑦⟩𝐹𝑧))
62	61	opabbidv 5182	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ 𝑌 ∧ 𝑧 = 𝐶)} = {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐹𝑧})
63	12, 62	eqtr2id 2814	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐹𝑧} = (𝑦 ∈ 𝑌 ↦ 𝐶))
64	63	mpteq2dva 5209	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐹𝑧}) = (𝑥 ∈ 𝑋 ↦ (𝑦 ∈ 𝑌 ↦ 𝐶)))
65	11, 64	eqtrd 2801	. 2 ⊢ (𝜑 → (𝑥 ∈ dom dom 𝐹 ↦ {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐹𝑧}) = (𝑥 ∈ 𝑋 ↦ (𝑦 ∈ 𝑌 ↦ 𝐶)))
66	1, 65	eqtrid 2813	1 ⊢ (𝜑 → curry 𝐹 = (𝑥 ∈ 𝑋 ↦ (𝑦 ∈ 𝑌 ↦ 𝐶)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146   ≠ wne 2961  ∀wral 3082  ⦋csb 3856  ∅c0 4289  ⟨cop 4600   class class class wbr 5114  {copab 5178   ↦ cmpt 5197   × cxp 5664  dom cdm 5666  Fun wfun 6537  ‘cfv 6543  (class class class)co 7423   ∈ cmpo 7425  curry ccur 8270

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409  ax-un 7745

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-1st 7995  df-2nd 7996  df-cur 8272

This theorem is used by:  mpocurryvald  8275  curfv  38292