![]() |
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 5250 (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 6714 | . 2 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = ∪ 𝑥 ∈ 𝐴 ({𝑥} × {𝐵}) | |
2 | vex 3492 | . . . . 5 ⊢ 𝑥 ∈ V | |
3 | dfmpt.1 | . . . . 5 ⊢ 𝐵 ∈ V | |
4 | 2, 3 | xpsn 7175 | . . . 4 ⊢ ({𝑥} × {𝐵}) = {〈𝑥, 𝐵〉} |
5 | 4 | a1i 11 | . . 3 ⊢ (𝑥 ∈ 𝐴 → ({𝑥} × {𝐵}) = {〈𝑥, 𝐵〉}) |
6 | 5 | iuneq2i 5036 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 ({𝑥} × {𝐵}) = ∪ 𝑥 ∈ 𝐴 {〈𝑥, 𝐵〉} |
7 | 1, 6 | eqtri 2768 | 1 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = ∪ 𝑥 ∈ 𝐴 {〈𝑥, 𝐵〉} |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1537 ∈ wcel 2108 Vcvv 3488 {csn 4648 〈cop 4654 ∪ ciun 5015 ↦ cmpt 5249 × cxp 5698 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 |
This theorem is referenced by: fnasrn 7179 funiun 7181 dfmpo 8143 |
Copyright terms: Public domain | W3C validator |