| 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 16319 through ruclem13 16330 and this final piece. Our proof is based on the proof of Theorem 5.18 of [Truss] p. 114. See ruclem13 16330 for the function existence version of this theorem. For an informal discussion of this proof, see mmcomplex.html#uncountable 16330. For an alternate proof see rucALT 16318. This is Metamath 100 proof #22. (Contributed by NM, 13-Oct-2004.) |
| Ref | Expression |
|---|---|
| ruc | ⊢ ℕ ≺ ℝ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | reex 11215 | . . 3 ⊢ ℝ ∈ V | |
| 2 | nnssre 12261 | . . 3 ⊢ ℕ ⊆ ℝ | |
| 3 | ssdomg 9006 | . . 3 ⊢ (ℝ ∈ V → (ℕ ⊆ ℝ → ℕ ≼ ℝ)) | |
| 4 | 1, 2, 3 | mp2 9 | . 2 ⊢ ℕ ≼ ℝ |
| 5 | ruclem13 16330 | . . . . 5 ⊢ ¬ 𝑓:ℕ–onto→ℝ | |
| 6 | f1ofo 6825 | . . . . 5 ⊢ (𝑓:ℕ–1-1-onto→ℝ → 𝑓:ℕ–onto→ℝ) | |
| 7 | 5, 6 | mto 200 | . . . 4 ⊢ ¬ 𝑓:ℕ–1-1-onto→ℝ |
| 8 | 7 | nex 1833 | . . 3 ⊢ ¬ ∃𝑓 𝑓:ℕ–1-1-onto→ℝ |
| 9 | bren 8962 | . . 3 ⊢ (ℕ ≈ ℝ ↔ ∃𝑓 𝑓:ℕ–1-1-onto→ℝ) | |
| 10 | 8, 9 | mtbir 326 | . 2 ⊢ ¬ ℕ ≈ ℝ |
| 11 | brsdom 8980 | . 2 ⊢ (ℕ ≺ ℝ ↔ (ℕ ≼ ℝ ∧ ¬ ℕ ≈ ℝ)) | |
| 12 | 4, 10, 11 | mpbir2an 724 | 1 ⊢ ℕ ≺ ℝ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ∃wex 1812 ∈ wcel 2145 Vcvv 3450 ⊆ wss 3899 class class class wbr 5103 –onto→wfo 6531 –1-1-onto→wf1o 6532 ≈ cen 8949 ≼ cdom 8950 ≺ csdm 8951 ℝcr 11123 ℕcn 12257 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 ax-pre-sup 11202 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 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 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-sup 9412 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-div 11896 df-nn 12258 df-2 12327 df-n0 12529 df-z 12616 df-uz 12888 df-fz 13562 df-seq 14066 |
| This theorem is used by: resdomq 16332 aleph1re 16333 aleph1irr 16334 |
| Copyright terms: Public domain | W3C validator |