| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ruc | Structured version Visualization version GIF version | ||
| Description: The set of positive integers is strictly dominated by the set of real numbers, i.e. the real numbers are uncountable. The proof consists of lemmas ruclem1 16283 through ruclem13 16294 and this final piece. Our proof is based on the proof of Theorem 5.18 of [Truss] p. 114. See ruclem13 16294 for the function existence version of this theorem. For an informal discussion of this proof, see mmcomplex.html#uncountable 16294. For an alternate proof see rucALT 16282. This is Metamath 100 proof #22. (Contributed by NM, 13-Oct-2004.) |
| Ref | Expression |
|---|---|
| ruc | ⊢ ℕ ≺ ℝ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | reex 11187 | . . 3 ⊢ ℝ ∈ V | |
| 2 | nnssre 12233 | . . 3 ⊢ ℕ ⊆ ℝ | |
| 3 | ssdomg 8993 | . . 3 ⊢ (ℝ ∈ V → (ℕ ⊆ ℝ → ℕ ≼ ℝ)) | |
| 4 | 1, 2, 3 | mp2 9 | . 2 ⊢ ℕ ≼ ℝ |
| 5 | ruclem13 16294 | . . . . 5 ⊢ ¬ 𝑓:ℕ–onto→ℝ | |
| 6 | f1ofo 6826 | . . . . 5 ⊢ (𝑓:ℕ–1-1-onto→ℝ → 𝑓:ℕ–onto→ℝ) | |
| 7 | 5, 6 | mto 200 | . . . 4 ⊢ ¬ 𝑓:ℕ–1-1-onto→ℝ |
| 8 | 7 | nex 1827 | . . 3 ⊢ ¬ ∃𝑓 𝑓:ℕ–1-1-onto→ℝ |
| 9 | bren 8949 | . . 3 ⊢ (ℕ ≈ ℝ ↔ ∃𝑓 𝑓:ℕ–1-1-onto→ℝ) | |
| 10 | 8, 9 | mtbir 326 | . 2 ⊢ ¬ ℕ ≈ ℝ |
| 11 | brsdom 8967 | . 2 ⊢ (ℕ ≺ ℝ ↔ (ℕ ≼ ℝ ∧ ¬ ℕ ≈ ℝ)) | |
| 12 | 4, 10, 11 | mpbir2an 723 | 1 ⊢ ℕ ≺ ℝ |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ∃wex 1806 ∈ wcel 2149 Vcvv 3463 ⊆ wss 3913 class class class wbr 5110 –onto→wfo 6531 –1-1-onto→wf1o 6532 ≈ cen 8936 ≼ cdom 8937 ≺ csdm 8938 ℝcr 11095 ℕcn 12229 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5239 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 ax-cnex 11152 ax-resscn 11153 ax-1cn 11154 ax-icn 11155 ax-addcl 11156 ax-addrcl 11157 ax-mulcl 11158 ax-mulrcl 11159 ax-mulcom 11160 ax-addass 11161 ax-mulass 11162 ax-distr 11163 ax-i2m1 11164 ax-1ne0 11165 ax-1rid 11166 ax-rnegex 11167 ax-rrecex 11168 ax-cnre 11169 ax-pre-lttri 11170 ax-pre-lttrn 11171 ax-pre-ltadd 11172 ax-pre-mulgt0 11173 ax-pre-sup 11174 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-sup 9398 df-pnf 11241 df-mnf 11242 df-xr 11243 df-ltxr 11244 df-le 11245 df-sub 11439 df-neg 11440 df-div 11868 df-nn 12230 df-2 12299 df-n0 12501 df-z 12588 df-uz 12859 df-fz 13532 df-seq 14034 |
| This theorem is referenced by: resdomq 16296 aleph1re 16297 aleph1irr 16298 |
| Copyright terms: Public domain | W3C validator |