Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > pw2en | Structured version Visualization version GIF version |
Description: The power set of a set is equinumerous to set exponentiation with a base of ordinal 2. Proposition 10.44 of [TakeutiZaring] p. 96. This is Metamath 100 proof #52. (Contributed by NM, 29-Jan-2004.) (Proof shortened by Mario Carneiro, 1-Jul-2015.) |
Ref | Expression |
---|---|
pw2en.1 | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
pw2en | ⊢ 𝒫 𝐴 ≈ (2o ↑m 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pw2en.1 | . 2 ⊢ 𝐴 ∈ V | |
2 | pw2eng 8622 | . 2 ⊢ (𝐴 ∈ V → 𝒫 𝐴 ≈ (2o ↑m 𝐴)) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ 𝒫 𝐴 ≈ (2o ↑m 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ∈ wcel 2110 Vcvv 3494 𝒫 cpw 4538 class class class wbr 5065 (class class class)co 7155 2oc2o 8095 ↑m cmap 8405 ≈ cen 8505 |
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 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3772 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-op 4573 df-uni 4838 df-br 5066 df-opab 5128 df-mpt 5146 df-id 5459 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-suc 6196 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-ov 7158 df-oprab 7159 df-mpo 7160 df-1o 8101 df-2o 8102 df-map 8407 df-en 8509 |
This theorem is referenced by: aleph1 9992 alephexp1 10000 pwcfsdom 10004 cfpwsdom 10005 hashpw 13796 rpnnen 15579 rexpen 15580 |
Copyright terms: Public domain | W3C validator |