| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > canth2 | Structured version Visualization version GIF version | ||
| Description: Cantor's Theorem. No set is equinumerous to its power set. Specifically, any set has a cardinality (size) strictly less than the cardinality of its power set. For example, the cardinality of real numbers is the same as the cardinality of the power set of integers, so real numbers cannot be put into a one-to-one correspondence with integers. Theorem 23 of [Suppes] p. 97. For the function version, see canth 7377. This is Metamath 100 proof #63. (Contributed by NM, 7-Aug-1994.) |
| Ref | Expression |
|---|---|
| canth2.1 | ⊢ 𝐴 ∈ V |
| Ref | Expression |
|---|---|
| canth2 | ⊢ 𝐴 ≺ 𝒫 𝐴 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | canth2.1 | . . 3 ⊢ 𝐴 ∈ V | |
| 2 | 1 | pwex 5356 | . . 3 ⊢ 𝒫 𝐴 ∈ V |
| 3 | snelpwi 5430 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ∈ 𝒫 𝐴) | |
| 4 | vex 3462 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
| 5 | 4 | sneqr 4810 | . . . . . 6 ⊢ ({𝑥} = {𝑦} → 𝑥 = 𝑦) |
| 6 | sneq 4604 | . . . . . 6 ⊢ (𝑥 = 𝑦 → {𝑥} = {𝑦}) | |
| 7 | 5, 6 | impbii 212 | . . . . 5 ⊢ ({𝑥} = {𝑦} ↔ 𝑥 = 𝑦) |
| 8 | 7 | a1i 11 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → ({𝑥} = {𝑦} ↔ 𝑥 = 𝑦)) |
| 9 | 3, 8 | dom3 9002 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝒫 𝐴 ∈ V) → 𝐴 ≼ 𝒫 𝐴) |
| 10 | 1, 2, 9 | mp2an 705 | . 2 ⊢ 𝐴 ≼ 𝒫 𝐴 |
| 11 | 1 | canth 7377 | . . . . 5 ⊢ ¬ 𝑓:𝐴–onto→𝒫 𝐴 |
| 12 | f1ofo 6835 | . . . . 5 ⊢ (𝑓:𝐴–1-1-onto→𝒫 𝐴 → 𝑓:𝐴–onto→𝒫 𝐴) | |
| 13 | 11, 12 | mto 200 | . . . 4 ⊢ ¬ 𝑓:𝐴–1-1-onto→𝒫 𝐴 |
| 14 | 13 | nex 1833 | . . 3 ⊢ ¬ ∃𝑓 𝑓:𝐴–1-1-onto→𝒫 𝐴 |
| 15 | bren 8962 | . . 3 ⊢ (𝐴 ≈ 𝒫 𝐴 ↔ ∃𝑓 𝑓:𝐴–1-1-onto→𝒫 𝐴) | |
| 16 | 14, 15 | mtbir 326 | . 2 ⊢ ¬ 𝐴 ≈ 𝒫 𝐴 |
| 17 | brsdom 8980 | . 2 ⊢ (𝐴 ≺ 𝒫 𝐴 ↔ (𝐴 ≼ 𝒫 𝐴 ∧ ¬ 𝐴 ≈ 𝒫 𝐴)) | |
| 18 | 10, 16, 17 | mpbir2an 724 | 1 ⊢ 𝐴 ≺ 𝒫 𝐴 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2146 Vcvv 3458 𝒫 cpw 4567 {csn 4594 class class class wbr 5114 –onto→wfo 6541 –1-1-onto→wf1o 6542 ≈ cen 8949 ≼ cdom 8950 ≺ csdm 8951 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-en 8953 df-dom 8954 df-sdom 8955 |
| This theorem is used by: canth2g 9129 r1sdom 9756 alephsucpw2 10114 dfac13 10145 pwsdompw 10205 numthcor 10496 alephexp1 10582 pwcfsdom 10586 cfpwsdom 10587 gchac 10684 inawinalem 10692 tskcard 10784 gruina 10821 grothac 10833 rpnnen 16308 rexpen 16309 rucALT 16311 rectbntr0 25027 |
| Copyright terms: Public domain | W3C validator |