Theorem dfmpo 6463

Description: Alternate definition for the maps-to notation df-mpo 6093 (although it requires that 𝐶 be a set). (Contributed by NM, 19-Dec-2008.) (Revised by Mario Carneiro, 31-Aug-2015.)

Hypothesis

Ref	Expression
dfmpo.1	⊢ 𝐶 ∈ V

Assertion

Ref	Expression
dfmpo	⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = ∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 {⟨⟨𝑥, 𝑦⟩, 𝐶⟩}

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦

Allowed substitution hints:   𝐶(𝑥, 𝑦)

Proof of Theorem dfmpo

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		mpompts 6438	. 2 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑤 ∈ (𝐴 × 𝐵) ↦ ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶)
2		vex 2824	. . . . 5 ⊢ 𝑤 ∈ V
3		1stexg 6405	. . . . 5 ⊢ (𝑤 ∈ V → (1st ‘𝑤) ∈ V)
4	2, 3	ax-mp 5	. . . 4 ⊢ (1st ‘𝑤) ∈ V
5		2ndexg 6406	. . . . . 6 ⊢ (𝑤 ∈ V → (2nd ‘𝑤) ∈ V)
6	2, 5	ax-mp 5	. . . . 5 ⊢ (2nd ‘𝑤) ∈ V
7		dfmpo.1	. . . . 5 ⊢ 𝐶 ∈ V
8	6, 7	csbexa 4264	. . . 4 ⊢ ⦋(2nd ‘𝑤) / 𝑦⦌𝐶 ∈ V
9	4, 8	csbexa 4264	. . 3 ⊢ ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶 ∈ V
10	9	dfmpt 5889	. 2 ⊢ (𝑤 ∈ (𝐴 × 𝐵) ↦ ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶) = ∪ 𝑤 ∈ (𝐴 × 𝐵){⟨𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶⟩}
11		nfcv 2392	. . . . 5 ⊢ Ⅎ𝑥𝑤
12		nfcsb1v 3180	. . . . 5 ⊢ Ⅎ𝑥⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶
13	11, 12	nfop 3920	. . . 4 ⊢ Ⅎ𝑥⟨𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶⟩
14	13	nfsn 3769	. . 3 ⊢ Ⅎ𝑥{⟨𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶⟩}
15		nfcv 2392	. . . . 5 ⊢ Ⅎ𝑦𝑤
16		nfcv 2392	. . . . . 6 ⊢ Ⅎ𝑦(1st ‘𝑤)
17		nfcsb1v 3180	. . . . . 6 ⊢ Ⅎ𝑦⦋(2nd ‘𝑤) / 𝑦⦌𝐶
18	16, 17	nfcsb 3185	. . . . 5 ⊢ Ⅎ𝑦⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶
19	15, 18	nfop 3920	. . . 4 ⊢ Ⅎ𝑦⟨𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶⟩
20	19	nfsn 3769	. . 3 ⊢ Ⅎ𝑦{⟨𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶⟩}
21		nfcv 2392	. . 3 ⊢ Ⅎ𝑤{⟨⟨𝑥, 𝑦⟩, 𝐶⟩}
22		id 19	. . . . 5 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → 𝑤 = ⟨𝑥, 𝑦⟩)
23		csbopeq1a 6426	. . . . 5 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶 = 𝐶)
24	22, 23	opeq12d 3912	. . . 4 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → ⟨𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶⟩ = ⟨⟨𝑥, 𝑦⟩, 𝐶⟩)
25	24	sneqd 3722	. . 3 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → {⟨𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶⟩} = {⟨⟨𝑥, 𝑦⟩, 𝐶⟩})
26	14, 20, 21, 25	iunxpf 4930	. 2 ⊢ ∪ 𝑤 ∈ (𝐴 × 𝐵){⟨𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶⟩} = ∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 {⟨⟨𝑥, 𝑦⟩, 𝐶⟩}
27	1, 10, 26	3eqtri 2263	1 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = ∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 {⟨⟨𝑥, 𝑦⟩, 𝐶⟩}

This proof depends on syntax axioms:   = wceq 1402   ∈ wcel 2209  Vcvv 2821  ⦋csb 3147  {csn 3709  ⟨cop 3712  ∪ ciun 4012   ↦ cmpt 4193   × cxp 4774  ‘cfv 5380   ∈ cmpo 6090  1^st c1st 6376  2^nd c2nd 6377

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379

This theorem is used by: (None)