| 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 16405 through ruclem13 16416 and this final piece. Our proof is based on the proof of Theorem 5.18 of [Truss] p. 114. See ruclem13 16416 for the function existence version of this theorem. For an informal discussion of this proof, see mmcomplex.html#uncountable 16416. For an alternate proof see rucALT 16404. This is Metamath 100 proof #22. (Contributed by NM, 13-Oct-2004.) |
| Ref | Expression |
|---|---|
| ruc | ⊢ ℕ ≺ ℝ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | reex 11295 | . . 3 ⊢ ℝ ∈ V | |
| 2 | nnssre 12343 | . . 3 ⊢ ℕ ⊆ ℝ | |
| 3 | ssdomg 9031 | . . 3 ⊢ (ℝ ∈ V → (ℕ ⊆ ℝ → ℕ ≼ ℝ)) | |
| 4 | 1, 2, 3 | mp2 9 | . 2 ⊢ ℕ ≼ ℝ |
| 5 | ruclem13 16416 | . . . . 5 ⊢ ¬ 𝑓:ℕ–onto→ℝ | |
| 6 | f1ofo 6833 | . . . . 5 ⊢ (𝑓:ℕ–1-1-onto→ℝ → 𝑓:ℕ–onto→ℝ) | |
| 7 | 5, 6 | mto 200 | . . . 4 ⊢ ¬ 𝑓:ℕ–1-1-onto→ℝ |
| 8 | 7 | nex 1832 | . . 3 ⊢ ¬ ∃𝑓 𝑓:ℕ–1-1-onto→ℝ |
| 9 | bren 8987 | . . 3 ⊢ (ℕ ≈ ℝ ↔ ∃𝑓 𝑓:ℕ–1-1-onto→ℝ) | |
| 10 | 8, 9 | mtbir 326 | . 2 ⊢ ¬ ℕ ≈ ℝ |
| 11 | brsdom 9005 | . 2 ⊢ (ℕ ≺ ℝ ↔ (ℕ ≼ ℝ ∧ ¬ ℕ ≈ ℝ)) | |
| 12 | 4, 10, 11 | mpbir2an 724 | 1 ⊢ ℕ ≺ ℝ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ∃wex 1811 ∈ wcel 2144 Vcvv 3450 ⊆ wss 3895 class class class wbr 5102 –onto→wfo 6537 –1-1-onto→wf1o 6538 ≈ cen 8974 ≼ cdom 8975 ≺ csdm 8976 ℝcr 11203 ℕcn 12339 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 ax-cnex 11260 ax-resscn 11261 ax-1cn 11262 ax-icn 11263 ax-addcl 11264 ax-addrcl 11265 ax-mulcl 11266 ax-mulrcl 11267 ax-mulcom 11268 ax-addass 11269 ax-mulass 11270 ax-distr 11271 ax-i2m1 11272 ax-1ne0 11273 ax-1rid 11274 ax-rnegex 11275 ax-rrecex 11276 ax-cnre 11277 ax-pre-lttri 11278 ax-pre-lttrn 11279 ax-pre-ltadd 11280 ax-pre-mulgt0 11281 ax-pre-sup 11282 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7378 df-ov 7424 df-oprab 7425 df-mpo 7426 df-om 7879 df-1st 8002 df-2nd 8003 df-frecs 8303 df-wrecs 8334 df-recs 8383 df-rdg 8422 df-er 8721 df-en 8978 df-dom 8979 df-sdom 8980 df-sup 9438 df-pnf 11349 df-mnf 11350 df-xr 11351 df-ltxr 11352 df-le 11353 df-sub 11547 df-neg 11548 df-div 11978 df-nn 12340 df-2 12409 df-n0 12611 df-z 12698 df-uz 12970 df-fz 13644 df-seq 14149 |
| This theorem is used by: resdomq 16418 aleph1re 16419 aleph1irr 16420 |
| Copyright terms: Public domain | W3C validator |