| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ixpssmap | Structured version Visualization version GIF version | ||
| Description: An infinite Cartesian product is a subset of set exponentiation. Remark in [Enderton] p. 54. (Contributed by NM, 28-Sep-2006.) |
| Ref | Expression |
|---|---|
| ixpssmap.2 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| ixpssmap | ⊢ X𝑥 ∈ 𝐴 𝐵 ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ixpssmap.2 | . . 3 ⊢ 𝐵 ∈ V | |
| 2 | 1 | rgenw 3052 | . 2 ⊢ ∀𝑥 ∈ 𝐴 𝐵 ∈ V |
| 3 | ixpssmapg 8862 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V → X𝑥 ∈ 𝐴 𝐵 ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐴)) | |
| 4 | 2, 3 | ax-mp 5 | 1 ⊢ X𝑥 ∈ 𝐴 𝐵 ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ∈ wcel 2113 ∀wral 3048 Vcvv 3437 ⊆ wss 3898 ∪ ciun 4943 (class class class)co 7355 ↑m cmap 8759 Xcixp 8831 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-ral 3049 df-rex 3058 df-rab 3397 df-v 3439 df-sbc 3738 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-iun 4945 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5516 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-fv 6497 df-ov 7358 df-oprab 7359 df-mpo 7360 df-map 8761 df-ixp 8832 |
| This theorem is referenced by: hspmbl 46789 |
| Copyright terms: Public domain | W3C validator |