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 7312 (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 7937 | . 2 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑤 ∈ (𝐴 × 𝐵) ↦ ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶) | |
2 | dfmpo.1 | . . . . 5 ⊢ 𝐶 ∈ V | |
3 | 2 | csbex 5244 | . . . 4 ⊢ ⦋(2nd ‘𝑤) / 𝑦⦌𝐶 ∈ V |
4 | 3 | csbex 5244 | . . 3 ⊢ ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶 ∈ V |
5 | 4 | dfmpt 7048 | . 2 ⊢ (𝑤 ∈ (𝐴 × 𝐵) ↦ ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶) = ∪ 𝑤 ∈ (𝐴 × 𝐵){〈𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶〉} |
6 | nfcv 2905 | . . . . 5 ⊢ Ⅎ𝑥𝑤 | |
7 | nfcsb1v 3862 | . . . . 5 ⊢ Ⅎ𝑥⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶 | |
8 | 6, 7 | nfop 4825 | . . . 4 ⊢ Ⅎ𝑥〈𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶〉 |
9 | 8 | nfsn 4647 | . . 3 ⊢ Ⅎ𝑥{〈𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶〉} |
10 | nfcv 2905 | . . . . 5 ⊢ Ⅎ𝑦𝑤 | |
11 | nfcv 2905 | . . . . . 6 ⊢ Ⅎ𝑦(1st ‘𝑤) | |
12 | nfcsb1v 3862 | . . . . . 6 ⊢ Ⅎ𝑦⦋(2nd ‘𝑤) / 𝑦⦌𝐶 | |
13 | 11, 12 | nfcsbw 3864 | . . . . 5 ⊢ Ⅎ𝑦⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶 |
14 | 10, 13 | nfop 4825 | . . . 4 ⊢ Ⅎ𝑦〈𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶〉 |
15 | 14 | nfsn 4647 | . . 3 ⊢ Ⅎ𝑦{〈𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶〉} |
16 | nfcv 2905 | . . 3 ⊢ Ⅎ𝑤{〈〈𝑥, 𝑦〉, 𝐶〉} | |
17 | id 22 | . . . . 5 ⊢ (𝑤 = 〈𝑥, 𝑦〉 → 𝑤 = 〈𝑥, 𝑦〉) | |
18 | csbopeq1a 7923 | . . . . 5 ⊢ (𝑤 = 〈𝑥, 𝑦〉 → ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶 = 𝐶) | |
19 | 17, 18 | opeq12d 4817 | . . . 4 ⊢ (𝑤 = 〈𝑥, 𝑦〉 → 〈𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶〉 = 〈〈𝑥, 𝑦〉, 𝐶〉) |
20 | 19 | sneqd 4577 | . . 3 ⊢ (𝑤 = 〈𝑥, 𝑦〉 → {〈𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶〉} = {〈〈𝑥, 𝑦〉, 𝐶〉}) |
21 | 9, 15, 16, 20 | iunxpf 5770 | . 2 ⊢ ∪ 𝑤 ∈ (𝐴 × 𝐵){〈𝑤, ⦋(1st ‘𝑤) / 𝑥⦌⦋(2nd ‘𝑤) / 𝑦⦌𝐶〉} = ∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 {〈〈𝑥, 𝑦〉, 𝐶〉} |
22 | 1, 5, 21 | 3eqtri 2768 | 1 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = ∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 {〈〈𝑥, 𝑦〉, 𝐶〉} |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1539 ∈ wcel 2104 Vcvv 3437 ⦋csb 3837 {csn 4565 〈cop 4571 ∪ ciun 4931 ↦ cmpt 5164 × cxp 5598 ‘cfv 6458 ∈ cmpo 7309 1st c1st 7861 2nd c2nd 7862 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2707 ax-sep 5232 ax-nul 5239 ax-pr 5361 ax-un 7620 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2887 df-ne 2942 df-ral 3063 df-rex 3072 df-reu 3305 df-rab 3306 df-v 3439 df-sbc 3722 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-sn 4566 df-pr 4568 df-op 4572 df-uni 4845 df-iun 4933 df-br 5082 df-opab 5144 df-mpt 5165 df-id 5500 df-xp 5606 df-rel 5607 df-cnv 5608 df-co 5609 df-dm 5610 df-rn 5611 df-iota 6410 df-fun 6460 df-fn 6461 df-f 6462 df-f1 6463 df-fo 6464 df-f1o 6465 df-fv 6466 df-oprab 7311 df-mpo 7312 df-1st 7863 df-2nd 7864 |
This theorem is referenced by: fpar 7988 |
Copyright terms: Public domain | W3C validator |