| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dfmpt | GIF version | ||
| Description: Alternate definition for the maps-to notation df-mpt 4157 (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 5462 | . 2 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = ∪ 𝑥 ∈ 𝐴 ({𝑥} × {𝐵}) | |
| 2 | vex 2806 | . . . . 5 ⊢ 𝑥 ∈ V | |
| 3 | dfmpt.1 | . . . . 5 ⊢ 𝐵 ∈ V | |
| 4 | 2, 3 | xpsn 5832 | . . . 4 ⊢ ({𝑥} × {𝐵}) = {〈𝑥, 𝐵〉} |
| 5 | 4 | a1i 9 | . . 3 ⊢ (𝑥 ∈ 𝐴 → ({𝑥} × {𝐵}) = {〈𝑥, 𝐵〉}) |
| 6 | 5 | iuneq2i 3993 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 ({𝑥} × {𝐵}) = ∪ 𝑥 ∈ 𝐴 {〈𝑥, 𝐵〉} |
| 7 | 1, 6 | eqtri 2252 | 1 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = ∪ 𝑥 ∈ 𝐴 {〈𝑥, 𝐵〉} |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1398 ∈ wcel 2202 Vcvv 2803 {csn 3673 〈cop 3676 ∪ ciun 3975 ↦ cmpt 4155 × cxp 4729 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ral 2516 df-rex 2517 df-reu 2518 df-v 2805 df-sbc 3033 df-csb 3129 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 |
| This theorem is referenced by: fnasrn 5834 dfmpo 6397 |
| Copyright terms: Public domain | W3C validator |