Theorem unccur 38731

Description: Uncurrying of currying. (Contributed by Brendan Leahy, 5-Jun-2021.)

Assertion

Ref	Expression
unccur	⊢ ((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) → uncurry curry 𝐹 = 𝐹)

Proof of Theorem unccur

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ffn 6734	. . . . . . . . 9 ⊢ (𝐹:(𝐴 × 𝐵)⟶𝐶 → 𝐹 Fn (𝐴 × 𝐵))
2	1	anim1i 627	. . . . . . . 8 ⊢ ((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅})) → (𝐹 Fn (𝐴 × 𝐵) ∧ 𝐵 ∈ (𝑉 ∖ {∅})))
3	2	3adant3 1150	. . . . . . 7 ⊢ ((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) → (𝐹 Fn (𝐴 × 𝐵) ∧ 𝐵 ∈ (𝑉 ∖ {∅})))
4		3anass 1111	. . . . . . . . . . 11 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ↔ (𝐹 Fn (𝐴 × 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
5		curfv 8923	. . . . . . . . . . 11 ⊢ (((𝐹 Fn (𝐴 × 𝐵) ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝐵 ∈ (𝑉 ∖ {∅})) → ((curry 𝐹‘𝑥)‘𝑦) = (𝑥𝐹𝑦))
6	4, 5	sylanbr 594	. . . . . . . . . 10 ⊢ (((𝐹 Fn (𝐴 × 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ 𝐵 ∈ (𝑉 ∖ {∅})) → ((curry 𝐹‘𝑥)‘𝑦) = (𝑥𝐹𝑦))
7	6	an32s 665	. . . . . . . . 9 ⊢ (((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐵 ∈ (𝑉 ∖ {∅})) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → ((curry 𝐹‘𝑥)‘𝑦) = (𝑥𝐹𝑦))
8	7	eqeq1d 2765	. . . . . . . 8 ⊢ (((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐵 ∈ (𝑉 ∖ {∅})) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (((curry 𝐹‘𝑥)‘𝑦) = 𝑧 ↔ (𝑥𝐹𝑦) = 𝑧))
9		eqcom 2770	. . . . . . . 8 ⊢ ((𝑥𝐹𝑦) = 𝑧 ↔ 𝑧 = (𝑥𝐹𝑦))
10	8, 9	bitrdi 290	. . . . . . 7 ⊢ (((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐵 ∈ (𝑉 ∖ {∅})) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (((curry 𝐹‘𝑥)‘𝑦) = 𝑧 ↔ 𝑧 = (𝑥𝐹𝑦)))
11	3, 10	sylan 592	. . . . . 6 ⊢ (((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (((curry 𝐹‘𝑥)‘𝑦) = 𝑧 ↔ 𝑧 = (𝑥𝐹𝑦)))
12		curf 8921	. . . . . . . . . 10 ⊢ ((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) → curry 𝐹:𝐴⟶(𝐶 ↑m 𝐵))
13	12	ffvelcdmda 7111	. . . . . . . . 9 ⊢ (((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) ∧ 𝑥 ∈ 𝐴) → (curry 𝐹‘𝑥) ∈ (𝐶 ↑m 𝐵))
14		elmapfn 8918	. . . . . . . . 9 ⊢ ((curry 𝐹‘𝑥) ∈ (𝐶 ↑m 𝐵) → (curry 𝐹‘𝑥) Fn 𝐵)
15	13, 14	syl 18	. . . . . . . 8 ⊢ (((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) ∧ 𝑥 ∈ 𝐴) → (curry 𝐹‘𝑥) Fn 𝐵)
16		fnbrfvb 6961	. . . . . . . 8 ⊢ (((curry 𝐹‘𝑥) Fn 𝐵 ∧ 𝑦 ∈ 𝐵) → (((curry 𝐹‘𝑥)‘𝑦) = 𝑧 ↔ 𝑦(curry 𝐹‘𝑥)𝑧))
17	15, 16	sylan 592	. . . . . . 7 ⊢ ((((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) → (((curry 𝐹‘𝑥)‘𝑦) = 𝑧 ↔ 𝑦(curry 𝐹‘𝑥)𝑧))
18	17	anasss 472	. . . . . 6 ⊢ (((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (((curry 𝐹‘𝑥)‘𝑦) = 𝑧 ↔ 𝑦(curry 𝐹‘𝑥)𝑧))
19		ibar 538	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑧 = (𝑥𝐹𝑦) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = (𝑥𝐹𝑦))))
20	19	adantl 487	. . . . . 6 ⊢ (((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝑧 = (𝑥𝐹𝑦) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = (𝑥𝐹𝑦))))
21	11, 18, 20	3bitr3d 312	. . . . 5 ⊢ (((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝑦(curry 𝐹‘𝑥)𝑧 ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = (𝑥𝐹𝑦))))
22		df-br 5107	. . . . . . . . . . 11 ⊢ (𝑦(curry 𝐹‘𝑥)𝑧 ↔ ⟨𝑦, 𝑧⟩ ∈ (curry 𝐹‘𝑥))
23		elfvdm 6945	. . . . . . . . . . 11 ⊢ (⟨𝑦, 𝑧⟩ ∈ (curry 𝐹‘𝑥) → 𝑥 ∈ dom curry 𝐹)
24	22, 23	sylbi 220	. . . . . . . . . 10 ⊢ (𝑦(curry 𝐹‘𝑥)𝑧 → 𝑥 ∈ dom curry 𝐹)
25		fdm 6744	. . . . . . . . . . . 12 ⊢ (curry 𝐹:𝐴⟶(𝐶 ↑m 𝐵) → dom curry 𝐹 = 𝐴)
26	25	eleq2d 2850	. . . . . . . . . . 11 ⊢ (curry 𝐹:𝐴⟶(𝐶 ↑m 𝐵) → (𝑥 ∈ dom curry 𝐹 ↔ 𝑥 ∈ 𝐴))
27	26	biimpa 482	. . . . . . . . . 10 ⊢ ((curry 𝐹:𝐴⟶(𝐶 ↑m 𝐵) ∧ 𝑥 ∈ dom curry 𝐹) → 𝑥 ∈ 𝐴)
28	24, 27	sylan2 605	. . . . . . . . 9 ⊢ ((curry 𝐹:𝐴⟶(𝐶 ↑m 𝐵) ∧ 𝑦(curry 𝐹‘𝑥)𝑧) → 𝑥 ∈ 𝐴)
29		ffvelcdm 7108	. . . . . . . . . . . . 13 ⊢ ((curry 𝐹:𝐴⟶(𝐶 ↑m 𝐵) ∧ 𝑥 ∈ 𝐴) → (curry 𝐹‘𝑥) ∈ (𝐶 ↑m 𝐵))
30		elmapi 8900	. . . . . . . . . . . . 13 ⊢ ((curry 𝐹‘𝑥) ∈ (𝐶 ↑m 𝐵) → (curry 𝐹‘𝑥):𝐵⟶𝐶)
31		fdm 6744	. . . . . . . . . . . . 13 ⊢ ((curry 𝐹‘𝑥):𝐵⟶𝐶 → dom (curry 𝐹‘𝑥) = 𝐵)
32	29, 30, 31	3syl 19	. . . . . . . . . . . 12 ⊢ ((curry 𝐹:𝐴⟶(𝐶 ↑m 𝐵) ∧ 𝑥 ∈ 𝐴) → dom (curry 𝐹‘𝑥) = 𝐵)
33		vex 3458	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ V
34		vex 3458	. . . . . . . . . . . . 13 ⊢ 𝑧 ∈ V
35	33, 34	breldm 5898	. . . . . . . . . . . 12 ⊢ (𝑦(curry 𝐹‘𝑥)𝑧 → 𝑦 ∈ dom (curry 𝐹‘𝑥))
36		eleq2 2853	. . . . . . . . . . . . 13 ⊢ (dom (curry 𝐹‘𝑥) = 𝐵 → (𝑦 ∈ dom (curry 𝐹‘𝑥) ↔ 𝑦 ∈ 𝐵))
37	36	biimpa 482	. . . . . . . . . . . 12 ⊢ ((dom (curry 𝐹‘𝑥) = 𝐵 ∧ 𝑦 ∈ dom (curry 𝐹‘𝑥)) → 𝑦 ∈ 𝐵)
38	32, 35, 37	syl2an 608	. . . . . . . . . . 11 ⊢ (((curry 𝐹:𝐴⟶(𝐶 ↑m 𝐵) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦(curry 𝐹‘𝑥)𝑧) → 𝑦 ∈ 𝐵)
39	38	an32s 665	. . . . . . . . . 10 ⊢ (((curry 𝐹:𝐴⟶(𝐶 ↑m 𝐵) ∧ 𝑦(curry 𝐹‘𝑥)𝑧) ∧ 𝑥 ∈ 𝐴) → 𝑦 ∈ 𝐵)
40	28, 39	mpdan 700	. . . . . . . . 9 ⊢ ((curry 𝐹:𝐴⟶(𝐶 ↑m 𝐵) ∧ 𝑦(curry 𝐹‘𝑥)𝑧) → 𝑦 ∈ 𝐵)
41	28, 40	jca 521	. . . . . . . 8 ⊢ ((curry 𝐹:𝐴⟶(𝐶 ↑m 𝐵) ∧ 𝑦(curry 𝐹‘𝑥)𝑧) → (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
42	12, 41	sylan 592	. . . . . . 7 ⊢ (((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) ∧ 𝑦(curry 𝐹‘𝑥)𝑧) → (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
43	42	stoic1a 1805	. . . . . 6 ⊢ (((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) ∧ ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → ¬ 𝑦(curry 𝐹‘𝑥)𝑧)
44		simpl 488	. . . . . . . 8 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = (𝑥𝐹𝑦)) → (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
45	44	con3i 155	. . . . . . 7 ⊢ (¬ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ¬ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = (𝑥𝐹𝑦)))
46	45	adantl 487	. . . . . 6 ⊢ (((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) ∧ ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → ¬ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = (𝑥𝐹𝑦)))
47	43, 46	2falsed 379	. . . . 5 ⊢ (((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) ∧ ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝑦(curry 𝐹‘𝑥)𝑧 ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = (𝑥𝐹𝑦))))
48	21, 47	pm2.61dan 825	. . . 4 ⊢ ((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) → (𝑦(curry 𝐹‘𝑥)𝑧 ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = (𝑥𝐹𝑦))))
49	48	oprabbidv 7512	. . 3 ⊢ ((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑦(curry 𝐹‘𝑥)𝑧} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = (𝑥𝐹𝑦))})
50		df-unc 8316	. . 3 ⊢ uncurry curry 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑦(curry 𝐹‘𝑥)𝑧}
51		df-mpo 7451	. . 3 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ (𝑥𝐹𝑦)) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = (𝑥𝐹𝑦))}
52	49, 50, 51	3eqtr4g 2823	. 2 ⊢ ((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) → uncurry curry 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ (𝑥𝐹𝑦)))
53		fnov 7577	. . . 4 ⊢ (𝐹 Fn (𝐴 × 𝐵) ↔ 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ (𝑥𝐹𝑦)))
54	1, 53	sylib 221	. . 3 ⊢ (𝐹:(𝐴 × 𝐵)⟶𝐶 → 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ (𝑥𝐹𝑦)))
55	54	3ad2ant1 1151	. 2 ⊢ ((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) → 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ (𝑥𝐹𝑦)))
56	52, 55	eqtr4d 2801	1 ⊢ ((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) → uncurry curry 𝐹 = 𝐹)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ∖ cdif 4048  ∅c0 4281  {csn 4588  ⟨cop 4838   class class class wbr 5106   × cxp 5654  dom cdm 5656   Fn wfn 6556  ⟶wf 6557  ‘cfv 6561  (class class class)co 7446  {coprab 7447   ∈ cmpo 7448  curry ccur 8313  uncurry cunc 8314   ↑_m cmap 8878

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-1st 8028  df-2nd 8029  df-cur 8315  df-unc 8316  df-map 8880

This theorem is used by: (None)