Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dfmpo | Structured version Visualization version GIF version |
Description: Alternate definition for the maps-to notation df-mpo 7273 (although it requires that 𝐶 be a set). (Contributed by NM, 19-Dec-2008.) (Revised by Mario Carneiro, 31-Aug-2015.) |
Ref | Expression |
---|---|
dfmpo.1 | ⊢ 𝐶 ∈ V |
Ref | Expression |
---|---|
dfmpo | ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = ∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 {〈〈𝑥, 𝑦〉, 𝐶〉} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mpompts 7891 | . 2 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑤 ∈ (𝐴 × 𝐵) ↦ ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶) | |
2 | dfmpo.1 | . . . . 5 ⊢ 𝐶 ∈ V | |
3 | 2 | csbex 5238 | . . . 4 ⊢ ⦋(2nd ‘𝑤) / 𝑦⦌𝐶 ∈ V |
4 | 3 | csbex 5238 | . . 3 ⊢ ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶 ∈ V |
5 | 4 | dfmpt 7010 | . 2 ⊢ (𝑤 ∈ (𝐴 × 𝐵) ↦ ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶) = ∪ 𝑤 ∈ (𝐴 × 𝐵){〈𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶〉} |
6 | nfcv 2908 | . . . . 5 ⊢ Ⅎ𝑥𝑤 | |
7 | nfcsb1v 3861 | . . . . 5 ⊢ Ⅎ𝑥⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶 | |
8 | 6, 7 | nfop 4825 | . . . 4 ⊢ Ⅎ𝑥〈𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶〉 |
9 | 8 | nfsn 4648 | . . 3 ⊢ Ⅎ𝑥{〈𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶〉} |
10 | nfcv 2908 | . . . . 5 ⊢ Ⅎ𝑦𝑤 | |
11 | nfcv 2908 | . . . . . 6 ⊢ Ⅎ𝑦(1st ‘𝑤) | |
12 | nfcsb1v 3861 | . . . . . 6 ⊢ Ⅎ𝑦⦋(2nd ‘𝑤) / 𝑦⦌𝐶 | |
13 | 11, 12 | nfcsbw 3863 | . . . . 5 ⊢ Ⅎ𝑦⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶 |
14 | 10, 13 | nfop 4825 | . . . 4 ⊢ Ⅎ𝑦〈𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶〉 |
15 | 14 | nfsn 4648 | . . 3 ⊢ Ⅎ𝑦{〈𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶〉} |
16 | nfcv 2908 | . . 3 ⊢ Ⅎ𝑤{〈〈𝑥, 𝑦〉, 𝐶〉} | |
17 | id 22 | . . . . 5 ⊢ (𝑤 = 〈𝑥, 𝑦〉 → 𝑤 = 〈𝑥, 𝑦〉) | |
18 | csbopeq1a 7877 | . . . . 5 ⊢ (𝑤 = 〈𝑥, 𝑦〉 → ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶 = 𝐶) | |
19 | 17, 18 | opeq12d 4817 | . . . 4 ⊢ (𝑤 = 〈𝑥, 𝑦〉 → 〈𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶〉 = 〈〈𝑥, 𝑦〉, 𝐶〉) |
20 | 19 | sneqd 4578 | . . 3 ⊢ (𝑤 = 〈𝑥, 𝑦〉 → {〈𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶〉} = {〈〈𝑥, 𝑦〉, 𝐶〉}) |
21 | 9, 15, 16, 20 | iunxpf 5754 | . 2 ⊢ ∪ 𝑤 ∈ (𝐴 × 𝐵){〈𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶〉} = ∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 {〈〈𝑥, 𝑦〉, 𝐶〉} |
22 | 1, 5, 21 | 3eqtri 2771 | 1 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = ∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 {〈〈𝑥, 𝑦〉, 𝐶〉} |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1541 ∈ wcel 2109 Vcvv 3430 ⦋csb 3836 {csn 4566 〈cop 4572 ∪ ciun 4929 ↦ cmpt 5161 × cxp 5586 ‘cfv 6430 ∈ cmpo 7270 1st c1st 7815 2nd c2nd 7816 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1801 ax-4 1815 ax-5 1916 ax-6 1974 ax-7 2014 ax-8 2111 ax-9 2119 ax-10 2140 ax-11 2157 ax-12 2174 ax-ext 2710 ax-sep 5226 ax-nul 5233 ax-pr 5355 ax-un 7579 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1544 df-fal 1554 df-ex 1786 df-nf 1790 df-sb 2071 df-mo 2541 df-eu 2570 df-clab 2717 df-cleq 2731 df-clel 2817 df-nfc 2890 df-ne 2945 df-ral 3070 df-rex 3071 df-reu 3072 df-rab 3074 df-v 3432 df-sbc 3720 df-csb 3837 df-dif 3894 df-un 3896 df-in 3898 df-ss 3908 df-nul 4262 df-if 4465 df-sn 4567 df-pr 4569 df-op 4573 df-uni 4845 df-iun 4931 df-br 5079 df-opab 5141 df-mpt 5162 df-id 5488 df-xp 5594 df-rel 5595 df-cnv 5596 df-co 5597 df-dm 5598 df-rn 5599 df-iota 6388 df-fun 6432 df-fn 6433 df-f 6434 df-f1 6435 df-fo 6436 df-f1o 6437 df-fv 6438 df-oprab 7272 df-mpo 7273 df-1st 7817 df-2nd 7818 |
This theorem is referenced by: fpar 7940 |
Copyright terms: Public domain | W3C validator |