| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mapsn | Structured version Visualization version GIF version | ||
| Description: The value of set exponentiation with a singleton exponent. Theorem 98 of [Suppes] p. 89. (Contributed by NM, 10-Dec-2003.) (Proof shortened by AV, 17-Jul-2022.) |
| Ref | Expression |
|---|---|
| map0.1 | ⊢ 𝐴 ∈ V |
| map0.2 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| mapsn | ⊢ (𝐴 ↑m {𝐵}) = {𝑓 ∣ ∃𝑦 ∈ 𝐴 𝑓 = {〈𝐵, 𝑦〉}} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | map0.1 | . 2 ⊢ 𝐴 ∈ V | |
| 2 | id 22 | . . 3 ⊢ (𝐴 ∈ V → 𝐴 ∈ V) | |
| 3 | map0.2 | . . . 4 ⊢ 𝐵 ∈ V | |
| 4 | 3 | a1i 11 | . . 3 ⊢ (𝐴 ∈ V → 𝐵 ∈ V) |
| 5 | 2, 4 | mapsnd 8828 | . 2 ⊢ (𝐴 ∈ V → (𝐴 ↑m {𝐵}) = {𝑓 ∣ ∃𝑦 ∈ 𝐴 𝑓 = {〈𝐵, 𝑦〉}}) |
| 6 | 1, 5 | ax-mp 5 | 1 ⊢ (𝐴 ↑m {𝐵}) = {𝑓 ∣ ∃𝑦 ∈ 𝐴 𝑓 = {〈𝐵, 𝑦〉}} |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∈ wcel 2114 {cab 2715 ∃wrex 3061 Vcvv 3441 {csn 4581 〈cop 4587 (class class class)co 7360 ↑m cmap 8767 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ral 3053 df-rex 3062 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-br 5100 df-opab 5162 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-ov 7363 df-oprab 7364 df-mpo 7365 df-map 8769 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |