Theorem unccur 38295

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 6712	. . . . . . . . 9 ⊢ (𝐹:(𝐴 × 𝐵)⟶𝐶 → 𝐹 Fn (𝐴 × 𝐵))
2	1	anim1i 627	. . . . . . . 8 ⊢ ((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅})) → (𝐹 Fn (𝐴 × 𝐵) ∧ 𝐵 ∈ (𝑉 ∖ {∅})))
3	2	3adant3 1150	. . . . . . 7 ⊢ ((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) → (𝐹 Fn (𝐴 × 𝐵) ∧ 𝐵 ∈ (𝑉 ∖ {∅})))
4		3anass 1111	. . . . . . . . . . 11 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ↔ (𝐹 Fn (𝐴 × 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
5		curfv 38292	. . . . . . . . . . 11 ⊢ (((𝐹 Fn (𝐴 × 𝐵) ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝐵 ∈ (𝑉 ∖ {∅})) → ((curry 𝐹‘𝑥)‘𝑦) = (𝑥𝐹𝑦))
6	4, 5	sylanbr 594	. . . . . . . . . 10 ⊢ (((𝐹 Fn (𝐴 × 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ 𝐵 ∈ (𝑉 ∖ {∅})) → ((curry 𝐹‘𝑥)‘𝑦) = (𝑥𝐹𝑦))
7	6	an32s 665	. . . . . . . . 9 ⊢ (((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐵 ∈ (𝑉 ∖ {∅})) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → ((curry 𝐹‘𝑥)‘𝑦) = (𝑥𝐹𝑦))
8	7	eqeq1d 2768	. . . . . . . 8 ⊢ (((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐵 ∈ (𝑉 ∖ {∅})) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (((curry 𝐹‘𝑥)‘𝑦) = 𝑧 ↔ (𝑥𝐹𝑦) = 𝑧))
9		eqcom 2773	. . . . . . . 8 ⊢ ((𝑥𝐹𝑦) = 𝑧 ↔ 𝑧 = (𝑥𝐹𝑦))
10	8, 9	bitrdi 290	. . . . . . 7 ⊢ (((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐵 ∈ (𝑉 ∖ {∅})) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (((curry 𝐹‘𝑥)‘𝑦) = 𝑧 ↔ 𝑧 = (𝑥𝐹𝑦)))
11	3, 10	sylan 592	. . . . . 6 ⊢ (((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (((curry 𝐹‘𝑥)‘𝑦) = 𝑧 ↔ 𝑧 = (𝑥𝐹𝑦)))
12		curf 38290	. . . . . . . . . 10 ⊢ ((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) → curry 𝐹:𝐴⟶(𝐶 ↑m 𝐵))
13	12	ffvelcdmda 7086	. . . . . . . . 9 ⊢ (((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) ∧ 𝑥 ∈ 𝐴) → (curry 𝐹‘𝑥) ∈ (𝐶 ↑m 𝐵))
14		elmapfn 8871	. . . . . . . . 9 ⊢ ((curry 𝐹‘𝑥) ∈ (𝐶 ↑m 𝐵) → (curry 𝐹‘𝑥) Fn 𝐵)
15	13, 14	syl 18	. . . . . . . 8 ⊢ (((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) ∧ 𝑥 ∈ 𝐴) → (curry 𝐹‘𝑥) Fn 𝐵)
16		fnbrfvb 6938	. . . . . . . 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 5115	. . . . . . . . . . 11 ⊢ (𝑦(curry 𝐹‘𝑥)𝑧 ↔ ⟨𝑦, 𝑧⟩ ∈ (curry 𝐹‘𝑥))
23		elfvdm 6922	. . . . . . . . . . 11 ⊢ (⟨𝑦, 𝑧⟩ ∈ (curry 𝐹‘𝑥) → 𝑥 ∈ dom curry 𝐹)
24	22, 23	sylbi 220	. . . . . . . . . 10 ⊢ (𝑦(curry 𝐹‘𝑥)𝑧 → 𝑥 ∈ dom curry 𝐹)
25		fdm 6722	. . . . . . . . . . . 12 ⊢ (curry 𝐹:𝐴⟶(𝐶 ↑m 𝐵) → dom curry 𝐹 = 𝐴)
26	25	eleq2d 2852	. . . . . . . . . . 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 7083	. . . . . . . . . . . . 13 ⊢ ((curry 𝐹:𝐴⟶(𝐶 ↑m 𝐵) ∧ 𝑥 ∈ 𝐴) → (curry 𝐹‘𝑥) ∈ (𝐶 ↑m 𝐵))
30		elmapi 8855	. . . . . . . . . . . . 13 ⊢ ((curry 𝐹‘𝑥) ∈ (𝐶 ↑m 𝐵) → (curry 𝐹‘𝑥):𝐵⟶𝐶)
31		fdm 6722	. . . . . . . . . . . . 13 ⊢ ((curry 𝐹‘𝑥):𝐵⟶𝐶 → dom (curry 𝐹‘𝑥) = 𝐵)
32	29, 30, 31	3syl 19	. . . . . . . . . . . 12 ⊢ ((curry 𝐹:𝐴⟶(𝐶 ↑m 𝐵) ∧ 𝑥 ∈ 𝐴) → dom (curry 𝐹‘𝑥) = 𝐵)
33		vex 3462	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ V
34		vex 3462	. . . . . . . . . . . . 13 ⊢ 𝑧 ∈ V
35	33, 34	breldm 5903	. . . . . . . . . . . 12 ⊢ (𝑦(curry 𝐹‘𝑥)𝑧 → 𝑦 ∈ dom (curry 𝐹‘𝑥))
36		eleq2 2855	. . . . . . . . . . . . 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 7489	. . 3 ⊢ ((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑦(curry 𝐹‘𝑥)𝑧} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = (𝑥𝐹𝑦))})
50		df-unc 8273	. . 3 ⊢ uncurry curry 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑦(curry 𝐹‘𝑥)𝑧}
51		df-mpo 7428	. . 3 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ (𝑥𝐹𝑦)) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = (𝑥𝐹𝑦))}
52	49, 50, 51	3eqtr4g 2826	. 2 ⊢ ((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) → uncurry curry 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ (𝑥𝐹𝑦)))
53		fnov 7554	. . . 4 ⊢ (𝐹 Fn (𝐴 × 𝐵) ↔ 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ (𝑥𝐹𝑦)))
54	1, 53	sylib 221	. . 3 ⊢ (𝐹:(𝐴 × 𝐵)⟶𝐶 → 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ (𝑥𝐹𝑦)))
55	54	3ad2ant1 1151	. 2 ⊢ ((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) → 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ (𝑥𝐹𝑦)))
56	52, 55	eqtr4d 2804	1 ⊢ ((𝐹:(𝐴 × 𝐵)⟶𝐶 ∧ 𝐵 ∈ (𝑉 ∖ {∅}) ∧ 𝐶 ∈ 𝑊) → uncurry curry 𝐹 = 𝐹)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146   ∖ cdif 3905  ∅c0 4289  {csn 4594  ⟨cop 4600   class class class wbr 5114   × cxp 5664  dom cdm 5666   Fn wfn 6538  ⟶wf 6539  ‘cfv 6543  (class class class)co 7423  {coprab 7424   ∈ cmpo 7425  curry ccur 8270  uncurry cunc 8271   ↑_m cmap 8833

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-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  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-reu 3373  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-pw 4569  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-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-1st 7995  df-2nd 7996  df-cur 8272  df-unc 8273  df-map 8835

This theorem is used by: (None)