![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > dfmpt | Structured version Visualization version GIF version |
Description: Alternate definition for the maps-to notation df-mpt 5232 (although it requires that 𝐵 be a set). (Contributed by NM, 24-Aug-2010.) (Revised by Mario Carneiro, 30-Dec-2016.) |
Ref | Expression |
---|---|
dfmpt.1 | ⊢ 𝐵 ∈ V |
Ref | Expression |
---|---|
dfmpt | ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = ∪ 𝑥 ∈ 𝐴 {〈𝑥, 𝐵〉} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfmpt3 6703 | . 2 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = ∪ 𝑥 ∈ 𝐴 ({𝑥} × {𝐵}) | |
2 | vex 3482 | . . . . 5 ⊢ 𝑥 ∈ V | |
3 | dfmpt.1 | . . . . 5 ⊢ 𝐵 ∈ V | |
4 | 2, 3 | xpsn 7161 | . . . 4 ⊢ ({𝑥} × {𝐵}) = {〈𝑥, 𝐵〉} |
5 | 4 | a1i 11 | . . 3 ⊢ (𝑥 ∈ 𝐴 → ({𝑥} × {𝐵}) = {〈𝑥, 𝐵〉}) |
6 | 5 | iuneq2i 5018 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 ({𝑥} × {𝐵}) = ∪ 𝑥 ∈ 𝐴 {〈𝑥, 𝐵〉} |
7 | 1, 6 | eqtri 2763 | 1 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = ∪ 𝑥 ∈ 𝐴 {〈𝑥, 𝐵〉} |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1537 ∈ wcel 2106 Vcvv 3478 {csn 4631 〈cop 4637 ∪ ciun 4996 ↦ cmpt 5231 × cxp 5687 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pr 5438 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-ss 3980 df-nul 4340 df-if 4532 df-sn 4632 df-pr 4634 df-op 4638 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5583 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 |
This theorem is referenced by: fnasrn 7165 funiun 7167 dfmpo 8126 |
Copyright terms: Public domain | W3C validator |